QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #589510 | #6414. Classical Maximization Problem | Tobo# | WA | 119ms | 3964kb | C++20 | 2.6kb | 2024-09-25 18:13:37 | 2024-09-25 18:13:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int tot = 0;
map<int, int> idx, idy;
vector<set<pair<int, int>>> adj(n * 4 + 1);
for (int i = 1, x, y; i <= n * 2; i++)
{
cin >> x >> y;
if (!idx.count(x))
idx[x] = ++tot;
if (!idy.count(y))
idy[y] = ++tot;
adj[idx[x]].insert({idy[y], i});
adj[idy[y]].insert({idx[x], i});
}
vector<int> vis(n * 4 + 1);
vector<pair<int, int>> ans;
auto dfs = [&](auto &dfs, int cur) -> int
{
vis[cur] = 1;
int ret = 0;
for (auto &[to, id] : adj[cur])
{
adj[to].erase({cur, id});
if (!vis[to])
{
int tmp = dfs(dfs, to);
if (tmp)
{
ans.push_back({tmp, id});
vis[tmp] = vis[id] = 1;
}
else if (ret)
{
ans.push_back({ret, id});
vis[ret] = vis[id] = 1;
ret = 0;
}
else
ret = id;
}
else
{
int tmp = 0;
if (tmp)
{
ans.push_back({tmp, id});
vis[tmp] = vis[id] = 1;
}
else if (ret)
{
ans.push_back({ret, id});
vis[ret] = vis[id] = 1;
ret = 0;
}
else
ret = id;
}
}
return ret;
};
for (int i = 1; i <= tot; i++)
if (!vis[i])
dfs(dfs, i);
cout << ans.size() << '\n';
vis.assign(n * 4 + 1, 0);
for (auto &[x, y] : ans)
{
vis[x] = vis[y] = 1;
cout << x << ' ' << y << '\n';
}
for (int i = 1, j = 0; i <= n * 2; i++)
{
if (vis[i])
continue;
j += 1;
cout << i << " \n"[j % 2 == 0];
}
}
}
/*
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3788kb
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 2 4 3 1 2 1 2 3 4 0 1 2 3 4
result:
ok ok (3 test cases)
Test #2:
score: 0
Accepted
time: 119ms
memory: 3964kb
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: 112ms
memory: 3664kb
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: 115ms
memory: 3744kb
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: 0
Accepted
time: 113ms
memory: 3944kb
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:
ok ok (10000 test cases)
Test #6:
score: -100
Wrong Answer
time: 115ms
memory: 3652kb
input:
10000 5 999999432 999999813 999999271 999999233 999999043 999999606 999999523 999999406 999999564 999999274 999999641 999999102 999999903 999999858 999999058 999999098 999999974 999999119 999999643 999999620 5 999999370 999999738 999999181 999999907 999999163 999999783 999999393 999999086 999999661 ...
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 0 1 2 3 4 5 6 7 8 9 10 1 9 10 1 2 3 4 5 6 7 8 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 1 13 12 1 2 3 4 5 6 7 8 9 10 11 14 15 16 0 1 2 3 4 0 1 2 3 4 1 10 44 1 2 3 4 5 6 7 8 9 11 12 13 14 15 16 17 18 19 20 21 22...
result:
wrong answer worse than author's solution: expected 7, found 6 (test case 58)