oj.uz

Submission #256724

# Submission time Handle Problem Language Result Execution time Memory
256724 2020-08-03T07:20:06 Z atoiz Split the Attractions (IOI19_split) C++14
100 / 100
 241 ms 21376 KB 
#include "split.h"
#include <functional>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <deque>

using namespace std;

vector<int> find_split(int n, int oA, int oB, int oC, vector<int> p, vector<int> q) {
	int m = (int) p.size();
	vector<vector<int>> adj(n);
	for (int i = 0; i < m; ++i) {
		adj[p[i]].push_back(i);
		adj[q[i]].push_back(i);
	}

	vector<int> inTree(m, 0), vis(n, 0), par(n, -1), sz(n, 0);
	function<int(int)> findCentroid = [&](int u) -> int {
		vis[u] = true, sz[u] = 1;
		int cen = -1;
		for (int i : adj[u]) {
			int v = u ^ p[i] ^ q[i];
			if (vis[v]) continue;
			inTree[i] = true;
			int can = findCentroid(v);
			if (cen == -1) cen = can;
			sz[u] += sz[v];
		}
		if (cen == -1 && 2 * sz[u] >= n) cen = u;
		return cen;
	};
	int root = findCentroid(0);

	array<int, 3> arr = {oA, oB, oC};
	int a = *min_element(arr.begin(), arr.end()), c = *max_element(arr.begin(), arr.end()), b = n - a - c;

	vector<int> ans(n, 0);
	fill(vis.begin(), vis.end(), 0);
	vector<int> done(n, 0);
	done[root] = 1;
	for (int ir : adj[root]) if (inTree[ir]) {
		int u = root ^ p[ir] ^ q[ir];
		if (done[u]) continue;

		vector<int> vec;
		deque<int> dq = {u};
		while (!dq.empty()) {
			int v = dq.front();
			dq.pop_front();

			if (done[v]) continue;
			done[v] = true;
			vec.push_back(v);

			for (int i : adj[v]) {
				int w = v ^ p[i] ^ q[i];
				if (done[w]) continue;
				if (inTree[i]) {
					if (vis[w] < 2) {
						dq.push_front(w);
						vis[w] = 2;
					}
				} else {
					if (vis[w] < 1) {
						dq.push_back(w);
						vis[w] = 1;
					}
				}
			}
		}

		if ((int) vec.size() >= a) {
			vec.resize(a);
			for (auto v : vec) ans[v] = 1;
			break;
		}
	}

	if (count(ans.begin(), ans.end(), 1) != a) return ans;

	vis = ans;
	vector<int> vec = {root};
	vis[root] = true;
	for (int iv = 0; iv < (int) vec.size(); ++iv) {
		int u = vec[iv];
		for (int i : adj[u]) {
			int v = u ^ p[i] ^ q[i];
			if (vis[v]) continue;
			vis[v] = true;
			vec.push_back(v);
		}
	}
	assert((int) vec.size() >= b);
	vec.resize(b);
	for (int v : vec) ans[v] = 2;

	array<int, 3> idx = {0, 1, 2};
	sort(idx.begin(), idx.end(), [&](int i, int j) { return arr[i] < arr[j]; });
	for (int &x : ans) {
		if (x == 0) x = idx[2] + 1;
		else if (x == 1) x = idx[0] + 1;
		else x = idx[1] + 1;
	}

	return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, correct split
3 Correct 0 ms 256 KB ok, correct split
4 Correct 0 ms 256 KB ok, correct split
5 Correct 1 ms 256 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 110 ms 19120 KB ok, correct split
8 Correct 108 ms 16436 KB ok, correct split
9 Correct 114 ms 15536 KB ok, correct split
10 Correct 128 ms 20068 KB ok, correct split
11 Correct 124 ms 19940 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 1 ms 256 KB ok, correct split
3 Correct 1 ms 256 KB ok, correct split
4 Correct 149 ms 16268 KB ok, correct split
5 Correct 87 ms 10492 KB ok, correct split
6 Correct 145 ms 20048 KB ok, correct split
7 Correct 137 ms 16176 KB ok, correct split
8 Correct 198 ms 13368 KB ok, correct split
9 Correct 136 ms 10472 KB ok, correct split
10 Correct 70 ms 10820 KB ok, correct split
11 Correct 59 ms 10864 KB ok, correct split
12 Correct 59 ms 10864 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 96 ms 10528 KB ok, correct split
3 Correct 29 ms 4608 KB ok, correct split
4 Correct 0 ms 256 KB ok, correct split
5 Correct 104 ms 13484 KB ok, correct split
6 Correct 109 ms 13228 KB ok, correct split
7 Correct 143 ms 12960 KB ok, correct split
8 Correct 114 ms 14536 KB ok, correct split
9 Correct 118 ms 12744 KB ok, correct split
10 Correct 24 ms 3456 KB ok, no valid answer
11 Correct 37 ms 5112 KB ok, no valid answer
12 Correct 84 ms 9972 KB ok, no valid answer
13 Correct 91 ms 9976 KB ok, no valid answer
14 Correct 75 ms 10096 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, no valid answer
3 Correct 0 ms 256 KB ok, correct split
4 Correct 0 ms 256 KB ok, correct split
5 Correct 1 ms 256 KB ok, correct split
6 Correct 0 ms 256 KB ok, correct split
7 Correct 0 ms 256 KB ok, correct split
8 Correct 1 ms 256 KB ok, correct split
9 Correct 3 ms 640 KB ok, correct split
10 Correct 3 ms 640 KB ok, correct split
11 Correct 1 ms 384 KB ok, correct split
12 Correct 3 ms 640 KB ok, correct split
13 Correct 0 ms 256 KB ok, correct split
14 Correct 0 ms 256 KB ok, correct split
15 Correct 1 ms 256 KB ok, correct split
16 Correct 0 ms 256 KB ok, correct split
17 Correct 1 ms 256 KB ok, correct split
18 Correct 1 ms 256 KB ok, correct split
19 Correct 1 ms 384 KB ok, correct split
20 Correct 1 ms 512 KB ok, correct split
21 Correct 2 ms 640 KB ok, correct split
22 Correct 2 ms 640 KB ok, correct split
23 Correct 2 ms 768 KB ok, correct split
24 Correct 2 ms 640 KB ok, correct split
25 Correct 2 ms 640 KB ok, correct split
26 Correct 3 ms 768 KB ok, correct split
27 Correct 2 ms 768 KB ok, correct split
28 Correct 3 ms 640 KB ok, correct split
29 Correct 1 ms 384 KB ok, correct split
30 Correct 3 ms 640 KB ok, correct split
31 Correct 1 ms 384 KB ok, correct split
32 Correct 1 ms 384 KB ok, correct split
33 Correct 1 ms 384 KB ok, correct split
34 Correct 4 ms 640 KB ok, correct split
35 Correct 3 ms 640 KB ok, correct split
36 Correct 3 ms 640 KB ok, correct split
37 Correct 3 ms 768 KB ok, correct split
38 Correct 3 ms 768 KB ok, correct split
39 Correct 3 ms 768 KB ok, correct split
40 Correct 3 ms 768 KB ok, correct split
41 Correct 3 ms 512 KB ok, correct split
42 Correct 2 ms 512 KB ok, correct split
43 Correct 5 ms 768 KB ok, correct split
44 Correct 5 ms 768 KB ok, correct split
45 Correct 5 ms 768 KB ok, correct split
46 Correct 2 ms 640 KB ok, correct split
47 Correct 2 ms 640 KB ok, no valid answer
48 Correct 2 ms 640 KB ok, correct split
49 Correct 3 ms 768 KB ok, correct split
50 Correct 1 ms 256 KB ok, no valid answer
51 Correct 1 ms 256 KB ok, no valid answer
52 Correct 2 ms 640 KB ok, no valid answer
53 Correct 5 ms 640 KB ok, no valid answer
54 Correct 2 ms 640 KB ok, no valid answer
55 Correct 3 ms 640 KB ok, no valid answer
56 Correct 2 ms 640 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, correct split
3 Correct 0 ms 256 KB ok, correct split
4 Correct 0 ms 256 KB ok, correct split
5 Correct 1 ms 256 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 110 ms 19120 KB ok, correct split
8 Correct 108 ms 16436 KB ok, correct split
9 Correct 114 ms 15536 KB ok, correct split
10 Correct 128 ms 20068 KB ok, correct split
11 Correct 124 ms 19940 KB ok, correct split
12 Correct 0 ms 256 KB ok, correct split
13 Correct 1 ms 256 KB ok, correct split
14 Correct 1 ms 256 KB ok, correct split
15 Correct 149 ms 16268 KB ok, correct split
16 Correct 87 ms 10492 KB ok, correct split
17 Correct 145 ms 20048 KB ok, correct split
18 Correct 137 ms 16176 KB ok, correct split
19 Correct 198 ms 13368 KB ok, correct split
20 Correct 136 ms 10472 KB ok, correct split
21 Correct 70 ms 10820 KB ok, correct split
22 Correct 59 ms 10864 KB ok, correct split
23 Correct 59 ms 10864 KB ok, correct split
24 Correct 0 ms 256 KB ok, correct split
25 Correct 96 ms 10528 KB ok, correct split
26 Correct 29 ms 4608 KB ok, correct split
27 Correct 0 ms 256 KB ok, correct split
28 Correct 104 ms 13484 KB ok, correct split
29 Correct 109 ms 13228 KB ok, correct split
30 Correct 143 ms 12960 KB ok, correct split
31 Correct 114 ms 14536 KB ok, correct split
32 Correct 118 ms 12744 KB ok, correct split
33 Correct 24 ms 3456 KB ok, no valid answer
34 Correct 37 ms 5112 KB ok, no valid answer
35 Correct 84 ms 9972 KB ok, no valid answer
36 Correct 91 ms 9976 KB ok, no valid answer
37 Correct 75 ms 10096 KB ok, no valid answer
38 Correct 0 ms 256 KB ok, correct split
39 Correct 0 ms 256 KB ok, no valid answer
40 Correct 0 ms 256 KB ok, correct split
41 Correct 0 ms 256 KB ok, correct split
42 Correct 1 ms 256 KB ok, correct split
43 Correct 0 ms 256 KB ok, correct split
44 Correct 0 ms 256 KB ok, correct split
45 Correct 1 ms 256 KB ok, correct split
46 Correct 3 ms 640 KB ok, correct split
47 Correct 3 ms 640 KB ok, correct split
48 Correct 1 ms 384 KB ok, correct split
49 Correct 3 ms 640 KB ok, correct split
50 Correct 0 ms 256 KB ok, correct split
51 Correct 0 ms 256 KB ok, correct split
52 Correct 1 ms 256 KB ok, correct split
53 Correct 0 ms 256 KB ok, correct split
54 Correct 1 ms 256 KB ok, correct split
55 Correct 1 ms 256 KB ok, correct split
56 Correct 1 ms 384 KB ok, correct split
57 Correct 1 ms 512 KB ok, correct split
58 Correct 2 ms 640 KB ok, correct split
59 Correct 2 ms 640 KB ok, correct split
60 Correct 2 ms 768 KB ok, correct split
61 Correct 2 ms 640 KB ok, correct split
62 Correct 2 ms 640 KB ok, correct split
63 Correct 3 ms 768 KB ok, correct split
64 Correct 2 ms 768 KB ok, correct split
65 Correct 3 ms 640 KB ok, correct split
66 Correct 1 ms 384 KB ok, correct split
67 Correct 3 ms 640 KB ok, correct split
68 Correct 1 ms 384 KB ok, correct split
69 Correct 1 ms 384 KB ok, correct split
70 Correct 1 ms 384 KB ok, correct split
71 Correct 4 ms 640 KB ok, correct split
72 Correct 3 ms 640 KB ok, correct split
73 Correct 3 ms 640 KB ok, correct split
74 Correct 3 ms 768 KB ok, correct split
75 Correct 3 ms 768 KB ok, correct split
76 Correct 3 ms 768 KB ok, correct split
77 Correct 3 ms 768 KB ok, correct split
78 Correct 3 ms 512 KB ok, correct split
79 Correct 2 ms 512 KB ok, correct split
80 Correct 5 ms 768 KB ok, correct split
81 Correct 5 ms 768 KB ok, correct split
82 Correct 5 ms 768 KB ok, correct split
83 Correct 2 ms 640 KB ok, correct split
84 Correct 2 ms 640 KB ok, no valid answer
85 Correct 2 ms 640 KB ok, correct split
86 Correct 3 ms 768 KB ok, correct split
87 Correct 1 ms 256 KB ok, no valid answer
88 Correct 1 ms 256 KB ok, no valid answer
89 Correct 2 ms 640 KB ok, no valid answer
90 Correct 5 ms 640 KB ok, no valid answer
91 Correct 2 ms 640 KB ok, no valid answer
92 Correct 3 ms 640 KB ok, no valid answer
93 Correct 2 ms 640 KB ok, no valid answer
94 Correct 166 ms 15160 KB ok, correct split
95 Correct 241 ms 21376 KB ok, correct split
96 Correct 185 ms 19316 KB ok, correct split
97 Correct 29 ms 4992 KB ok, correct split
98 Correct 32 ms 5112 KB ok, correct split
99 Correct 55 ms 7796 KB ok, correct split
100 Correct 160 ms 15988 KB ok, correct split
101 Correct 163 ms 14708 KB ok, correct split
102 Correct 147 ms 14192 KB ok, correct split
103 Correct 131 ms 13936 KB ok, correct split
104 Correct 122 ms 15568 KB ok, correct split
105 Correct 58 ms 7432 KB ok, correct split
106 Correct 149 ms 15848 KB ok, correct split
107 Correct 121 ms 11760 KB ok, correct split
108 Correct 99 ms 11756 KB ok, correct split
109 Correct 167 ms 15416 KB ok, correct split
110 Correct 174 ms 15636 KB ok, correct split
111 Correct 164 ms 15728 KB ok, correct split
112 Correct 150 ms 15856 KB ok, correct split
113 Correct 151 ms 15856 KB ok, correct split
114 Correct 19 ms 2304 KB ok, correct split
115 Correct 13 ms 2048 KB ok, correct split
116 Correct 208 ms 15600 KB ok, correct split
117 Correct 198 ms 15472 KB ok, correct split
118 Correct 135 ms 11448 KB ok, correct split
119 Correct 98 ms 11768 KB ok, correct split
120 Correct 104 ms 16624 KB ok, correct split
121 Correct 92 ms 11000 KB ok, no valid answer
122 Correct 118 ms 11348 KB ok, no valid answer
123 Correct 165 ms 15736 KB ok, no valid answer
124 Correct 206 ms 15480 KB ok, no valid answer
125 Correct 131 ms 12272 KB ok, no valid answer
126 Correct 69 ms 10352 KB ok, no valid answer
127 Correct 158 ms 12784 KB ok, no valid answer