QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#154204#6414. Classical Maximization ProblemPhantomThreshold#WA 157ms3568kbC++201.2kb2023-08-31 14:55:112023-08-31 14:55:11

Judging History

你现在查看的是最新测评结果

  • [2023-08-31 14:55:11]
  • 评测
  • 测评结果:WA
  • 用时:157ms
  • 内存:3568kb
  • [2023-08-31 14:55:11]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int T;
	cin>>T;
	while(T--)
	{
		int n;
		cin>>n;
		n*=2;
		vector<int> x(n+5),y(n+5);
		map<int,map<int,int>> sx,sy;
		for(int i=1;i<=n;i++)
		{
			cin>>x[i]>>y[i];
			sx[x[i]][y[i]]=i;
			sy[y[i]][x[i]]=i;
		}
		vector<int> vis(n+5);
		vector<pair<int,int>> ans;
		function<int(int)> dfs=[&](int u)
		{
			vis[u]=1;
			vector<int> rem;
			for(auto [y0,v]:sx[x[u]])
			{
				if(not vis[v])
				{
					int r=dfs(v);
					if(r)rem.push_back(r);
				}
			}
			for(auto [x0,v]:sy[y[u]])
			{
				if(not vis[v])
				{
					int r=dfs(v);
					if(r)rem.push_back(r);
				}
			}
			rem.push_back(u);
			int sz=rem.size();
			for(int i=0;i+1<sz;i+=2)
			{
				ans.emplace_back(rem[i],rem[i+1]);
			}
			if(sz%2==1)return rem[sz-1];
			else return 0;
		};
		vector<int> rem;
		for(int i=1;i<=n;i++)
		{
			if(not vis[i])
			{
				int r=dfs(i);
				if(r)rem.push_back(r);
			}
		}
		cout<<ans.size()<<endl;
		for(unsigned i=0;i<rem.size();i+=2)
			ans.emplace_back(rem[i],rem[i+1]);
		for(auto [u,v]:ans)
		{
			cout<<u<<' '<<v<<"\n";
		}
	}
	
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3372kb

input:

3
2
0 0
0 1
1 0
1 1
2
0 0
0 1
0 2
0 3
2
0 0
1 1
2 2
3 3

output:

2
3 4
2 1
2
4 3
2 1
0
1 2
3 4

result:

ok ok (3 test cases)

Test #2:

score: 0
Accepted
time: 157ms
memory: 3532kb

input:

10000
2
-107276936 -310501829
419434212 585811870
-65754386 -491212232
381152038 897148193
3
-474045168 493506332
299114415 540203303
165808153 983551
-506936261 -694189769
766718170 -725540031
975267148 -593051087
1
-818952276 -762387923
584023914 -612401389
6
-77701228 -266484128
659434465 6322062...

output:

0
1 2
3 4
0
1 2
3 4
5 6
0
1 2
0
1 2
3 4
5 6
7 8
9 10
11 12
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
0
1 2
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
21 22
23 24
25 26
27 28
29 30
31 32
33 34
35 36
37 38
39 40
41 42
43 44
45 46
47 48
49 50
51 52
53 54
55 56
57 58
59 60
61 62
63 64
65 66
0
1 2
3 4...

result:

ok ok (10000 test cases)

Test #3:

score: 0
Accepted
time: 113ms
memory: 3504kb

input:

10000
1
999855386 999580905
999342928 999615227
21
999601032 999015398
999155628 999176944
999309856 999524434
999121011 999509537
999323572 999685730
999272272 999769606
999450559 999390758
999632027 999178534
999024993 999463838
999784856 999374197
999980525 999366771
999241260 999516879
999599548...

output:

0
1 2
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
21 22
23 24
25 26
27 28
29 30
31 32
33 34
35 36
37 38
39 40
41 42
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
21 22
23 24
25 26
27 28
29 30
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
21 22
23 24
25 26
27 28
0
1 2
3 4
5 6
7...

result:

ok ok (10000 test cases)

Test #4:

score: 0
Accepted
time: 146ms
memory: 3556kb

input:

10000
5
999984799 999981445
999958394 999984217
999994978 999981258
999955539 999938710
999936554 999963561
999907222 999907508
999938166 999941959
999910567 999986887
999901446 999961092
999994730 999963038
5
999916115 999962400
999948250 999940355
999954204 999920844
999928148 999990369
999978118 ...

output:

0
1 2
3 4
5 6
7 8
9 10
0
1 2
3 4
5 6
7 8
9 10
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
21 22
0
1 2
3 4
5 6
7 8
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
21 22
23 24
25 26
27 28
29 30
31 32
0
1 2
3 4
5 6
7 8
9 10
0
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
0
1 2
3 4
5 6
7 8
9 10
1...

result:

ok ok (10000 test cases)

Test #5:

score: -100
Wrong Answer
time: 142ms
memory: 3568kb

input:

10000
1
999990146 999993828
999995909 999996353
56
999999851 999991179
999997250 999997987
999990590 999997316
999997350 999996856
999997034 999996236
999999396 999996897
999991180 999993309
999991265 999995185
999993952 999994054
999990210 999994471
999993201 999995893
999997170 999998971
999998201...

output:

0
1 2
1
111 76
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
21 22
23 24
25 26
27 28
29 30
31 32
33 34
35 36
37 38
39 40
41 42
43 44
45 46
47 48
49 50
51 52
53 54
55 56
57 58
59 60
61 62
63 64
65 66
67 68
69 70
71 72
73 74
75 77
78 79
80 81
82 83
84 85
86 87
88 89
90 91
92 93
94 95
96 97
98 99
...

result:

wrong answer wrong number of friendly pairs: printed 1, but it is actually 0 (test case 5022)