oj.uz

Submission #258625

# Submission time Handle Problem Language Result Execution time Memory
258625 2020-08-06T09:24:32 Z Nightlight Split the Attractions (IOI19_split) C++14
100 / 100
 153 ms 20204 KB 
#include "split.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
#define pib pair<int, bool>
#define mp make_pair
using namespace std;
 
vector<int> adj[200005];
vector<int> ans;
int N, rt, M;
pii id[5];
int cnt[5];
int sz[100005], par[100005];
int ch;
int col[100005], vis[100005];
int parent[100005];
bool found;
 
void DFS(int u) {
	sz[u] = 1;
	vis[u] = 1;
	for(int v : adj[u]) {
		if(vis[v]) continue;
		DFS(v);
		sz[u] += sz[v];
    parent[v] = u;

	}
}
 
void cent() {
	DFS(0);
	int u = 0, now = N / 2, nxt;
	bool ok = 0;
	while(!ok) {
		ok = 1, nxt = u;
		for(int v : adj[u]) {
			if(sz[v] > now && sz[v] < sz[u]) {
				nxt = v, ok = 0;
				break;
			}
		}
		u = nxt;
	}
	rt = u;
}
 
int findpar(int u) {
	return par[u] == u ? u : par[u] = findpar(par[u]);
}
 
void DFS1(int u) {
	if(id[1].first <= 0) return;
	vis[u] = 2;
	id[1].first--;
	ans[u] = id[1].second;
	for(int v : adj[u]) {
		if(vis[v] == 2 || col[v] == 0) continue;
		DFS1(v);
	}
}
 
void DFS2(int u) {
	if(id[2].first <= 0) return;
	vis[u] = 2;
	id[2].first--;
	ans[u] = id[2].second;
	for(int v : adj[u]) {
		if(vis[v] == 2) continue;
		DFS2(v);
	}
}
 
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	N = n, id[1] = {a, 1}, id[2] = {b, 2}, id[3] = {c, 3}, M = p.size();
	sort(id + 1, id + 4);
	ans.resize(N, 0);
	for(int i = 0; i < M; i++) {
		adj[p[i]].emplace_back(q[i]);
		adj[q[i]].emplace_back(p[i]);
	}
	cent();
	for(int i = 0; i < N; i++) par[i] = i, sz[i] = 1;
	int u, v;
	bool ok = 0;
//	cout << rt << "\n";
	for(int i = 0; i < M; i++) {
		if(p[i] == rt || q[i] == rt) continue;
    if(!(parent[p[i]] == q[i] || parent[q[i]] == p[i])) continue;
		u = findpar(p[i]), v = findpar(q[i]);
		if(sz[u] < sz[v]) swap(u, v);
		if(u == v) continue;
		par[v] = u;
		sz[u] += sz[v];
	}
	for(int i = 0; i < M; i++) {
		if(p[i] == rt || q[i] == rt) continue;
		u = findpar(p[i]), v = findpar(q[i]);
		if(sz[u] < sz[v]) swap(u, v);
		if(sz[u] >= id[1].first) continue;
		if(u == v) continue;
		par[v] = u;
		sz[u] += sz[v];
	}
	for(int i = 0; i < N; i++) {
		if(i == rt) continue;
		u = findpar(i);
		if(sz[u] >= id[1].first) {
//			cout << u << "\n";
			ok = 1;
			for(int j = 0; j < N; j++) {
				if(findpar(j) == u) col[j] = 1;
			}
			break;
		}
	}
	if(ok == 0) return ans;
//	cout << id[1].first << " " << id[2].first << "\n";
	DFS1(u);
	DFS2(rt);
	for(int i = 0; i < N; i++) if(ans[i] == 0) ans[i] = id[3].second;
	return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Correct 3 ms 4992 KB ok, correct split
5 Correct 3 ms 4992 KB ok, correct split
6 Correct 3 ms 4992 KB ok, correct split
7 Correct 104 ms 18040 KB ok, correct split
8 Correct 89 ms 16760 KB ok, correct split
9 Correct 96 ms 16248 KB ok, correct split
10 Correct 95 ms 18296 KB ok, correct split
11 Correct 111 ms 18296 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Correct 109 ms 17400 KB ok, correct split
5 Correct 87 ms 13688 KB ok, correct split
6 Correct 96 ms 18296 KB ok, correct split
7 Correct 97 ms 16636 KB ok, correct split
8 Correct 129 ms 16888 KB ok, correct split
9 Correct 87 ms 13688 KB ok, correct split
10 Correct 56 ms 13168 KB ok, correct split
11 Correct 57 ms 13168 KB ok, correct split
12 Correct 57 ms 13680 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB ok, correct split
2 Correct 82 ms 13560 KB ok, correct split
3 Correct 31 ms 8568 KB ok, correct split
4 Correct 3 ms 4992 KB ok, correct split
5 Correct 96 ms 15224 KB ok, correct split
6 Correct 118 ms 15096 KB ok, correct split
7 Correct 99 ms 14968 KB ok, correct split
8 Correct 152 ms 15740 KB ok, correct split
9 Correct 100 ms 14840 KB ok, correct split
10 Correct 28 ms 7808 KB ok, no valid answer
11 Correct 37 ms 9240 KB ok, no valid answer
12 Correct 65 ms 13556 KB ok, no valid answer
13 Correct 74 ms 13400 KB ok, no valid answer
14 Correct 57 ms 13680 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Correct 3 ms 4992 KB ok, correct split
5 Correct 3 ms 4992 KB ok, correct split
6 Correct 3 ms 4992 KB ok, correct split
7 Correct 104 ms 18040 KB ok, correct split
8 Correct 89 ms 16760 KB ok, correct split
9 Correct 96 ms 16248 KB ok, correct split
10 Correct 95 ms 18296 KB ok, correct split
11 Correct 111 ms 18296 KB ok, correct split
12 Correct 3 ms 4992 KB ok, correct split
13 Correct 3 ms 4992 KB ok, correct split
14 Correct 3 ms 4992 KB ok, correct split
15 Correct 109 ms 17400 KB ok, correct split
16 Correct 87 ms 13688 KB ok, correct split
17 Correct 96 ms 18296 KB ok, correct split
18 Correct 97 ms 16636 KB ok, correct split
19 Correct 129 ms 16888 KB ok, correct split
20 Correct 87 ms 13688 KB ok, correct split
21 Correct 56 ms 13168 KB ok, correct split
22 Correct 57 ms 13168 KB ok, correct split
23 Correct 57 ms 13680 KB ok, correct split
24 Correct 3 ms 4992 KB ok, correct split
25 Correct 82 ms 13560 KB ok, correct split
26 Correct 31 ms 8568 KB ok, correct split
27 Correct 3 ms 4992 KB ok, correct split
28 Correct 96 ms 15224 KB ok, correct split
29 Correct 118 ms 15096 KB ok, correct split
30 Correct 99 ms 14968 KB ok, correct split
31 Correct 152 ms 15740 KB ok, correct split
32 Correct 100 ms 14840 KB ok, correct split
33 Correct 28 ms 7808 KB ok, no valid answer
34 Correct 37 ms 9240 KB ok, no valid answer
35 Correct 65 ms 13556 KB ok, no valid answer
36 Correct 74 ms 13400 KB ok, no valid answer
37 Correct 57 ms 13680 KB ok, no valid answer
38 Correct 3 ms 4992 KB ok, correct split
39 Correct 3 ms 4992 KB ok, no valid answer
40 Correct 3 ms 4992 KB ok, correct split
41 Correct 3 ms 4992 KB ok, correct split
42 Correct 3 ms 4992 KB ok, correct split
43 Correct 3 ms 4992 KB ok, correct split
44 Correct 3 ms 4992 KB ok, correct split
45 Correct 3 ms 4992 KB ok, correct split
46 Correct 5 ms 5376 KB ok, correct split
47 Correct 5 ms 5248 KB ok, correct split
48 Correct 3 ms 5120 KB ok, correct split
49 Correct 5 ms 5376 KB ok, correct split
50 Correct 3 ms 4992 KB ok, correct split
51 Correct 3 ms 4992 KB ok, correct split
52 Correct 3 ms 4992 KB ok, correct split
53 Correct 3 ms 4992 KB ok, correct split
54 Correct 3 ms 4992 KB ok, correct split
55 Correct 3 ms 4992 KB ok, correct split
56 Correct 3 ms 5120 KB ok, correct split
57 Correct 4 ms 5120 KB ok, correct split
58 Correct 5 ms 5376 KB ok, correct split
59 Correct 5 ms 5248 KB ok, correct split
60 Correct 5 ms 5248 KB ok, correct split
61 Correct 5 ms 5248 KB ok, correct split
62 Correct 5 ms 5248 KB ok, correct split
63 Correct 5 ms 5376 KB ok, correct split
64 Correct 5 ms 5376 KB ok, correct split
65 Correct 5 ms 5376 KB ok, correct split
66 Correct 3 ms 5120 KB ok, correct split
67 Correct 5 ms 5376 KB ok, correct split
68 Correct 6 ms 5088 KB ok, correct split
69 Correct 5 ms 4992 KB ok, correct split
70 Correct 4 ms 5120 KB ok, correct split
71 Correct 5 ms 5248 KB ok, correct split
72 Correct 5 ms 5248 KB ok, correct split
73 Correct 5 ms 5248 KB ok, correct split
74 Correct 6 ms 5376 KB ok, correct split
75 Correct 5 ms 5376 KB ok, correct split
76 Correct 5 ms 5376 KB ok, correct split
77 Correct 5 ms 5376 KB ok, correct split
78 Correct 4 ms 5120 KB ok, correct split
79 Correct 5 ms 5120 KB ok, correct split
80 Correct 6 ms 5376 KB ok, correct split
81 Correct 5 ms 5376 KB ok, correct split
82 Correct 5 ms 5376 KB ok, correct split
83 Correct 5 ms 5248 KB ok, correct split
84 Correct 6 ms 5396 KB ok, no valid answer
85 Correct 4 ms 5248 KB ok, correct split
86 Correct 5 ms 5376 KB ok, correct split
87 Correct 3 ms 4992 KB ok, no valid answer
88 Correct 4 ms 4992 KB ok, no valid answer
89 Correct 5 ms 5248 KB ok, no valid answer
90 Correct 5 ms 5376 KB ok, no valid answer
91 Correct 4 ms 5248 KB ok, no valid answer
92 Correct 5 ms 5248 KB ok, no valid answer
93 Correct 5 ms 5248 KB ok, no valid answer
94 Correct 103 ms 15728 KB ok, correct split
95 Correct 153 ms 20204 KB ok, correct split
96 Correct 137 ms 18552 KB ok, correct split
97 Correct 31 ms 8576 KB ok, correct split
98 Correct 31 ms 8704 KB ok, correct split
99 Correct 53 ms 10872 KB ok, correct split
100 Correct 134 ms 17528 KB ok, correct split
101 Correct 117 ms 16376 KB ok, correct split
102 Correct 106 ms 15600 KB ok, correct split
103 Correct 111 ms 15344 KB ok, correct split
104 Correct 123 ms 17252 KB ok, correct split
105 Correct 47 ms 10488 KB ok, correct split
106 Correct 136 ms 17128 KB ok, correct split
107 Correct 81 ms 13816 KB ok, correct split
108 Correct 82 ms 13688 KB ok, correct split
109 Correct 135 ms 17016 KB ok, correct split
110 Correct 135 ms 16752 KB ok, correct split
111 Correct 135 ms 16752 KB ok, correct split
112 Correct 127 ms 17136 KB ok, correct split
113 Correct 124 ms 17140 KB ok, correct split
114 Correct 14 ms 6528 KB ok, correct split
115 Correct 13 ms 6272 KB ok, correct split
116 Correct 128 ms 16884 KB ok, correct split
117 Correct 124 ms 16624 KB ok, correct split
118 Correct 86 ms 13688 KB ok, correct split
119 Correct 84 ms 13688 KB ok, correct split
120 Correct 97 ms 16120 KB ok, correct split
121 Correct 76 ms 13432 KB ok, no valid answer
122 Correct 72 ms 13432 KB ok, no valid answer
123 Correct 126 ms 17272 KB ok, no valid answer
124 Correct 124 ms 17144 KB ok, no valid answer
125 Correct 77 ms 14448 KB ok, no valid answer
126 Correct 51 ms 12784 KB ok, no valid answer
127 Correct 92 ms 15104 KB ok, no valid answer