oj.uz

답안 #452069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
452069 2021-08-03T17:55:09 Z flappybird Split the Attractions (IOI19_split) C++14
100 / 100
 216 ms 25648 KB 
#include "split.h"
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
typedef int ll;
#define MAX 101010
ll N;
ll num[MAX], prt[MAX];
ll color[MAX];
vector<ll> adj[MAX], tree[MAX];
ll vis[MAX];
ll cnt = 0;
ll ord[MAX];
ll memo[MAX];
ll arr[MAX];
ll split[2][MAX];
ll dfs(ll x = 0, ll p = -1) {
	ord[x] = ++cnt;
	prt[x] = p;
	num[x] = 1;
	vis[x] = 1;
	ll ret = ord[x];
	for (auto v : adj[x]) {
		if (v == p) continue;
		if (vis[v]) {
			ret = min(ret, ord[v]);
			continue;
		}
		ret = min(dfs(v, x), ret);
		num[x] += num[v];
	}
	return memo[x] = ret;
}
void chk(ll x, ll p, ll c) {
	arr[x] = c;
	for (auto v : tree[x]) {
		if (v == p) continue;
		chk(v, x, c);
	}
}
void dfs2(ll x, ll p, ll c) {
	split[c][x] = ++cnt;
	vis[x] = 1;
	for (auto v : adj[x]) {
		if (v == p || arr[v] != c) continue;
		if (vis[v]) continue;
		dfs2(v, x, c);
	}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res;
	N = n;
	res.resize(N);
	ll i;
	for (i = 0; i < q.size(); i++) adj[p[i]].push_back(q[i]), adj[q[i]].push_back(p[i]);
	dfs();
	for (i = 0; i < N; i++) vis[i] = 0;
	ll s[3] = { a, b, c };
	ll pp[3] = { 0, 0, 0 };
	pp[(s[0] > s[1] ? 0 : 1)]++;
	pp[(s[1] > s[2] ? 1 : 2)]++;
	pp[(s[0] > s[2] ? 0 : 2)]++;
	ll m = s[pp[0]];
	ll asdf[3];
	asdf[pp[0]] = 0;
	asdf[pp[1]] = 1;
	asdf[pp[2]] = 2;
	pp[0] = asdf[0];
	pp[1] = asdf[1];
	pp[2] = asdf[2];
	for (i = 1; i < N; i++) {
		tree[i].push_back(prt[i]);
		tree[prt[i]].push_back(i);
	}
	c = 0;
	while (1) {
		ll ccc = 1;
		for (auto v : tree[c]) {
			if (v == prt[c]) continue;
			if (num[v] >= m) {
				ccc = 0, c = v;
				break;
			}
		}
		if (ccc) break;
	}
	ll nc = num[c];
	vector<ll> sav;
	chk(0, -1, 1);
	chk(c, prt[c], 0);
	for (auto v : tree[c]) {
		if (v == prt[c]) continue;
		if (memo[v] >= ord[c]) continue;
		if (nc - num[v] < m) break;
		if (N - nc >= s[pp[1]]) break;
		nc -= num[v];
		sav.push_back(v);
	}
	if (!(nc >= s[pp[0]] && (N - nc) >= s[pp[1]])) {
		sav.clear();
		nc = num[c];
		if (nc < s[pp[1]]) return res;
		for (auto v : tree[c]) {
			if (v == prt[c]) continue;
			if (memo[v] >= ord[c]) continue;
			if (nc - num[v] < s[pp[1]]) break;
			if (N - nc >= s[pp[0]]) break;
			nc -= num[v];
			sav.push_back(v);
		}
		if (!(nc >= s[pp[1]] && (N - nc) >= s[pp[0]])) return res;
		for (auto v : sav) chk(v, c, 1);
		cnt = 0;
		dfs2(0, -1, 1);
		for (i = 0; i < N; i++) vis[i] = 0;
		cnt = 0;
		dfs2(c, prt[c], 0);
		for (i = 0; i < N; i++) res[i] = pp[2] + 1;
		for (i = 0; i < N; i++) {
			if (!arr[i] && split[0][i] <= s[pp[1]]) {
				res[i] = pp[1] + 1;
			}
		}
		for (i = 0; i < N; i++) {
			if (arr[i] && split[1][i] <= s[pp[0]]) {
				res[i] = pp[0] + 1;
			}
		}
		vector<ll> v(4);
		for (i = 0; i < N; i++) {
			v[res[i]]++;
		}
		//assert(s[p[0]] == v[1] && s[p[1]] == v[2]);
		return res;
	}
	for (auto v : sav) chk(v, c, 1);
	cnt = 0;
	dfs2(0, -1, 1);
	for (i = 0; i < N; i++) vis[i] = 0;
	cnt = 0;
	dfs2(c, prt[c], 0);
	ll cnt1 = 0;
	for (i = 0; i < N; i++) cnt1 += arr[i];
	for (i = 0; i < N; i++) res[i] = pp[2] + 1;
	for (i = 0; i < N; i++) {
		if (!arr[i] && split[0][i] <= s[pp[0]]) {
			res[i] = pp[0] + 1;
		}
	}
	for (i = 0; i < N; i++) {
		if (arr[i] && split[1][i] <= s[pp[1]]) {
			res[i] = pp[1] + 1;
		}
	}
	vector<ll> v(4);
	for (i = 0; i < N; i++) {
		v[res[i]]++;
	}
	assert(s[0] == v[1] && s[1] == v[2]);
	return res;
}

Compilation message

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5068 KB ok, correct split
2 Correct 3 ms 5044 KB ok, correct split
3 Correct 4 ms 5068 KB ok, correct split
4 Correct 3 ms 5068 KB ok, correct split
5 Correct 4 ms 5068 KB ok, correct split
6 Correct 4 ms 5068 KB ok, correct split
7 Correct 130 ms 24408 KB ok, correct split
8 Correct 131 ms 21932 KB ok, correct split
9 Correct 134 ms 21636 KB ok, correct split
10 Correct 129 ms 24440 KB ok, correct split
11 Correct 138 ms 24788 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5068 KB ok, correct split
2 Correct 3 ms 5068 KB ok, correct split
3 Correct 3 ms 5068 KB ok, correct split
4 Correct 150 ms 21340 KB ok, correct split
5 Correct 104 ms 16840 KB ok, correct split
6 Correct 132 ms 24512 KB ok, correct split
7 Correct 129 ms 21572 KB ok, correct split
8 Correct 164 ms 18660 KB ok, correct split
9 Correct 133 ms 16708 KB ok, correct split
10 Correct 96 ms 17408 KB ok, correct split
11 Correct 71 ms 17328 KB ok, correct split
12 Correct 71 ms 17360 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5068 KB ok, correct split
2 Correct 119 ms 17240 KB ok, correct split
3 Correct 39 ms 10036 KB ok, correct split
4 Correct 3 ms 5068 KB ok, correct split
5 Correct 125 ms 19652 KB ok, correct split
6 Correct 132 ms 19380 KB ok, correct split
7 Correct 140 ms 19236 KB ok, correct split
8 Correct 128 ms 20556 KB ok, correct split
9 Correct 129 ms 18976 KB ok, correct split
10 Correct 30 ms 9036 KB ok, no valid answer
11 Correct 44 ms 10944 KB ok, no valid answer
12 Correct 87 ms 16796 KB ok, no valid answer
13 Correct 113 ms 16580 KB ok, no valid answer
14 Correct 69 ms 17072 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4992 KB ok, correct split
2 Correct 3 ms 5068 KB ok, no valid answer
3 Correct 3 ms 5068 KB ok, correct split
4 Correct 3 ms 5068 KB ok, correct split
5 Correct 3 ms 5068 KB ok, correct split
6 Correct 4 ms 4988 KB ok, correct split
7 Correct 3 ms 5068 KB ok, correct split
8 Correct 3 ms 5068 KB ok, correct split
9 Correct 6 ms 5452 KB ok, correct split
10 Correct 8 ms 5444 KB ok, correct split
11 Correct 4 ms 5068 KB ok, correct split
12 Correct 6 ms 5452 KB ok, correct split
13 Correct 3 ms 5068 KB ok, correct split
14 Correct 3 ms 5068 KB ok, correct split
15 Correct 3 ms 5048 KB ok, correct split
16 Correct 3 ms 5068 KB ok, correct split
17 Correct 3 ms 5048 KB ok, correct split
18 Correct 3 ms 5068 KB ok, correct split
19 Correct 4 ms 5080 KB ok, correct split
20 Correct 4 ms 5196 KB ok, correct split
21 Correct 5 ms 5324 KB ok, correct split
22 Correct 5 ms 5324 KB ok, correct split
23 Correct 5 ms 5452 KB ok, correct split
24 Correct 5 ms 5440 KB ok, correct split
25 Correct 5 ms 5324 KB ok, correct split
26 Correct 6 ms 5452 KB ok, correct split
27 Correct 5 ms 5452 KB ok, correct split
28 Correct 6 ms 5452 KB ok, correct split
29 Correct 4 ms 5068 KB ok, correct split
30 Correct 6 ms 5452 KB ok, correct split
31 Correct 5 ms 5068 KB ok, correct split
32 Correct 4 ms 5068 KB ok, correct split
33 Correct 4 ms 5068 KB ok, correct split
34 Correct 8 ms 5324 KB ok, correct split
35 Correct 6 ms 5324 KB ok, correct split
36 Correct 5 ms 5324 KB ok, correct split
37 Correct 6 ms 5420 KB ok, correct split
38 Correct 6 ms 5452 KB ok, correct split
39 Correct 6 ms 5384 KB ok, correct split
40 Correct 6 ms 5452 KB ok, correct split
41 Correct 5 ms 5184 KB ok, correct split
42 Correct 5 ms 5196 KB ok, correct split
43 Correct 7 ms 5452 KB ok, correct split
44 Correct 6 ms 5452 KB ok, correct split
45 Correct 6 ms 5452 KB ok, correct split
46 Correct 5 ms 5452 KB ok, correct split
47 Correct 5 ms 5308 KB ok, no valid answer
48 Correct 5 ms 5324 KB ok, correct split
49 Correct 5 ms 5452 KB ok, correct split
50 Correct 3 ms 5068 KB ok, no valid answer
51 Correct 3 ms 5068 KB ok, no valid answer
52 Correct 5 ms 5324 KB ok, no valid answer
53 Correct 6 ms 5324 KB ok, no valid answer
54 Correct 6 ms 5324 KB ok, no valid answer
55 Correct 7 ms 5324 KB ok, no valid answer
56 Correct 6 ms 5324 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5068 KB ok, correct split
2 Correct 3 ms 5044 KB ok, correct split
3 Correct 4 ms 5068 KB ok, correct split
4 Correct 3 ms 5068 KB ok, correct split
5 Correct 4 ms 5068 KB ok, correct split
6 Correct 4 ms 5068 KB ok, correct split
7 Correct 130 ms 24408 KB ok, correct split
8 Correct 131 ms 21932 KB ok, correct split
9 Correct 134 ms 21636 KB ok, correct split
10 Correct 129 ms 24440 KB ok, correct split
11 Correct 138 ms 24788 KB ok, correct split
12 Correct 3 ms 5068 KB ok, correct split
13 Correct 3 ms 5068 KB ok, correct split
14 Correct 3 ms 5068 KB ok, correct split
15 Correct 150 ms 21340 KB ok, correct split
16 Correct 104 ms 16840 KB ok, correct split
17 Correct 132 ms 24512 KB ok, correct split
18 Correct 129 ms 21572 KB ok, correct split
19 Correct 164 ms 18660 KB ok, correct split
20 Correct 133 ms 16708 KB ok, correct split
21 Correct 96 ms 17408 KB ok, correct split
22 Correct 71 ms 17328 KB ok, correct split
23 Correct 71 ms 17360 KB ok, correct split
24 Correct 3 ms 5068 KB ok, correct split
25 Correct 119 ms 17240 KB ok, correct split
26 Correct 39 ms 10036 KB ok, correct split
27 Correct 3 ms 5068 KB ok, correct split
28 Correct 125 ms 19652 KB ok, correct split
29 Correct 132 ms 19380 KB ok, correct split
30 Correct 140 ms 19236 KB ok, correct split
31 Correct 128 ms 20556 KB ok, correct split
32 Correct 129 ms 18976 KB ok, correct split
33 Correct 30 ms 9036 KB ok, no valid answer
34 Correct 44 ms 10944 KB ok, no valid answer
35 Correct 87 ms 16796 KB ok, no valid answer
36 Correct 113 ms 16580 KB ok, no valid answer
37 Correct 69 ms 17072 KB ok, no valid answer
38 Correct 3 ms 4992 KB ok, correct split
39 Correct 3 ms 5068 KB ok, no valid answer
40 Correct 3 ms 5068 KB ok, correct split
41 Correct 3 ms 5068 KB ok, correct split
42 Correct 3 ms 5068 KB ok, correct split
43 Correct 4 ms 4988 KB ok, correct split
44 Correct 3 ms 5068 KB ok, correct split
45 Correct 3 ms 5068 KB ok, correct split
46 Correct 6 ms 5452 KB ok, correct split
47 Correct 8 ms 5444 KB ok, correct split
48 Correct 4 ms 5068 KB ok, correct split
49 Correct 6 ms 5452 KB ok, correct split
50 Correct 3 ms 5068 KB ok, correct split
51 Correct 3 ms 5068 KB ok, correct split
52 Correct 3 ms 5048 KB ok, correct split
53 Correct 3 ms 5068 KB ok, correct split
54 Correct 3 ms 5048 KB ok, correct split
55 Correct 3 ms 5068 KB ok, correct split
56 Correct 4 ms 5080 KB ok, correct split
57 Correct 4 ms 5196 KB ok, correct split
58 Correct 5 ms 5324 KB ok, correct split
59 Correct 5 ms 5324 KB ok, correct split
60 Correct 5 ms 5452 KB ok, correct split
61 Correct 5 ms 5440 KB ok, correct split
62 Correct 5 ms 5324 KB ok, correct split
63 Correct 6 ms 5452 KB ok, correct split
64 Correct 5 ms 5452 KB ok, correct split
65 Correct 6 ms 5452 KB ok, correct split
66 Correct 4 ms 5068 KB ok, correct split
67 Correct 6 ms 5452 KB ok, correct split
68 Correct 5 ms 5068 KB ok, correct split
69 Correct 4 ms 5068 KB ok, correct split
70 Correct 4 ms 5068 KB ok, correct split
71 Correct 8 ms 5324 KB ok, correct split
72 Correct 6 ms 5324 KB ok, correct split
73 Correct 5 ms 5324 KB ok, correct split
74 Correct 6 ms 5420 KB ok, correct split
75 Correct 6 ms 5452 KB ok, correct split
76 Correct 6 ms 5384 KB ok, correct split
77 Correct 6 ms 5452 KB ok, correct split
78 Correct 5 ms 5184 KB ok, correct split
79 Correct 5 ms 5196 KB ok, correct split
80 Correct 7 ms 5452 KB ok, correct split
81 Correct 6 ms 5452 KB ok, correct split
82 Correct 6 ms 5452 KB ok, correct split
83 Correct 5 ms 5452 KB ok, correct split
84 Correct 5 ms 5308 KB ok, no valid answer
85 Correct 5 ms 5324 KB ok, correct split
86 Correct 5 ms 5452 KB ok, correct split
87 Correct 3 ms 5068 KB ok, no valid answer
88 Correct 3 ms 5068 KB ok, no valid answer
89 Correct 5 ms 5324 KB ok, no valid answer
90 Correct 6 ms 5324 KB ok, no valid answer
91 Correct 6 ms 5324 KB ok, no valid answer
92 Correct 7 ms 5324 KB ok, no valid answer
93 Correct 6 ms 5324 KB ok, no valid answer
94 Correct 134 ms 20584 KB ok, correct split
95 Correct 207 ms 25648 KB ok, correct split
96 Correct 175 ms 23892 KB ok, correct split
97 Correct 37 ms 10024 KB ok, correct split
98 Correct 43 ms 10052 KB ok, correct split
99 Correct 68 ms 12204 KB ok, correct split
100 Correct 156 ms 21276 KB ok, correct split
101 Correct 165 ms 20196 KB ok, correct split
102 Correct 148 ms 19516 KB ok, correct split
103 Correct 135 ms 19424 KB ok, correct split
104 Correct 117 ms 21676 KB ok, correct split
105 Correct 69 ms 12848 KB ok, correct split
106 Correct 109 ms 21304 KB ok, correct split
107 Correct 114 ms 17728 KB ok, correct split
108 Correct 109 ms 17720 KB ok, correct split
109 Correct 164 ms 20608 KB ok, correct split
110 Correct 155 ms 20684 KB ok, correct split
111 Correct 216 ms 20664 KB ok, correct split
112 Correct 178 ms 20928 KB ok, correct split
113 Correct 144 ms 20916 KB ok, correct split
114 Correct 17 ms 6984 KB ok, correct split
115 Correct 16 ms 6680 KB ok, correct split
116 Correct 152 ms 20628 KB ok, correct split
117 Correct 181 ms 20496 KB ok, correct split
118 Correct 112 ms 17592 KB ok, correct split
119 Correct 121 ms 17596 KB ok, correct split
120 Correct 118 ms 21692 KB ok, correct split
121 Correct 97 ms 17116 KB ok, no valid answer
122 Correct 91 ms 17088 KB ok, no valid answer
123 Correct 151 ms 20692 KB ok, no valid answer
124 Correct 166 ms 20536 KB ok, no valid answer
125 Correct 87 ms 18304 KB ok, no valid answer
126 Correct 57 ms 16224 KB ok, no valid answer
127 Correct 105 ms 18728 KB ok, no valid answer