oj.uz

Submission #264743

# Submission time Handle Problem Language Result Execution time Memory
264743 2020-08-14T08:52:23 Z kdh9949 Split the Attractions (IOI19_split) C++17
100 / 100
 221 ms 24696 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

using vint = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpii = vector<pii>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vpll = vector<pll>;

#define x first
#define y second
#define all(v) v.begin(),v.end()

vint solve(int n, int a, int b, vector<vint> &e) {
	vector<vint> te(n);
	vint pn(n), low(n), mlow(n), sz(n), par(n);
	function<void(int, int)> g = [&](int x, int y) {
		static int pc = 0;
		mlow[x] = pn[x] = ++pc;
		sz[x] = 1;
		par[x] = y;
		low[x] = x;

		for(int i : e[x]) {
			if(i == y) continue;
			if(!pn[i]) {
				te[x].push_back(i);
				te[i].push_back(x);
				g(i, x);
				sz[x] += sz[i];
				mlow[x] = min(mlow[x], mlow[i]);
			}
			else {
				if(pn[low[x]] > pn[i]) low[x] = i;
			}
		}
		mlow[x] = min(mlow[x], pn[low[x]]);
	};
	g(0, -1);

	function<int(int, int)> f = [&](int x, int y) {
		for(int i : te[x]) if(i != y && sz[i] >= a) return f(i, x);
		return x;
	};

	int X = f(0, -1);
	for(int &c : te[X]) {
		if(mlow[c] < pn[X] && sz[X] - sz[c] >= a) {
			sz[X] -= sz[c];
			function<int(int, int, int)> rr = [&](int x, int y, int r) {
				if(pn[low[x]] < r) {
					te[x].push_back(low[x]);
					te[low[x]].push_back(x);
					return 1;
				}
				for(int i : te[x]) if(i != y && rr(i, x, r)) return 1;
				return 0;
			};
			rr(c, X, pn[X]);
			for(int &y : te[c]) if(y == X) y = -1;
			c = -1;
		}
	}

	if(n - sz[X] >= a) {
		vint ans(n, 3);
		int cnt;
		function<void(int, int, int)> h = [&](int x, int y, int c) {
			if(cnt) {
				cnt--;
				ans[x] = c;
			}
			for(int i : te[x]) if(i >= 0 && i != y) h(i, x, c);
		};
		int dir = (sz[X] <= n / 2);
		cnt = (dir ? a : b);
		h(X, par[X], 1 + !dir);
		cnt = (dir ? b : a);
		h(par[X], X, 1 + dir);
		return ans;
	}
	else return vint(n, 0);
}

vint find_split(int n, int a, int b, int c, vint p, vint q) {
	vint v = {0, a, b, c};
	vint col = {0, 1, 2, 3};
	sort(all(col), [&](int x, int y){ return v[x] < v[y]; });
	
	vector<vint> e(n);
	for(int i = 0; i < p.size(); i++) {
		e[p[i]].push_back(q[i]);
		e[q[i]].push_back(p[i]);
	}
	
	vint ans = solve(n, v[col[1]], v[col[2]], e);
	for(int &x : ans) x = col[x];
	return ans;
}

Compilation message

split.cpp: In function 'vint find_split(int, int, int, int, vint, vint)':
split.cpp:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |  for(int i = 0; i < p.size(); i++) {
      |                 ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, correct split
3 Correct 1 ms 256 KB ok, correct split
4 Correct 1 ms 256 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 140 ms 22648 KB ok, correct split
8 Correct 158 ms 24680 KB ok, correct split
9 Correct 147 ms 24568 KB ok, correct split
10 Correct 183 ms 24696 KB ok, correct split
11 Correct 154 ms 23032 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 400 KB ok, correct split
2 Correct 1 ms 256 KB ok, correct split
3 Correct 1 ms 384 KB ok, correct split
4 Correct 171 ms 20624 KB ok, correct split
5 Correct 135 ms 15352 KB ok, correct split
6 Correct 138 ms 24568 KB ok, correct split
7 Correct 138 ms 24568 KB ok, correct split
8 Correct 178 ms 17272 KB ok, correct split
9 Correct 131 ms 15480 KB ok, correct split
10 Correct 91 ms 15984 KB ok, correct split
11 Correct 88 ms 15976 KB ok, correct split
12 Correct 90 ms 15988 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 135 ms 15480 KB ok, correct split
3 Correct 43 ms 6392 KB ok, correct split
4 Correct 1 ms 288 KB ok, correct split
5 Correct 143 ms 18040 KB ok, correct split
6 Correct 129 ms 18040 KB ok, correct split
7 Correct 138 ms 18036 KB ok, correct split
8 Correct 139 ms 18680 KB ok, correct split
9 Correct 138 ms 18040 KB ok, correct split
10 Correct 30 ms 5376 KB ok, no valid answer
11 Correct 69 ms 7928 KB ok, no valid answer
12 Correct 107 ms 15732 KB ok, no valid answer
13 Correct 111 ms 15480 KB ok, no valid answer
14 Correct 87 ms 15984 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 1 ms 384 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 256 KB ok, correct split
7 Correct 1 ms 256 KB ok, correct split
8 Correct 0 ms 256 KB ok, correct split
9 Correct 4 ms 768 KB ok, correct split
10 Correct 4 ms 768 KB ok, correct split
11 Correct 1 ms 384 KB ok, correct split
12 Correct 4 ms 768 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 1 ms 256 KB ok, correct split
17 Correct 0 ms 256 KB ok, correct split
18 Correct 1 ms 256 KB ok, correct split
19 Correct 1 ms 416 KB ok, correct split
20 Correct 2 ms 512 KB ok, correct split
21 Correct 2 ms 768 KB ok, correct split
22 Correct 2 ms 768 KB ok, correct split
23 Correct 3 ms 768 KB ok, correct split
24 Correct 3 ms 768 KB ok, correct split
25 Correct 3 ms 768 KB ok, correct split
26 Correct 3 ms 768 KB ok, correct split
27 Correct 3 ms 768 KB ok, correct split
28 Correct 3 ms 768 KB ok, correct split
29 Correct 1 ms 384 KB ok, correct split
30 Correct 3 ms 768 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 3 ms 640 KB ok, correct split
35 Correct 3 ms 640 KB ok, correct split
36 Correct 2 ms 640 KB ok, correct split
37 Correct 3 ms 768 KB ok, correct split
38 Correct 4 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 2 ms 512 KB ok, correct split
42 Correct 2 ms 512 KB ok, correct split
43 Correct 3 ms 768 KB ok, correct split
44 Correct 5 ms 768 KB ok, correct split
45 Correct 3 ms 768 KB ok, correct split
46 Correct 3 ms 768 KB ok, correct split
47 Correct 2 ms 768 KB ok, no valid answer
48 Correct 3 ms 640 KB ok, correct split
49 Correct 2 ms 768 KB ok, correct split
50 Correct 0 ms 256 KB ok, no valid answer
51 Correct 0 ms 256 KB ok, no valid answer
52 Correct 3 ms 640 KB ok, no valid answer
53 Correct 3 ms 768 KB ok, no valid answer
54 Correct 2 ms 768 KB ok, no valid answer
55 Correct 2 ms 768 KB ok, no valid answer
56 Correct 3 ms 768 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, correct split
3 Correct 1 ms 256 KB ok, correct split
4 Correct 1 ms 256 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 140 ms 22648 KB ok, correct split
8 Correct 158 ms 24680 KB ok, correct split
9 Correct 147 ms 24568 KB ok, correct split
10 Correct 183 ms 24696 KB ok, correct split
11 Correct 154 ms 23032 KB ok, correct split
12 Correct 1 ms 400 KB ok, correct split
13 Correct 1 ms 256 KB ok, correct split
14 Correct 1 ms 384 KB ok, correct split
15 Correct 171 ms 20624 KB ok, correct split
16 Correct 135 ms 15352 KB ok, correct split
17 Correct 138 ms 24568 KB ok, correct split
18 Correct 138 ms 24568 KB ok, correct split
19 Correct 178 ms 17272 KB ok, correct split
20 Correct 131 ms 15480 KB ok, correct split
21 Correct 91 ms 15984 KB ok, correct split
22 Correct 88 ms 15976 KB ok, correct split
23 Correct 90 ms 15988 KB ok, correct split
24 Correct 0 ms 256 KB ok, correct split
25 Correct 135 ms 15480 KB ok, correct split
26 Correct 43 ms 6392 KB ok, correct split
27 Correct 1 ms 288 KB ok, correct split
28 Correct 143 ms 18040 KB ok, correct split
29 Correct 129 ms 18040 KB ok, correct split
30 Correct 138 ms 18036 KB ok, correct split
31 Correct 139 ms 18680 KB ok, correct split
32 Correct 138 ms 18040 KB ok, correct split
33 Correct 30 ms 5376 KB ok, no valid answer
34 Correct 69 ms 7928 KB ok, no valid answer
35 Correct 107 ms 15732 KB ok, no valid answer
36 Correct 111 ms 15480 KB ok, no valid answer
37 Correct 87 ms 15984 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 1 ms 384 KB ok, correct split
41 Correct 0 ms 256 KB ok, correct split
42 Correct 1 ms 256 KB ok, correct split
43 Correct 1 ms 256 KB ok, correct split
44 Correct 1 ms 256 KB ok, correct split
45 Correct 0 ms 256 KB ok, correct split
46 Correct 4 ms 768 KB ok, correct split
47 Correct 4 ms 768 KB ok, correct split
48 Correct 1 ms 384 KB ok, correct split
49 Correct 4 ms 768 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 1 ms 256 KB ok, correct split
54 Correct 0 ms 256 KB ok, correct split
55 Correct 1 ms 256 KB ok, correct split
56 Correct 1 ms 416 KB ok, correct split
57 Correct 2 ms 512 KB ok, correct split
58 Correct 2 ms 768 KB ok, correct split
59 Correct 2 ms 768 KB ok, correct split
60 Correct 3 ms 768 KB ok, correct split
61 Correct 3 ms 768 KB ok, correct split
62 Correct 3 ms 768 KB ok, correct split
63 Correct 3 ms 768 KB ok, correct split
64 Correct 3 ms 768 KB ok, correct split
65 Correct 3 ms 768 KB ok, correct split
66 Correct 1 ms 384 KB ok, correct split
67 Correct 3 ms 768 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 3 ms 640 KB ok, correct split
72 Correct 3 ms 640 KB ok, correct split
73 Correct 2 ms 640 KB ok, correct split
74 Correct 3 ms 768 KB ok, correct split
75 Correct 4 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 2 ms 512 KB ok, correct split
79 Correct 2 ms 512 KB ok, correct split
80 Correct 3 ms 768 KB ok, correct split
81 Correct 5 ms 768 KB ok, correct split
82 Correct 3 ms 768 KB ok, correct split
83 Correct 3 ms 768 KB ok, correct split
84 Correct 2 ms 768 KB ok, no valid answer
85 Correct 3 ms 640 KB ok, correct split
86 Correct 2 ms 768 KB ok, correct split
87 Correct 0 ms 256 KB ok, no valid answer
88 Correct 0 ms 256 KB ok, no valid answer
89 Correct 3 ms 640 KB ok, no valid answer
90 Correct 3 ms 768 KB ok, no valid answer
91 Correct 2 ms 768 KB ok, no valid answer
92 Correct 2 ms 768 KB ok, no valid answer
93 Correct 3 ms 768 KB ok, no valid answer
94 Correct 139 ms 18300 KB ok, correct split
95 Correct 199 ms 22136 KB ok, correct split
96 Correct 175 ms 20984 KB ok, correct split
97 Correct 37 ms 6392 KB ok, correct split
98 Correct 42 ms 6400 KB ok, correct split
99 Correct 60 ms 7416 KB ok, correct split
100 Correct 177 ms 17784 KB ok, correct split
101 Correct 188 ms 17076 KB ok, correct split
102 Correct 149 ms 16800 KB ok, correct split
103 Correct 165 ms 16752 KB ok, correct split
104 Correct 159 ms 18020 KB ok, correct split
105 Correct 70 ms 9592 KB ok, correct split
106 Correct 164 ms 18536 KB ok, correct split
107 Correct 130 ms 15480 KB ok, correct split
108 Correct 128 ms 15352 KB ok, correct split
109 Correct 182 ms 17272 KB ok, correct split
110 Correct 194 ms 17136 KB ok, correct split
111 Correct 191 ms 17288 KB ok, correct split
112 Correct 165 ms 17648 KB ok, correct split
113 Correct 167 ms 17520 KB ok, correct split
114 Correct 13 ms 2336 KB ok, correct split
115 Correct 14 ms 2176 KB ok, correct split
116 Correct 221 ms 17136 KB ok, correct split
117 Correct 176 ms 17140 KB ok, correct split
118 Correct 133 ms 15352 KB ok, correct split
119 Correct 153 ms 15352 KB ok, correct split
120 Correct 156 ms 19448 KB ok, correct split
121 Correct 114 ms 15228 KB ok, no valid answer
122 Correct 115 ms 15608 KB ok, no valid answer
123 Correct 186 ms 17912 KB ok, no valid answer
124 Correct 179 ms 17784 KB ok, no valid answer
125 Correct 121 ms 16496 KB ok, no valid answer
126 Correct 82 ms 14464 KB ok, no valid answer
127 Correct 135 ms 16624 KB ok, no valid answer