oj.uz

Submission #726851

# Submission time Handle Problem Language Result Execution time Memory
726851 2023-04-19T12:43:30 Z SanguineChameleon Fun Tour (APIO20_fun) C++17
100 / 100
 253 ms 22184 KB 
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;

pair<int, vector<int>> solve(int N, vector<pair<int, vector<pair<int, int>>>> sub, int root, bool merge_later) {
	int prv = -1;
	vector<int> res;
	int merge_time = -1;
	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};
		bool will_merge = false;
		if (merge_time == -1 && sub[0].second.size() + sub[1].second.size() <= sub[2].second.size()) {
			will_merge = true;
			merge_time = i;
		}
		if (will_merge && !merge_later) {
			if (prv == sub[0].first || prv == sub[1].first) {
				prv = 0;
			}
			else if (prv == sub[1].first) {
				prv = 0;
			}
			else {
				prv = 1;
			}
			sub[0].first = 0;
			sub[1].first = 0;
			sub[2].first = 1;
		}
		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));
				}
			}
		}
		res.push_back(sub[best.second].second.back().second);
		sub[best.second].second.pop_back();
		prv = sub[best.second].first;
		if (will_merge && merge_later) {
			if (prv == sub[0].first || prv == sub[1].first) {
				prv = 0;
			}
			else if (prv == sub[1].first) {
				prv = 0;
			}
			else {
				prv = 1;
			}
			sub[0].first = 0;
			sub[1].first = 0;
			sub[2].first = 1;
		}
	}
	res.push_back(root);
	return {merge_time, res};
}

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());
	}
	auto p = solve(N, sub, root, false);
	int pos = p.first;
	vector<int> res = p.second;
	if (pos == -1) {
		return res;
	}
	int prv = N + 1;
	for (int i = max(0, pos - 5); i < min(N - 1, pos + 5); i++) {
		int cur = hoursRequired(res[i], res[i + 1]);
		if (prv < cur) {
			return solve(N, sub, root, true).second;
		}
		prv = cur;
	}
	return res;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:91:7: warning: unused variable 'merge' [-Wunused-variable]
   91 |  bool merge = (int)(ch.size()) <= 2;
      |       ^~~~~

Subtask #1
10.0 / 10.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 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 212 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 0 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 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 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 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 212 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 0 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 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 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 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 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 212 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 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 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 0 ms 212 KB Output is correct
9 Correct 0 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 340 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 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 110 ms 16212 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 1236 KB Output is correct
23 Correct 10 ms 2260 KB Output is correct
24 Correct 13 ms 3028 KB Output is correct
25 Correct 56 ms 9384 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 0 ms 212 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 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 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 9 ms 1696 KB Output is correct
15 Correct 122 ms 16172 KB Output is correct
16 Correct 124 ms 17092 KB Output is correct
17 Correct 23 ms 4084 KB Output is correct
18 Correct 54 ms 7448 KB Output is correct
19 Correct 89 ms 12680 KB Output is correct
20 Correct 4 ms 868 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 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 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 212 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 0 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 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 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 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 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 212 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 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 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 110 ms 16212 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 1236 KB Output is correct
49 Correct 10 ms 2260 KB Output is correct
50 Correct 13 ms 3028 KB Output is correct
51 Correct 56 ms 9384 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 9 ms 1696 KB Output is correct
54 Correct 122 ms 16172 KB Output is correct
55 Correct 124 ms 17092 KB Output is correct
56 Correct 23 ms 4084 KB Output is correct
57 Correct 54 ms 7448 KB Output is correct
58 Correct 89 ms 12680 KB Output is correct
59 Correct 4 ms 868 KB Output is correct
60 Correct 163 ms 16168 KB Output is correct
61 Correct 193 ms 18572 KB Output is correct
62 Correct 175 ms 16196 KB Output is correct
63 Correct 170 ms 20104 KB Output is correct
64 Correct 197 ms 19964 KB Output is correct
65 Correct 173 ms 16144 KB Output is correct
66 Correct 198 ms 18452 KB Output is correct
67 Correct 188 ms 19920 KB Output is correct
68 Correct 202 ms 19548 KB Output is correct
69 Correct 210 ms 20660 KB Output is correct
70 Correct 163 ms 16184 KB Output is correct
71 Correct 174 ms 20292 KB Output is correct
72 Correct 234 ms 18812 KB Output is correct
73 Correct 195 ms 19236 KB Output is correct
74 Correct 238 ms 21136 KB Output is correct
75 Correct 209 ms 16280 KB Output is correct
76 Correct 191 ms 20168 KB Output is correct
77 Correct 222 ms 20248 KB Output is correct
78 Correct 201 ms 20440 KB Output is correct
79 Correct 190 ms 21956 KB Output is correct
80 Correct 253 ms 22184 KB Output is correct
81 Correct 180 ms 17360 KB Output is correct
82 Correct 162 ms 17268 KB Output is correct
83 Correct 224 ms 17272 KB Output is correct
84 Correct 79 ms 7336 KB Output is correct