oj.uz

Submission #469810

# Submission time Handle Problem Language Result Execution time Memory
469810 2021-09-01T19:30:06 Z tutis Split the Attractions (IOI19_split) C++17
100 / 100
 160 ms 23000 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_split(int n, int c1, int c2, int c3, vector<int> p, vector<int> q) {
	pair<int, int>C[3] = {{c1, 1}, {c2, 2}, {c3, 3}};
	sort(C, C + 3);
	vector<int> res(n, C[2].second);
	vector<int>adj[n];
	vector<int>child[n];
	for (int i = 0; i < (int)p.size(); i++)
	{
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	vector<bool>vis(n, false);
	int sz[n];
	function<void(int)>dfs0 = [&](int x)->void
	{
		vis[x] = true;
		sz[x] = 1;
		for (int y : adj[x])
		{
			if (!vis[y])
			{
				child[x].push_back(y);
				dfs0(y);
				sz[x] += sz[y];
			}
		}
	};
	dfs0(0);
	int gal = -1;
	int col = -1;
	pair<int, int>cen = {n + 1, 0};
	function<void(int)>dfs1 = [&](int x)->void
	{
		int mx = n - sz[x];
		for (int y : child[x])
		{
			mx = max(mx, sz[y]);
			dfs1(y);
			if (sz[y] >= C[1].first && n - sz[y] >= C[0].first)
			{
				gal = y;
				col = 1;
			}
			if (sz[y] >= C[0].first && n - sz[y] >= C[1].first)
			{
				gal = y;
				col = 0;
			}
		}
		cen = min(cen, {mx, x});
	};
	dfs1(0);
	assert(cen.first * 2 <= n);
	if (gal == -1)
	{
		int c = cen.second;
		vector<int>com(n, 1);
		com[c] = 0;
		int timer = 2;
		if (sz[c] == n)
			timer = 1;
		vector<int>dyd(n, 0);
		int pa[n];
		function<int(int)>root = [&](int x)
		{
			if (x == pa[x])
				return x;
			return pa[x] = root(pa[x]);
		};
		for (int a : child[c])
		{
			function<void(int)>dfs2 = [&](int x)->void
			{
				com[x] = timer;
				for (int y : child[x])
				{
					dfs2(y);
				}
			};
			dfs2(a);
			timer++;
		}
		assert(timer <= n);
		for (int i = 0; i < n; i++)
			dyd[com[i]]++;
		for (int i = 0; i < n; i++)
			pa[i] = i;
		for (int i = 0; i < n; i++)
		{
			assert(dyd[i] < C[0].first || dyd[i] > C[1].first);
		}
		int spalv[n];
		for (int i = 0; i < n; i++)
		{
			for (int j : adj[i])
			{
				int a = root(com[i]);
				int b = root(com[j]);
				if (a != b && a != 0 && b != 0)
				{
					pa[a] = b;
					dyd[b] += dyd[a];
					if (dyd[b] >= C[0].first)
					{
						int cnt0 = 0;
						int cnt1 = 0;
						for (int i = 0; i < n; i++)
						{
							if (root(com[i]) == b)
							{
								spalv[i] = 0;
								cnt0++;
							}
							else
							{
								spalv[i] = 1;
								cnt1++;
							}
						}
						int k0 = 0;
						int k1 = 0;
						if (cnt0 >= C[0].first && cnt1 >= C[1].first)
						{
							while (spalv[k0] != 0)
								k0++;
							while (spalv[k1] != 1)
								k1++;
						}
						else if (cnt1 >= C[0].first && cnt0 >= C[1].first)
						{
							while (spalv[k0] != 1)
								k0++;
							while (spalv[k1] != 0)
								k1++;
						}
						assert(k0 != k1);

						function<void(int, int, int&)>dfs3 = [&](int x, int col, int &cnt)->void
						{
							if (cnt <= 0)
								return;
							cnt--;
							res[x] = C[col].second;
							for (int y : adj[x])
							{
								if (spalv[y] != spalv[x])
									continue;
								if (res[y] == C[2].second)
									dfs3(y, col, cnt);
							}
						};
						dfs3(k0, 0, C[0].first);
						dfs3(k1, 1, C[1].first);
						return res;
					}
				}
			}
		}
		return vector<int>(n, 0);
	}
	function<void(int, int, int&)>dfs2 = [&](int x, int col, int &cnt)->void
	{
		if (cnt <= 0)
			return;
		cnt--;
		res[x] = C[col].second;
		for (int y : child[x])
		{
			if (y == gal)
				continue;
			dfs2(y, col, cnt);
		}
	};
	dfs2(gal, col, C[col].first);
	dfs2(0, 1 - col, C[1 - col].first);
	return res;
}
// int main()
// {
// 	for (int i : find_split(9, 3, 3, 3, {0, 1, 2, 3, 4, 5, 6, 7, 8}, {8, 0, 1, 2, 3, 4, 5, 6, 7}))
// 	{
// 		cout << i << " ";
// 	}
// }

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 0 ms 204 KB ok, correct split
6 Correct 1 ms 204 KB ok, correct split
7 Correct 109 ms 22708 KB ok, correct split
8 Correct 106 ms 19820 KB ok, correct split
9 Correct 102 ms 18956 KB ok, correct split
10 Correct 101 ms 22980 KB ok, correct split
11 Correct 105 ms 22928 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 113 ms 17872 KB ok, correct split
5 Correct 86 ms 12128 KB ok, correct split
6 Correct 102 ms 22956 KB ok, correct split
7 Correct 101 ms 19508 KB ok, correct split
8 Correct 127 ms 14788 KB ok, correct split
9 Correct 99 ms 13608 KB ok, correct split
10 Correct 60 ms 11580 KB ok, correct split
11 Correct 60 ms 11560 KB ok, correct split
12 Correct 61 ms 11580 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 88 ms 12184 KB ok, correct split
3 Correct 29 ms 4992 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 101 ms 16640 KB ok, correct split
6 Correct 95 ms 16304 KB ok, correct split
7 Correct 95 ms 16184 KB ok, correct split
8 Correct 107 ms 17732 KB ok, correct split
9 Correct 99 ms 15996 KB ok, correct split
10 Correct 26 ms 4812 KB ok, no valid answer
11 Correct 41 ms 7128 KB ok, no valid answer
12 Correct 80 ms 13580 KB ok, no valid answer
13 Correct 91 ms 14020 KB ok, no valid answer
14 Correct 69 ms 13336 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 0 ms 204 KB ok, correct split
6 Correct 1 ms 204 KB ok, correct split
7 Correct 109 ms 22708 KB ok, correct split
8 Correct 106 ms 19820 KB ok, correct split
9 Correct 102 ms 18956 KB ok, correct split
10 Correct 101 ms 22980 KB ok, correct split
11 Correct 105 ms 22928 KB ok, correct split
12 Correct 0 ms 204 KB ok, correct split
13 Correct 0 ms 204 KB ok, correct split
14 Correct 0 ms 204 KB ok, correct split
15 Correct 113 ms 17872 KB ok, correct split
16 Correct 86 ms 12128 KB ok, correct split
17 Correct 102 ms 22956 KB ok, correct split
18 Correct 101 ms 19508 KB ok, correct split
19 Correct 127 ms 14788 KB ok, correct split
20 Correct 99 ms 13608 KB ok, correct split
21 Correct 60 ms 11580 KB ok, correct split
22 Correct 60 ms 11560 KB ok, correct split
23 Correct 61 ms 11580 KB ok, correct split
24 Correct 0 ms 204 KB ok, correct split
25 Correct 88 ms 12184 KB ok, correct split
26 Correct 29 ms 4992 KB ok, correct split
27 Correct 0 ms 204 KB ok, correct split
28 Correct 101 ms 16640 KB ok, correct split
29 Correct 95 ms 16304 KB ok, correct split
30 Correct 95 ms 16184 KB ok, correct split
31 Correct 107 ms 17732 KB ok, correct split
32 Correct 99 ms 15996 KB ok, correct split
33 Correct 26 ms 4812 KB ok, no valid answer
34 Correct 41 ms 7128 KB ok, no valid answer
35 Correct 80 ms 13580 KB ok, no valid answer
36 Correct 91 ms 14020 KB ok, no valid answer
37 Correct 69 ms 13336 KB ok, no valid answer
38 Correct 0 ms 204 KB ok, correct split
39 Correct 0 ms 204 KB ok, no valid answer
40 Correct 0 ms 204 KB ok, correct split
41 Correct 0 ms 204 KB ok, correct split
42 Correct 1 ms 204 KB ok, correct split
43 Correct 0 ms 204 KB ok, correct split
44 Correct 0 ms 204 KB ok, correct split
45 Correct 1 ms 204 KB ok, correct split
46 Correct 3 ms 588 KB ok, correct split
47 Correct 3 ms 588 KB ok, correct split
48 Correct 1 ms 204 KB ok, correct split
49 Correct 3 ms 588 KB ok, correct split
50 Correct 0 ms 204 KB ok, correct split
51 Correct 1 ms 204 KB ok, correct split
52 Correct 1 ms 204 KB ok, correct split
53 Correct 0 ms 204 KB ok, correct split
54 Correct 0 ms 204 KB ok, correct split
55 Correct 0 ms 204 KB ok, correct split
56 Correct 1 ms 332 KB ok, correct split
57 Correct 1 ms 332 KB ok, correct split
58 Correct 2 ms 588 KB ok, correct split
59 Correct 2 ms 588 KB ok, correct split
60 Correct 2 ms 716 KB ok, correct split
61 Correct 2 ms 696 KB ok, correct split
62 Correct 2 ms 588 KB ok, correct split
63 Correct 3 ms 588 KB ok, correct split
64 Correct 3 ms 588 KB ok, correct split
65 Correct 3 ms 588 KB ok, correct split
66 Correct 1 ms 332 KB ok, correct split
67 Correct 2 ms 588 KB ok, correct split
68 Correct 1 ms 332 KB ok, correct split
69 Correct 1 ms 292 KB ok, correct split
70 Correct 1 ms 332 KB ok, correct split
71 Correct 2 ms 588 KB ok, correct split
72 Correct 2 ms 604 KB ok, correct split
73 Correct 2 ms 588 KB ok, correct split
74 Correct 3 ms 716 KB ok, correct split
75 Correct 3 ms 716 KB ok, correct split
76 Correct 3 ms 716 KB ok, correct split
77 Correct 3 ms 588 KB ok, correct split
78 Correct 2 ms 432 KB ok, correct split
79 Correct 2 ms 460 KB ok, correct split
80 Correct 3 ms 716 KB ok, correct split
81 Correct 3 ms 688 KB ok, correct split
82 Correct 3 ms 684 KB ok, correct split
83 Correct 2 ms 716 KB ok, correct split
84 Correct 2 ms 716 KB ok, no valid answer
85 Correct 2 ms 588 KB ok, correct split
86 Correct 2 ms 716 KB ok, correct split
87 Correct 1 ms 204 KB ok, no valid answer
88 Correct 0 ms 204 KB ok, no valid answer
89 Correct 2 ms 588 KB ok, no valid answer
90 Correct 4 ms 716 KB ok, no valid answer
91 Correct 2 ms 588 KB ok, no valid answer
92 Correct 2 ms 588 KB ok, no valid answer
93 Correct 2 ms 588 KB ok, no valid answer
94 Correct 100 ms 16972 KB ok, correct split
95 Correct 160 ms 23000 KB ok, correct split
96 Correct 125 ms 21060 KB ok, correct split
97 Correct 30 ms 5536 KB ok, correct split
98 Correct 32 ms 5700 KB ok, correct split
99 Correct 48 ms 8132 KB ok, correct split
100 Correct 127 ms 17708 KB ok, correct split
101 Correct 111 ms 16452 KB ok, correct split
102 Correct 103 ms 15816 KB ok, correct split
103 Correct 100 ms 15420 KB ok, correct split
104 Correct 104 ms 15780 KB ok, correct split
105 Correct 59 ms 9284 KB ok, correct split
106 Correct 114 ms 18344 KB ok, correct split
107 Correct 96 ms 14916 KB ok, correct split
108 Correct 97 ms 14876 KB ok, correct split
109 Correct 142 ms 18544 KB ok, correct split
110 Correct 135 ms 19368 KB ok, correct split
111 Correct 134 ms 19512 KB ok, correct split
112 Correct 139 ms 18352 KB ok, correct split
113 Correct 127 ms 18100 KB ok, correct split
114 Correct 11 ms 2252 KB ok, correct split
115 Correct 10 ms 1996 KB ok, correct split
116 Correct 121 ms 19404 KB ok, correct split
117 Correct 129 ms 19452 KB ok, correct split
118 Correct 87 ms 14788 KB ok, correct split
119 Correct 89 ms 14760 KB ok, correct split
120 Correct 100 ms 19652 KB ok, correct split
121 Correct 99 ms 15292 KB ok, no valid answer
122 Correct 93 ms 15184 KB ok, no valid answer
123 Correct 142 ms 19252 KB ok, no valid answer
124 Correct 151 ms 19380 KB ok, no valid answer
125 Correct 90 ms 16036 KB ok, no valid answer
126 Correct 61 ms 12988 KB ok, no valid answer
127 Correct 108 ms 17068 KB ok, no valid answer