oj.uz

Submission #830075

# Submission time Handle Problem Language Result Execution time Memory
830075 2023-08-18T18:24:43 Z PurpleCrayon Split the Attractions (IOI19_split) C++17
100 / 100
 138 ms 33812 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 2e5+10, MOD = 1e9+7;

struct DSU {
	vector<int> par, sz;
	DSU() {}
	DSU(int n): par(n) {
		iota(par.begin(), par.end(), 0);
		sz.assign(n, 1);
	}
 
	int find_set(int v) {
		return v == par[v] ? v : par[v] = find_set(par[v]);
	}
 
	bool union_sets(int a, int b) {
		if ((a = find_set(a)) == (b = find_set(b))) return false;
		if (sz[a] < sz[b]) swap(a, b);
		par[b] = a, sz[a] += sz[b], sz[b] = 0;
		return true;
	}
} d;
 

int n, m, sub[N], who[N];
vector<int> adj[N];
vector<int> tree[N], extra[N];
bool vis[N];

void dfs_tree(int c) {
	vis[c] = 1;
	for (int nxt : adj[c]) if (!vis[nxt]) {
		tree[c].push_back(nxt);
		tree[nxt].push_back(c);
		dfs_tree(nxt);
	}
}

int dfs_sub(int c, int p) {
	sub[c] = 1;
	for (int nxt : tree[c]) if (nxt != p) {
		sub[c] += dfs_sub(nxt, c);
	}
	return sub[c];
}

int dfs_cent(int c, int p) {
	for (int nxt : tree[c]) if (nxt != p && sub[nxt] > n / 2)
		return dfs_cent(nxt, c);

	return c;
}

void dfs_who(int c, int p, int cur) {
	who[c] = cur;
	for (int nxt : tree[c]) if (nxt != p) {
		dfs_who(nxt, c, cur);
	}
}

bool marked[N];
void dfs_mark(int c, int p) {
	marked[c] = 1;
	for (int nxt : tree[c]) if (nxt != p) {
		dfs_mark(nxt, c);
	}
}

vector<int> collect;
int sum = 0;

void dfs_collect(int c) {
	vis[c] = 1;
	if (sum > 0) {
		sum -= sub[c];
		collect.push_back(c);
	}

	for (int nxt : extra[c]) if (!vis[nxt]) {
		dfs_collect(nxt);
	}
}

vector<int> ord;
bool only[N], has[N];

void dfs_ord(int c) {
	has[c] = 1;
	ord.push_back(c);
	for (int nxt : adj[c]) if (!has[nxt] && only[nxt]) {
		dfs_ord(nxt);
	}
}

vector<int> trim(vector<int> nodes, int cnt) {
	memset(only, 0, sizeof(only));
	memset(has, 0, sizeof(has));
	for (int x : nodes) only[x] = 1;

	ord.clear();
	dfs_ord(nodes[0]);

	ord.resize(cnt);
	return ord;
}

vector<int> get_from_mark(const vector<pair<int, int>>& cols) {
	vector<int> one, two;
	for (int i = 0; i < n; i++) {
		if (marked[i]) one.push_back(i);
		else two.push_back(i);
	}

	one = trim(one, cols[0].first);
	two = trim(two, cols[1].first);

	vector<int> ans(n, cols[2].second);
	for (int x : one) ans[x] = cols[0].second;
	for (int x : two) ans[x] = cols[1].second;
	return ans;
}

vector<int> find_split(int _n, int p1, int p2, int p3, vector<int> p, vector<int> q) {
	n = _n, m = sz(p);
	for (int i = 0; i < m; i++) {
		int x = p[i], y = q[i];
		adj[x].push_back(y), adj[y].push_back(x);
	}

	vector<pair<int, int>> cols(3);
	cols[0] = {p1, 1}, cols[1] = {p2, 2}, cols[2] = {p3, 3};
	sort(cols.begin(), cols.end());

	dfs_tree(0);
	dfs_sub(0, -1);

	int root = dfs_cent(0, -1);
	dfs_sub(root, -1);
	who[root] = -1;
	for (int nxt : tree[root]) {
		dfs_who(nxt, root, nxt);
	}

	for (int nxt : tree[root]) {
		if (sub[nxt] >= cols[0].first) {
			dfs_mark(nxt, root);
			return get_from_mark(cols);
		}
	}

	for (int i = 0; i < m; i++) {
		if (who[p[i]] != who[q[i]] && who[p[i]] >= 0 && who[q[i]] >= 0) {
			extra[who[p[i]]].push_back(who[q[i]]);
			extra[who[q[i]]].push_back(who[p[i]]);
		}
	}

	memset(vis, 0, sizeof(vis));
	for (int nxt : tree[root]) if (!vis[nxt]) {
		collect.clear();
		sum = cols[0].first;

		dfs_collect(nxt);
		if (sum > 0) continue;

		for (int v : collect) dfs_mark(v, root);
		return get_from_mark(cols);
	}

	return vector<int>(n, 0);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14804 KB ok, correct split
2 Correct 9 ms 14788 KB ok, correct split
3 Correct 7 ms 14788 KB ok, correct split
4 Correct 9 ms 14804 KB ok, correct split
5 Correct 9 ms 14804 KB ok, correct split
6 Correct 7 ms 14804 KB ok, correct split
7 Correct 78 ms 33240 KB ok, correct split
8 Correct 81 ms 30872 KB ok, correct split
9 Correct 110 ms 30264 KB ok, correct split
10 Correct 83 ms 33472 KB ok, correct split
11 Correct 120 ms 33588 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14780 KB ok, correct split
2 Correct 8 ms 14796 KB ok, correct split
3 Correct 8 ms 14804 KB ok, correct split
4 Correct 116 ms 30852 KB ok, correct split
5 Correct 90 ms 26368 KB ok, correct split
6 Correct 92 ms 33512 KB ok, correct split
7 Correct 96 ms 30708 KB ok, correct split
8 Correct 98 ms 29388 KB ok, correct split
9 Correct 82 ms 26180 KB ok, correct split
10 Correct 50 ms 26560 KB ok, correct split
11 Correct 55 ms 26564 KB ok, correct split
12 Correct 54 ms 26932 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14676 KB ok, correct split
2 Correct 107 ms 26500 KB ok, correct split
3 Correct 35 ms 19564 KB ok, correct split
4 Correct 9 ms 14804 KB ok, correct split
5 Correct 77 ms 28840 KB ok, correct split
6 Correct 71 ms 28688 KB ok, correct split
7 Correct 76 ms 28484 KB ok, correct split
8 Correct 73 ms 29776 KB ok, correct split
9 Correct 72 ms 28224 KB ok, correct split
10 Correct 25 ms 18000 KB ok, no valid answer
11 Correct 42 ms 19708 KB ok, no valid answer
12 Correct 57 ms 25268 KB ok, no valid answer
13 Correct 128 ms 25008 KB ok, no valid answer
14 Correct 68 ms 25496 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14776 KB ok, correct split
2 Correct 6 ms 14536 KB ok, no valid answer
3 Correct 9 ms 14716 KB ok, correct split
4 Correct 7 ms 14788 KB ok, correct split
5 Correct 9 ms 14784 KB ok, correct split
6 Correct 9 ms 14704 KB ok, correct split
7 Correct 8 ms 14804 KB ok, correct split
8 Correct 9 ms 14752 KB ok, correct split
9 Correct 8 ms 15060 KB ok, correct split
10 Correct 9 ms 15124 KB ok, correct split
11 Correct 9 ms 14752 KB ok, correct split
12 Correct 12 ms 15060 KB ok, correct split
13 Correct 7 ms 14796 KB ok, correct split
14 Correct 6 ms 14792 KB ok, correct split
15 Correct 9 ms 14756 KB ok, correct split
16 Correct 8 ms 14788 KB ok, correct split
17 Correct 6 ms 14788 KB ok, correct split
18 Correct 10 ms 14796 KB ok, correct split
19 Correct 9 ms 14824 KB ok, correct split
20 Correct 8 ms 14932 KB ok, correct split
21 Correct 11 ms 15060 KB ok, correct split
22 Correct 8 ms 15060 KB ok, correct split
23 Correct 9 ms 15060 KB ok, correct split
24 Correct 10 ms 15060 KB ok, correct split
25 Correct 10 ms 15140 KB ok, correct split
26 Correct 11 ms 15352 KB ok, correct split
27 Correct 9 ms 15444 KB ok, correct split
28 Correct 9 ms 15316 KB ok, correct split
29 Correct 10 ms 15032 KB ok, correct split
30 Correct 9 ms 15104 KB ok, correct split
31 Correct 7 ms 14804 KB ok, correct split
32 Correct 7 ms 14804 KB ok, correct split
33 Correct 7 ms 14792 KB ok, correct split
34 Correct 8 ms 15204 KB ok, correct split
35 Correct 9 ms 15228 KB ok, correct split
36 Correct 9 ms 15168 KB ok, correct split
37 Correct 9 ms 15316 KB ok, correct split
38 Correct 9 ms 15316 KB ok, correct split
39 Correct 8 ms 15368 KB ok, correct split
40 Correct 8 ms 15152 KB ok, correct split
41 Correct 7 ms 14932 KB ok, correct split
42 Correct 10 ms 14932 KB ok, correct split
43 Correct 9 ms 15316 KB ok, correct split
44 Correct 12 ms 15060 KB ok, correct split
45 Correct 9 ms 15316 KB ok, correct split
46 Correct 10 ms 15060 KB ok, correct split
47 Correct 7 ms 14804 KB ok, no valid answer
48 Correct 7 ms 15060 KB ok, correct split
49 Correct 7 ms 15084 KB ok, correct split
50 Correct 10 ms 14548 KB ok, no valid answer
51 Correct 7 ms 14504 KB ok, no valid answer
52 Correct 11 ms 14808 KB ok, no valid answer
53 Correct 9 ms 14932 KB ok, no valid answer
54 Correct 10 ms 14804 KB ok, no valid answer
55 Correct 8 ms 14804 KB ok, no valid answer
56 Correct 8 ms 14844 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14804 KB ok, correct split
2 Correct 9 ms 14788 KB ok, correct split
3 Correct 7 ms 14788 KB ok, correct split
4 Correct 9 ms 14804 KB ok, correct split
5 Correct 9 ms 14804 KB ok, correct split
6 Correct 7 ms 14804 KB ok, correct split
7 Correct 78 ms 33240 KB ok, correct split
8 Correct 81 ms 30872 KB ok, correct split
9 Correct 110 ms 30264 KB ok, correct split
10 Correct 83 ms 33472 KB ok, correct split
11 Correct 120 ms 33588 KB ok, correct split
12 Correct 6 ms 14780 KB ok, correct split
13 Correct 8 ms 14796 KB ok, correct split
14 Correct 8 ms 14804 KB ok, correct split
15 Correct 116 ms 30852 KB ok, correct split
16 Correct 90 ms 26368 KB ok, correct split
17 Correct 92 ms 33512 KB ok, correct split
18 Correct 96 ms 30708 KB ok, correct split
19 Correct 98 ms 29388 KB ok, correct split
20 Correct 82 ms 26180 KB ok, correct split
21 Correct 50 ms 26560 KB ok, correct split
22 Correct 55 ms 26564 KB ok, correct split
23 Correct 54 ms 26932 KB ok, correct split
24 Correct 8 ms 14676 KB ok, correct split
25 Correct 107 ms 26500 KB ok, correct split
26 Correct 35 ms 19564 KB ok, correct split
27 Correct 9 ms 14804 KB ok, correct split
28 Correct 77 ms 28840 KB ok, correct split
29 Correct 71 ms 28688 KB ok, correct split
30 Correct 76 ms 28484 KB ok, correct split
31 Correct 73 ms 29776 KB ok, correct split
32 Correct 72 ms 28224 KB ok, correct split
33 Correct 25 ms 18000 KB ok, no valid answer
34 Correct 42 ms 19708 KB ok, no valid answer
35 Correct 57 ms 25268 KB ok, no valid answer
36 Correct 128 ms 25008 KB ok, no valid answer
37 Correct 68 ms 25496 KB ok, no valid answer
38 Correct 8 ms 14776 KB ok, correct split
39 Correct 6 ms 14536 KB ok, no valid answer
40 Correct 9 ms 14716 KB ok, correct split
41 Correct 7 ms 14788 KB ok, correct split
42 Correct 9 ms 14784 KB ok, correct split
43 Correct 9 ms 14704 KB ok, correct split
44 Correct 8 ms 14804 KB ok, correct split
45 Correct 9 ms 14752 KB ok, correct split
46 Correct 8 ms 15060 KB ok, correct split
47 Correct 9 ms 15124 KB ok, correct split
48 Correct 9 ms 14752 KB ok, correct split
49 Correct 12 ms 15060 KB ok, correct split
50 Correct 7 ms 14796 KB ok, correct split
51 Correct 6 ms 14792 KB ok, correct split
52 Correct 9 ms 14756 KB ok, correct split
53 Correct 8 ms 14788 KB ok, correct split
54 Correct 6 ms 14788 KB ok, correct split
55 Correct 10 ms 14796 KB ok, correct split
56 Correct 9 ms 14824 KB ok, correct split
57 Correct 8 ms 14932 KB ok, correct split
58 Correct 11 ms 15060 KB ok, correct split
59 Correct 8 ms 15060 KB ok, correct split
60 Correct 9 ms 15060 KB ok, correct split
61 Correct 10 ms 15060 KB ok, correct split
62 Correct 10 ms 15140 KB ok, correct split
63 Correct 11 ms 15352 KB ok, correct split
64 Correct 9 ms 15444 KB ok, correct split
65 Correct 9 ms 15316 KB ok, correct split
66 Correct 10 ms 15032 KB ok, correct split
67 Correct 9 ms 15104 KB ok, correct split
68 Correct 7 ms 14804 KB ok, correct split
69 Correct 7 ms 14804 KB ok, correct split
70 Correct 7 ms 14792 KB ok, correct split
71 Correct 8 ms 15204 KB ok, correct split
72 Correct 9 ms 15228 KB ok, correct split
73 Correct 9 ms 15168 KB ok, correct split
74 Correct 9 ms 15316 KB ok, correct split
75 Correct 9 ms 15316 KB ok, correct split
76 Correct 8 ms 15368 KB ok, correct split
77 Correct 8 ms 15152 KB ok, correct split
78 Correct 7 ms 14932 KB ok, correct split
79 Correct 10 ms 14932 KB ok, correct split
80 Correct 9 ms 15316 KB ok, correct split
81 Correct 12 ms 15060 KB ok, correct split
82 Correct 9 ms 15316 KB ok, correct split
83 Correct 10 ms 15060 KB ok, correct split
84 Correct 7 ms 14804 KB ok, no valid answer
85 Correct 7 ms 15060 KB ok, correct split
86 Correct 7 ms 15084 KB ok, correct split
87 Correct 10 ms 14548 KB ok, no valid answer
88 Correct 7 ms 14504 KB ok, no valid answer
89 Correct 11 ms 14808 KB ok, no valid answer
90 Correct 9 ms 14932 KB ok, no valid answer
91 Correct 10 ms 14804 KB ok, no valid answer
92 Correct 8 ms 14804 KB ok, no valid answer
93 Correct 8 ms 14844 KB ok, no valid answer
94 Correct 86 ms 28728 KB ok, correct split
95 Correct 114 ms 33760 KB ok, correct split
96 Correct 135 ms 32272 KB ok, correct split
97 Correct 30 ms 19456 KB ok, correct split
98 Correct 33 ms 19580 KB ok, correct split
99 Correct 40 ms 21628 KB ok, correct split
100 Correct 111 ms 29908 KB ok, correct split
101 Correct 87 ms 28928 KB ok, correct split
102 Correct 98 ms 28524 KB ok, correct split
103 Correct 108 ms 28360 KB ok, correct split
104 Correct 98 ms 30012 KB ok, correct split
105 Correct 48 ms 22340 KB ok, correct split
106 Correct 102 ms 33812 KB ok, correct split
107 Correct 92 ms 26576 KB ok, correct split
108 Correct 78 ms 26480 KB ok, correct split
109 Correct 138 ms 29272 KB ok, correct split
110 Correct 119 ms 30292 KB ok, correct split
111 Correct 120 ms 30620 KB ok, correct split
112 Correct 105 ms 30756 KB ok, correct split
113 Correct 96 ms 30852 KB ok, correct split
114 Correct 19 ms 16596 KB ok, correct split
115 Correct 17 ms 16300 KB ok, correct split
116 Correct 132 ms 30588 KB ok, correct split
117 Correct 97 ms 30272 KB ok, correct split
118 Correct 80 ms 25928 KB ok, correct split
119 Correct 68 ms 26304 KB ok, correct split
120 Correct 87 ms 30276 KB ok, correct split
121 Correct 64 ms 24824 KB ok, no valid answer
122 Correct 63 ms 24972 KB ok, no valid answer
123 Correct 89 ms 28620 KB ok, no valid answer
124 Correct 121 ms 28484 KB ok, no valid answer
125 Correct 90 ms 26312 KB ok, no valid answer
126 Correct 48 ms 24388 KB ok, no valid answer
127 Correct 68 ms 26692 KB ok, no valid answer