Submission #726857

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
726857	2023-04-19T12:58:14 Z	SanguineChameleon	Fun Tour (APIO20_fun)	C++17	100 / 100	292 ms	21856 KB

#include "fun.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> createFunTour(int N, int Q) {
	pair<int, int> best = {N + 1, -1};
	for (int i = 0; i < N; i++) {
		int sz = attractionsBehind(0, i);
		if (sz * 2 >= N) {
			best = min(best, {sz, i});
		}
	}
	int root = best.second;
	vector<int> ch;
	vector<int> depth(N);
	for (int i = 0; i < N; i++) {
		depth[i] = hoursRequired(root, i);
		if (depth[i] == 1) {
			ch.push_back(i);
		}
	}
	bool merge = (int)(ch.size()) <= 2;
	ch.resize(3, -1);
	vector<pair<int, vector<pair<int, int>>>> sub(3);
	for (int i = 0; i < 3; i++) {
		sub[i].first = i;
	}
	for (int i = 0; i < N; i++) {
		if (i == root) {
			continue;
		}
		int id = 2;
		for (int j = 0; j < 2; j++) {
			if (hoursRequired(ch[j], i) + 1 == depth[i]) {
				id = j;
				break;
			}
		}
		sub[id].second.push_back({depth[i], i});
	}
	for (int i = 0; i < 3; i++) {
		sort(sub[i].second.begin(), sub[i].second.end());
	}
	int prv = -1;
	vector<int> res;
	vector<int> depths;
	for (int i = 0; i < N - 1; i++) {
		if (sub[0].second.size() > sub[1].second.size()) {
			swap(sub[0], sub[1]);
		}
		if (sub[1].second.size() > sub[2].second.size()) {
			swap(sub[1], sub[2]);
		}
		if (sub[0].second.size() > sub[2].second.size()) {
			swap(sub[0], sub[2]);
		}
		pair<pair<int, int>, int> best = {{-1, -1}, -1};
		if (!merge && sub[0].second.size() + sub[1].second.size() <= sub[2].second.size()) {
			int prv_depth = (depths.empty() ? N + 1 : depths.back());
			if (prv == sub[0].first) {
				if (prv_depth < sub[1].second.back().first) {
					best = {sub[1].second.back(), 1};
				}
				prv = 0;
			}
			else if (prv == sub[1].first) {
				if (prv_depth < sub[0].second.back().first) {
					best = {sub[0].second.back(), 0};
				}
				prv = 0;
			}
			else {
				prv = 1;
			}
			sub[0].first = 0;
			sub[1].first = 0;
			sub[2].first = 1;
			merge = true;
		}
		for (int k = 0; k < 2; k++) {
			if (best.second != -1) {
				break;
			}
			for (int j = 0; j < 3; j++) {
				if (k == 0 && prv == sub[j].first) {
					continue;
				}
				if (!sub[j].second.empty()) {
					best = max(best, make_pair(sub[j].second.back(), j));
				}
			}
		}
		depths.push_back(sub[best.second].second.back().first);
		res.push_back(sub[best.second].second.back().second);
		sub[best.second].second.pop_back();
		prv = sub[best.second].first;
	}
	res.push_back(root);
	return res;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	308 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	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	308 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	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	300 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	300 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	296 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 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	1 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	212 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	1 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	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	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	300 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	109 ms	17232 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	2 ms	552 KB	Output is correct
21	Correct	3 ms	724 KB	Output is correct
22	Correct	5 ms	1348 KB	Output is correct
23	Correct	10 ms	2388 KB	Output is correct
24	Correct	13 ms	3064 KB	Output is correct
25	Correct	63 ms	9912 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	296 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	428 KB	Output is correct
14	Correct	8 ms	1840 KB	Output is correct
15	Correct	115 ms	17020 KB	Output is correct
16	Correct	127 ms	17048 KB	Output is correct
17	Correct	22 ms	4172 KB	Output is correct
18	Correct	56 ms	7996 KB	Output is correct
19	Correct	98 ms	13528 KB	Output is correct
20	Correct	4 ms	828 KB	Output is correct

Subtask #5
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	308 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	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	300 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	300 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	296 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 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	1 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	212 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	304 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	109 ms	17232 KB	Output is correct
45	Correct	1 ms	304 KB	Output is correct
46	Correct	2 ms	552 KB	Output is correct
47	Correct	3 ms	724 KB	Output is correct
48	Correct	5 ms	1348 KB	Output is correct
49	Correct	10 ms	2388 KB	Output is correct
50	Correct	13 ms	3064 KB	Output is correct
51	Correct	63 ms	9912 KB	Output is correct
52	Correct	1 ms	428 KB	Output is correct
53	Correct	8 ms	1840 KB	Output is correct
54	Correct	115 ms	17020 KB	Output is correct
55	Correct	127 ms	17048 KB	Output is correct
56	Correct	22 ms	4172 KB	Output is correct
57	Correct	56 ms	7996 KB	Output is correct
58	Correct	98 ms	13528 KB	Output is correct
59	Correct	4 ms	828 KB	Output is correct
60	Correct	153 ms	17220 KB	Output is correct
61	Correct	220 ms	19644 KB	Output is correct
62	Correct	184 ms	16944 KB	Output is correct
63	Correct	174 ms	21140 KB	Output is correct
64	Correct	186 ms	20720 KB	Output is correct
65	Correct	185 ms	17108 KB	Output is correct
66	Correct	180 ms	19516 KB	Output is correct
67	Correct	159 ms	20624 KB	Output is correct
68	Correct	235 ms	20292 KB	Output is correct
69	Correct	203 ms	21360 KB	Output is correct
70	Correct	153 ms	17332 KB	Output is correct
71	Correct	164 ms	21292 KB	Output is correct
72	Correct	208 ms	19472 KB	Output is correct
73	Correct	238 ms	19956 KB	Output is correct
74	Correct	265 ms	21572 KB	Output is correct
75	Correct	163 ms	17348 KB	Output is correct
76	Correct	176 ms	20852 KB	Output is correct
77	Correct	212 ms	21232 KB	Output is correct
78	Correct	206 ms	20624 KB	Output is correct
79	Correct	228 ms	21856 KB	Output is correct
80	Correct	292 ms	21672 KB	Output is correct
81	Correct	175 ms	17072 KB	Output is correct
82	Correct	162 ms	17412 KB	Output is correct
83	Correct	190 ms	16976 KB	Output is correct
84	Correct	61 ms	7220 KB	Output is correct

Submission #726857

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 34.0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
34.0 / 34.0