#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
vector<int> createFunTour(int n, int q) {
if (n == 2) return vector<int>{0,1};
vector<int> origin_sz(n, 0);
for (int i=1; i<n; ++i) origin_sz[i] = attractionsBehind(0, i);
int min_val = n+1;
int cent = 0;
for (int i=1; i<n; ++i) {
if (origin_sz[i] > n/2 && min_val > origin_sz[i]) {
min_val = origin_sz[i];
cent = i;
}
}
// cout << cent << endl;
vector<int> dist(n, 0);
vector<int> subtree_root;
for (int i=0; i<n; ++i) {
dist[i] = hoursRequired(cent, i);
if (dist[i] == 1) subtree_root.push_back(i);
// cout << dist[i] << ' ';
}
// cout << endl;
vector<vector<int>> subtree(subtree_root.size());
for (int i=0; i<n; ++i) {
if (i != cent) {
bool found = false;
for (int j=0; j+1<subtree_root.size(); ++j) {
int d = hoursRequired(subtree_root[j], i);
if (d == dist[i]-1) {
subtree[j].push_back(i);
found = true;
break;
}
}
if (!found) subtree.back().push_back(i);
}
}
for (vector<int>& v: subtree) {
sort(v.begin(), v.end(), [&](int a, int b) {
return dist[a] < dist[b];
});
}
// for (vector<int> v: subtree) {
// for (int x: v) {
// cout << x << ' ';
// }
// cout << endl;
// }
assert(subtree.size() != 1);
vector<int> ans;
if (subtree.size() == 2) {
assert(abs((int)subtree[0].size()-(int)subtree[1].size()) <= 1);
if (subtree[0].size() > subtree[1].size()) swap(subtree[0], subtree[1]);
while (!subtree[0].empty()) {
ans.push_back(subtree[1].back());
ans.push_back(subtree[0].back());
subtree[1].pop_back();
subtree[0].pop_back();
}
if (!subtree[1].empty()) {
ans.push_back(subtree[1][0]);
subtree[1].pop_back();
}
assert(subtree[1].empty());
} else {
assert(subtree.size() == 3);
int prev_tree = -1;
while (2 * max({ subtree[0].size(), subtree[1].size(), subtree[2].size() }) < subtree[0].size() + subtree[1].size() + subtree[2].size()) {
int max_dist = 0;
int max_tree = -1;
for (int i=0; i<3; ++i) {
if (i != prev_tree && max_dist < dist[subtree[i].back()]) {
max_dist = dist[subtree[i].back()];
max_tree = i;
}
}
ans.push_back(subtree[max_tree].back());
subtree[max_tree].pop_back();
prev_tree = max_tree;
}
for (int i=0; i<3; ++i) {
for (int j=0; j<3; ++j) {
if (subtree[i].size() > subtree[j].size()) {
if (prev_tree == i) prev_tree = j;
else if (prev_tree == j) prev_tree = i;
swap(subtree[i], subtree[j]);
}
}
}
// cout << prev_tree << endl;
// for (vector<int> v: subtree) {
// for (int x: v) {
// cout << x << ' ';
// }
// cout << endl;
// }
assert(prev_tree != 0);
if (prev_tree != -1 && !subtree[3-prev_tree].empty() && dist[subtree[3-prev_tree].back()] > dist[subtree[0].back()]) {
// previous location of get into subtree 0 has to be deepest place
if (dist[subtree[prev_tree].back()] < dist[subtree[3-prev_tree].back()]) {
prev_tree = 3-prev_tree;
ans.push_back(subtree[prev_tree].back());
subtree[prev_tree].pop_back();
}
}
while (true) {
if (prev_tree == 0) {
int max_dist = 0;
int max_tree = -1;
if (!subtree[1].empty() && dist[subtree[1].back()] > max_dist) {
max_dist = dist[subtree[1].back()];
max_tree = 1;
}
if (!subtree[2].empty() && dist[subtree[2].back()] > max_dist) {
max_dist = dist[subtree[2].back()];
max_tree = 2;
}
if (max_tree == -1) break;
ans.push_back(subtree[max_tree].back());
subtree[max_tree].pop_back();
prev_tree = max_tree;
} else {
if (subtree[0].empty()) break;
ans.push_back(subtree[0].back());
subtree[0].pop_back();
prev_tree = 0;
}
}
}
ans.push_back(cent);
// for (int x: ans) cout << x << ' ';
// cout << endl;
return ans;
}
Compilation message
fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:35:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
35 | for (int j=0; j+1<subtree_root.size(); ++j) {
| ~~~^~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
304 KB |
Output is correct |
5 |
Correct |
0 ms |
300 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
300 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
0 ms |
212 KB |
Output is correct |
20 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
304 KB |
Output is correct |
5 |
Correct |
0 ms |
300 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
300 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
0 ms |
212 KB |
Output is correct |
20 |
Correct |
0 ms |
212 KB |
Output is correct |
21 |
Correct |
0 ms |
292 KB |
Output is correct |
22 |
Correct |
0 ms |
212 KB |
Output is correct |
23 |
Correct |
1 ms |
212 KB |
Output is correct |
24 |
Correct |
1 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
0 ms |
212 KB |
Output is correct |
27 |
Correct |
0 ms |
212 KB |
Output is correct |
28 |
Correct |
0 ms |
212 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
0 ms |
300 KB |
Output is correct |
31 |
Correct |
1 ms |
212 KB |
Output is correct |
32 |
Correct |
1 ms |
340 KB |
Output is correct |
33 |
Correct |
0 ms |
212 KB |
Output is correct |
34 |
Correct |
1 ms |
340 KB |
Output is correct |
35 |
Correct |
1 ms |
340 KB |
Output is correct |
36 |
Correct |
1 ms |
340 KB |
Output is correct |
37 |
Correct |
1 ms |
212 KB |
Output is correct |
38 |
Correct |
1 ms |
340 KB |
Output is correct |
39 |
Correct |
1 ms |
300 KB |
Output is correct |
40 |
Correct |
1 ms |
340 KB |
Output is correct |
41 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
304 KB |
Output is correct |
4 |
Correct |
0 ms |
300 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
292 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
300 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
101 ms |
16552 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
468 KB |
Output is correct |
21 |
Correct |
3 ms |
724 KB |
Output is correct |
22 |
Correct |
5 ms |
1200 KB |
Output is correct |
23 |
Correct |
13 ms |
2260 KB |
Output is correct |
24 |
Correct |
13 ms |
2996 KB |
Output is correct |
25 |
Correct |
54 ms |
9552 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
0 ms |
300 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
8 ms |
1712 KB |
Output is correct |
15 |
Correct |
106 ms |
16464 KB |
Output is correct |
16 |
Correct |
124 ms |
16204 KB |
Output is correct |
17 |
Correct |
20 ms |
3944 KB |
Output is correct |
18 |
Correct |
51 ms |
7560 KB |
Output is correct |
19 |
Correct |
81 ms |
12924 KB |
Output is correct |
20 |
Correct |
3 ms |
852 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
304 KB |
Output is correct |
5 |
Correct |
0 ms |
300 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
300 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
0 ms |
212 KB |
Output is correct |
20 |
Correct |
0 ms |
212 KB |
Output is correct |
21 |
Correct |
0 ms |
292 KB |
Output is correct |
22 |
Correct |
0 ms |
212 KB |
Output is correct |
23 |
Correct |
1 ms |
212 KB |
Output is correct |
24 |
Correct |
1 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
0 ms |
212 KB |
Output is correct |
27 |
Correct |
0 ms |
212 KB |
Output is correct |
28 |
Correct |
0 ms |
212 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
0 ms |
300 KB |
Output is correct |
31 |
Correct |
1 ms |
212 KB |
Output is correct |
32 |
Correct |
1 ms |
340 KB |
Output is correct |
33 |
Correct |
0 ms |
212 KB |
Output is correct |
34 |
Correct |
1 ms |
340 KB |
Output is correct |
35 |
Correct |
1 ms |
340 KB |
Output is correct |
36 |
Correct |
1 ms |
340 KB |
Output is correct |
37 |
Correct |
1 ms |
212 KB |
Output is correct |
38 |
Correct |
1 ms |
340 KB |
Output is correct |
39 |
Correct |
1 ms |
300 KB |
Output is correct |
40 |
Correct |
1 ms |
340 KB |
Output is correct |
41 |
Correct |
1 ms |
212 KB |
Output is correct |
42 |
Correct |
1 ms |
300 KB |
Output is correct |
43 |
Correct |
1 ms |
340 KB |
Output is correct |
44 |
Correct |
101 ms |
16552 KB |
Output is correct |
45 |
Correct |
1 ms |
340 KB |
Output is correct |
46 |
Correct |
2 ms |
468 KB |
Output is correct |
47 |
Correct |
3 ms |
724 KB |
Output is correct |
48 |
Correct |
5 ms |
1200 KB |
Output is correct |
49 |
Correct |
13 ms |
2260 KB |
Output is correct |
50 |
Correct |
13 ms |
2996 KB |
Output is correct |
51 |
Correct |
54 ms |
9552 KB |
Output is correct |
52 |
Correct |
1 ms |
340 KB |
Output is correct |
53 |
Correct |
8 ms |
1712 KB |
Output is correct |
54 |
Correct |
106 ms |
16464 KB |
Output is correct |
55 |
Correct |
124 ms |
16204 KB |
Output is correct |
56 |
Correct |
20 ms |
3944 KB |
Output is correct |
57 |
Correct |
51 ms |
7560 KB |
Output is correct |
58 |
Correct |
81 ms |
12924 KB |
Output is correct |
59 |
Correct |
3 ms |
852 KB |
Output is correct |
60 |
Correct |
129 ms |
16452 KB |
Output is correct |
61 |
Correct |
160 ms |
18908 KB |
Output is correct |
62 |
Correct |
132 ms |
16580 KB |
Output is correct |
63 |
Correct |
142 ms |
20524 KB |
Output is correct |
64 |
Correct |
143 ms |
20468 KB |
Output is correct |
65 |
Correct |
164 ms |
16596 KB |
Output is correct |
66 |
Correct |
170 ms |
18732 KB |
Output is correct |
67 |
Correct |
161 ms |
20604 KB |
Output is correct |
68 |
Correct |
162 ms |
19716 KB |
Output is correct |
69 |
Correct |
197 ms |
21060 KB |
Output is correct |
70 |
Correct |
135 ms |
16560 KB |
Output is correct |
71 |
Correct |
140 ms |
20348 KB |
Output is correct |
72 |
Correct |
170 ms |
19232 KB |
Output is correct |
73 |
Correct |
177 ms |
19692 KB |
Output is correct |
74 |
Correct |
182 ms |
21336 KB |
Output is correct |
75 |
Correct |
140 ms |
16568 KB |
Output is correct |
76 |
Correct |
152 ms |
20416 KB |
Output is correct |
77 |
Correct |
164 ms |
20548 KB |
Output is correct |
78 |
Correct |
144 ms |
19756 KB |
Output is correct |
79 |
Correct |
195 ms |
21156 KB |
Output is correct |
80 |
Correct |
186 ms |
21540 KB |
Output is correct |
81 |
Correct |
139 ms |
16452 KB |
Output is correct |
82 |
Correct |
143 ms |
16568 KB |
Output is correct |
83 |
Correct |
164 ms |
16808 KB |
Output is correct |
84 |
Correct |
54 ms |
7076 KB |
Output is correct |