oj.uz

Submission #724928

# Submission time Handle Problem Language Result Execution time Memory
724928 2023-04-16T10:08:54 Z hollwo_pelw Fun Tour (APIO20_fun) C++17
100 / 100
 297 ms 21440 KB 
#include "fun.h"
// #include "grader.cpp"

#include <bits/stdc++.h>
using namespace std;
 
vector<int> createFunTour(int N, int Q) {
 
	int centroid = 0, tmp = N;
	for (int i = 1; i < N; i++) {
		int siz = attractionsBehind(0, i);
		if (siz > N / 2 && siz < tmp)
			centroid = i, tmp = siz;
	}
 
	vector<int> depth(N, 0), group(N, 0);
 
	for (int i = 0; i < N; i++) if (i != centroid) {
		depth[i] = hoursRequired(centroid, i);
	}
 
	vector<int> branch;
	for (int i = 0; i < N; i++)
		if (depth[i] == 1)
			branch.push_back(i);
 
	int M = branch.size();
 
	for (int i = 0; i < N; i++) if (i != centroid) {
		for (int j = 1; j < M; j++)
			if (hoursRequired(branch[j], i) == depth[i] - 1) {
				group[i] = j; break;
			}
	}
 
	vector<vector<int>> list_val(M = 3);
	for (int i = 0; i < N; i++) if (i != centroid) {
		list_val[group[i]].push_back(i);
	}
 
	for (int i = 0; i < M; i++) {
		sort(list_val[i].begin(), list_val[i].end(), [&](const int &i, const int &j){
			return depth[i] < depth[j];
		});
	}
 
	vector<int> res, p = {0, 1, 2};
 
	int last = -1;
 
	while (true) {
		sort(p.begin(), p.end(), [&](const int &i, const int &j){
			return list_val[i].size() > list_val[j].size();
		});
		
		if (list_val[p[0]].size() >= list_val[p[1]].size() + list_val[p[2]].size())
			break ;
 
		for (int i = 0; i < 3; i++)
			assert(!list_val[i].empty());
 
		sort(p.begin(), p.end(), [&](const int &i, const int &j){
			return depth[list_val[i].back()] > depth[list_val[j].back()];
		});
 
		int cur = last == p[0] ? p[1] : p[0];
 
		res.push_back(list_val[cur].back());
		list_val[cur].pop_back(), last = cur;
	}
 
	list_val[p[1]].insert(list_val[p[1]].end(), list_val[p[2]].begin(), list_val[p[2]].end());
	
	sort(list_val[p[1]].begin(), list_val[p[1]].end(), [&](const int &i, const int &j){
		return depth[i] < depth[j];
	});
 
	last = ((int) res.size() >= 2
		&& group[res[res.size() - 2]] != p[0]
		&& depth[res[res.size() - 2]] > depth[res.back()]
		&& depth[list_val[p[1]].back()] > depth[res.back()]
		) ? 1 : 0;
 
	for (; list_val[p[last]].size(); last ^= 1) {
		res.push_back(list_val[p[last]].back());
		list_val[p[last]].pop_back();
	}
 
	res.push_back(centroid);
 
	return res;
}

Subtask #1
10.0 / 10.0

# 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 0 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

Subtask #2
16.0 / 16.0

# 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 0 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 212 KB Output is correct
22 Correct 0 ms 300 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 1 ms 212 KB Output is correct
27 Correct 1 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 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 304 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 304 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 300 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 1 ms 212 KB Output is correct
15 Correct 1 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 116 ms 16568 KB Output is correct
19 Correct 2 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 1220 KB Output is correct
23 Correct 16 ms 2280 KB Output is correct
24 Correct 15 ms 3028 KB Output is correct
25 Correct 66 ms 9560 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 9 ms 1784 KB Output is correct
15 Correct 131 ms 16528 KB Output is correct
16 Correct 124 ms 16420 KB Output is correct
17 Correct 20 ms 3996 KB Output is correct
18 Correct 50 ms 7704 KB Output is correct
19 Correct 100 ms 12888 KB Output is correct
20 Correct 5 ms 824 KB Output is correct

Subtask #5
34.0 / 34.0

# 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 0 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 212 KB Output is correct
22 Correct 0 ms 300 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 1 ms 212 KB Output is correct
27 Correct 1 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 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 304 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 304 KB Output is correct
39 Correct 1 ms 340 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 116 ms 16568 KB Output is correct
45 Correct 2 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 1220 KB Output is correct
49 Correct 16 ms 2280 KB Output is correct
50 Correct 15 ms 3028 KB Output is correct
51 Correct 66 ms 9560 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 9 ms 1784 KB Output is correct
54 Correct 131 ms 16528 KB Output is correct
55 Correct 124 ms 16420 KB Output is correct
56 Correct 20 ms 3996 KB Output is correct
57 Correct 50 ms 7704 KB Output is correct
58 Correct 100 ms 12888 KB Output is correct
59 Correct 5 ms 824 KB Output is correct
60 Correct 161 ms 16452 KB Output is correct
61 Correct 193 ms 18860 KB Output is correct
62 Correct 186 ms 16740 KB Output is correct
63 Correct 168 ms 20548 KB Output is correct
64 Correct 176 ms 20360 KB Output is correct
65 Correct 188 ms 16580 KB Output is correct
66 Correct 238 ms 18916 KB Output is correct
67 Correct 249 ms 20624 KB Output is correct
68 Correct 224 ms 19832 KB Output is correct
69 Correct 297 ms 21176 KB Output is correct
70 Correct 180 ms 16584 KB Output is correct
71 Correct 175 ms 20372 KB Output is correct
72 Correct 228 ms 19116 KB Output is correct
73 Correct 212 ms 19772 KB Output is correct
74 Correct 231 ms 21312 KB Output is correct
75 Correct 173 ms 16596 KB Output is correct
76 Correct 186 ms 20496 KB Output is correct
77 Correct 195 ms 20620 KB Output is correct
78 Correct 210 ms 19736 KB Output is correct
79 Correct 198 ms 21156 KB Output is correct
80 Correct 294 ms 21440 KB Output is correct
81 Correct 168 ms 16372 KB Output is correct
82 Correct 160 ms 16596 KB Output is correct
83 Correct 175 ms 16764 KB Output is correct
84 Correct 79 ms 7092 KB Output is correct