# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1032893 | 2024-07-24T10:28:35 Z | fv3 | Connecting Supertrees (IOI20_supertrees) | C++14 | 160 ms | 30200 KB |
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); for (int i = 0; i < n; i++) p[i].push_back(i); sort(p.begin(), p.end()); // 1. Find all parts which are the same vector<vector<int>> parts = { {p[0].back()} }; map<vector<int>, vector<int>> cycles; int l = 0, r = 1; while (r < n) { int i = 0; for (; i < n; i++) { if (p[r-1][i] != p[r][i]) break; } if (i != n) { parts.push_back({p[r].back()}); // Count 1's in last part int one_cnt = 0; for (int j = 0; j < n; j++) { if (p[r-1][j] == 1) one_cnt++; } if (one_cnt != r - l) return 0; vector<int> bs(n); for (int j = 0; j < n; j++) { if (p[r-1][j]) bs[j] = 1; } cycles[bs].push_back(p[r-1].back()); l = r; } else { parts.back().push_back(p[r].back()); } r++; } // Count 1's in last part int one_cnt = 0; for (int j = 0; j < n; j++) { if (p[r-1][j] == 1) one_cnt++; } if (one_cnt != r - l) return 0; vector<int> bs(n); for (int j = 0; j < n; j++) { if (p[r-1][j]) bs[j] = 1; } cycles[bs].push_back(r-1); // 2. Generate parts vector<vector<int>> answer(n, vector<int>(n)); for (auto path : parts) { for (int i = 1; i < path.size(); i++) { answer[path[i]][path[i-1]] = 1; answer[path[i-1]][path[i]] = 1; } } // 3. Generate cycles for (auto cycle : cycles) { if (cycle.second.size() == 1) continue; if (cycle.second.size() == 2) return 0; for (int i = 1; i < cycle.second.size(); i++) { answer[cycle.second[i]][cycle.second[i-1]] = 1; answer[cycle.second[i-1]][cycle.second[i]] = 1; } answer[cycle.second[0]][cycle.second.back()] = 1; answer[cycle.second.back()][cycle.second[0]] = 1; } // 4. Profit build(answer); return 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 8 ms | 1424 KB | Output is correct |
7 | Correct | 129 ms | 25876 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 8 ms | 1424 KB | Output is correct |
7 | Correct | 129 ms | 25876 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 5 ms | 1616 KB | Output is correct |
13 | Correct | 126 ms | 30032 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 3 ms | 860 KB | Output is correct |
17 | Correct | 56 ms | 12116 KB | Output is correct |
18 | Correct | 0 ms | 348 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 37 ms | 6996 KB | Output is correct |
21 | Correct | 123 ms | 26040 KB | Output is correct |
22 | Correct | 160 ms | 27672 KB | Output is correct |
23 | Correct | 126 ms | 25940 KB | Output is correct |
24 | Correct | 127 ms | 29908 KB | Output is correct |
25 | Correct | 56 ms | 12112 KB | Output is correct |
26 | Correct | 64 ms | 12884 KB | Output is correct |
27 | Correct | 128 ms | 25940 KB | Output is correct |
28 | Correct | 126 ms | 29900 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 5 ms | 1656 KB | Output is correct |
9 | Correct | 133 ms | 30200 KB | Output is correct |
10 | Correct | 1 ms | 344 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Correct | 5 ms | 1368 KB | Output is correct |
13 | Correct | 120 ms | 26096 KB | Output is correct |
14 | Incorrect | 0 ms | 348 KB | Answer gives possible 1 while actual possible 0 |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 43 ms | 7036 KB | Output is correct |
5 | Correct | 129 ms | 25936 KB | Output is correct |
6 | Correct | 118 ms | 27728 KB | Output is correct |
7 | Correct | 128 ms | 25940 KB | Output is correct |
8 | Incorrect | 0 ms | 348 KB | Too many ways to get from 0 to 4, should be 0 found no less than 1 |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 8 ms | 1424 KB | Output is correct |
7 | Correct | 129 ms | 25876 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 5 ms | 1616 KB | Output is correct |
13 | Correct | 126 ms | 30032 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 3 ms | 860 KB | Output is correct |
17 | Correct | 56 ms | 12116 KB | Output is correct |
18 | Correct | 0 ms | 348 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 37 ms | 6996 KB | Output is correct |
21 | Correct | 123 ms | 26040 KB | Output is correct |
22 | Correct | 160 ms | 27672 KB | Output is correct |
23 | Correct | 126 ms | 25940 KB | Output is correct |
24 | Correct | 127 ms | 29908 KB | Output is correct |
25 | Correct | 56 ms | 12112 KB | Output is correct |
26 | Correct | 64 ms | 12884 KB | Output is correct |
27 | Correct | 128 ms | 25940 KB | Output is correct |
28 | Correct | 126 ms | 29900 KB | Output is correct |
29 | Correct | 1 ms | 348 KB | Output is correct |
30 | Correct | 0 ms | 344 KB | Output is correct |
31 | Correct | 0 ms | 348 KB | Output is correct |
32 | Correct | 0 ms | 348 KB | Output is correct |
33 | Correct | 0 ms | 348 KB | Output is correct |
34 | Correct | 0 ms | 348 KB | Output is correct |
35 | Correct | 0 ms | 348 KB | Output is correct |
36 | Correct | 5 ms | 1656 KB | Output is correct |
37 | Correct | 133 ms | 30200 KB | Output is correct |
38 | Correct | 1 ms | 344 KB | Output is correct |
39 | Correct | 1 ms | 348 KB | Output is correct |
40 | Correct | 5 ms | 1368 KB | Output is correct |
41 | Correct | 120 ms | 26096 KB | Output is correct |
42 | Incorrect | 0 ms | 348 KB | Answer gives possible 1 while actual possible 0 |
43 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 8 ms | 1424 KB | Output is correct |
7 | Correct | 129 ms | 25876 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 5 ms | 1616 KB | Output is correct |
13 | Correct | 126 ms | 30032 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 3 ms | 860 KB | Output is correct |
17 | Correct | 56 ms | 12116 KB | Output is correct |
18 | Correct | 0 ms | 348 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 37 ms | 6996 KB | Output is correct |
21 | Correct | 123 ms | 26040 KB | Output is correct |
22 | Correct | 160 ms | 27672 KB | Output is correct |
23 | Correct | 126 ms | 25940 KB | Output is correct |
24 | Correct | 127 ms | 29908 KB | Output is correct |
25 | Correct | 56 ms | 12112 KB | Output is correct |
26 | Correct | 64 ms | 12884 KB | Output is correct |
27 | Correct | 128 ms | 25940 KB | Output is correct |
28 | Correct | 126 ms | 29900 KB | Output is correct |
29 | Correct | 1 ms | 348 KB | Output is correct |
30 | Correct | 0 ms | 344 KB | Output is correct |
31 | Correct | 0 ms | 348 KB | Output is correct |
32 | Correct | 0 ms | 348 KB | Output is correct |
33 | Correct | 0 ms | 348 KB | Output is correct |
34 | Correct | 0 ms | 348 KB | Output is correct |
35 | Correct | 0 ms | 348 KB | Output is correct |
36 | Correct | 5 ms | 1656 KB | Output is correct |
37 | Correct | 133 ms | 30200 KB | Output is correct |
38 | Correct | 1 ms | 344 KB | Output is correct |
39 | Correct | 1 ms | 348 KB | Output is correct |
40 | Correct | 5 ms | 1368 KB | Output is correct |
41 | Correct | 120 ms | 26096 KB | Output is correct |
42 | Incorrect | 0 ms | 348 KB | Answer gives possible 1 while actual possible 0 |
43 | Halted | 0 ms | 0 KB | - |