oj.uz

Submission #296828

# Submission time Handle Problem Language Result Execution time Memory
296828 2020-09-11T00:05:45 Z rqi Split the Attractions (IOI19_split) C++14
100 / 100
 293 ms 29004 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;

#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) begin(x), end(x)

const int mx = 100005;

struct DSU{
	vi e;
	void init(int n){
		e = vi(n, -1);
	}
	int get(int a){
		if(e[a] < 0) return a;
		e[a] = get(e[a]);
		return e[a];
	}
	int getSz(int a){
		return -e[get(a)];
	}
	bool sameSet(int a, int b){
		return get(a) == get(b);
	}
	bool unite(int a, int b){
		a = get(a);
		b = get(b);
		if(a == b) return 0;
		if(-e[a] < -e[b]) swap(a, b); //a now has bigger size
		e[a]+=e[b];
		e[b] = a;
		return 1;
	}
};



int n, a, b, c;
vi L;
vi res;

vi oadj[mx];

vi tadj[mx]; //tree edges

DSU dsu;
vpi extr;

int sub[mx];

void genSub(int node, int prv = -1){
	sub[node] = 1;
	for(auto u: tadj[node]){
		if(u == prv) continue;
		genSub(u, node);
		sub[node]+=sub[u];
	}
}

int getCen(int node, int prv = -1){
	for(auto u: tadj[node]){
		if(u == prv) continue;
		if(sub[u] >= n-sub[u]) return getCen(u, node);
	}
	return node;
}

int und[mx]; //underneath a node under cen
vi rund[mx];

vi sadj[mx]; //adjacent things in cnt graph

void genUnd(int node, int val, int prv = -1){
	und[node] = val;
	rund[val].pb(node);
	for(auto u: tadj[node]){
		if(u == prv) continue;
		genUnd(u, val, node);
	}
}

bool good[mx];
int curw;
bool inSet[mx];

void getW(int node){
	if(!good[node]) return;
	if(inSet[node]) return;
	if(curw >= L[0]) return;

	inSet[node] = 1;
	curw+=sub[node];

	for(auto u: sadj[node]){
		getW(u);
	}
}

int ocount = 0;

void getOnes(int node){
	if(und[node] == -1) return;
	if(!inSet[und[node]]) return;
	if(ocount >= L[0]) return;
	if(res[node] == 1) return;
	//cout << node << "\n";
	ocount++;
	res[node] = 1;
	for(auto u: oadj[node]){
		getOnes(u);
	}
}

int tcount = 0;

void assign2(int node){
	if(tcount >= L[1]) return;
	if(res[node] != 0) return;
	//cout << node << "\n";
	res[node] = 2;
	tcount++;
	for(auto u: tadj[node]){
		assign2(u);
	}
}

void adjustRes(){
	vi to(4, 0);
	vi vals(4, 0);
	for(auto u: res) vals[u]++;
	vpi cnt1, cnt2;
	cnt1.pb(mp(a, 1)); cnt1.pb(mp(b, 2)); cnt1.pb(mp(c, 3));
	cnt2.pb(mp(vals[1], 1)); cnt2.pb(mp(vals[2], 2)); cnt2.pb(mp(vals[3], 3));
	sort(all(cnt1));
	sort(all(cnt2));
	for(int i = 0; i < 3; i++){
		to[cnt2[i].s] = cnt1[i].s;
	}
 
	for(auto &u: res) u = to[u];
}

bool visited[mx];

void crvisit(int node){
	if(visited[node]) return;
	visited[node] = 1;
	for(auto u: oadj[node]){
		if(res[node] == res[u]){
			crvisit(u);
		}
	}
}

bool checkRes(){
	vector<bool> works = vector<bool>(4, 1);
	for(int j = 1; j <= 3; j++){
		for(int i = 0; i < n; i++){
			if(res[i] == j){
				crvisit(i);
				break;
			}
		}
	}
	for(int i = 0; i < n; i++){
		if(!visited[i]){
			works[res[i]] = 0;
		}
	}

	int cnt = 0;
	for(int j = 1; j <= 3; j++){
		if(works[j]) cnt++;
	}
	if(cnt >= 2) return 1;
	return 0;
}

vi find_split(int _n, int _a, int _b, int _c, vi p, vi q) {
	n = _n, a = _a, b = _b, c = _c;
	L = vi{a, b, c};
	sort(all(L));
	res = vi(n, 0);

	dsu.init(n);
	for(int i = 0; i < sz(p); i++){
		oadj[p[i]].pb(q[i]);
		oadj[q[i]].pb(p[i]);
		if(dsu.unite(p[i], q[i])){
			tadj[p[i]].pb(q[i]);
			tadj[q[i]].pb(p[i]);
			//cout << p[i] << " " << q[i] << "\n";
		}
		else{
			extr.pb(mp(p[i], q[i]));
			//cout << p[i] << " " << q[i] << "\n";
		}
	}

	genSub(0);
	int cen = getCen(0);

	und[cen] = -1;
	for(auto u: tadj[cen]){
		genUnd(u, u, cen);
		//cout << u << " " << u << "\n";
	}

	//cout << cen << "\n";
	genSub(cen);

	dsu.init(n);

	for(auto u: tadj[cen]){
		dsu.e[u] = -sub[u];
		//cout << u << " " << dsu.e[u] << "\n";
	}

	for(auto u: extr){
		if(u.f == cen || u.s == cen) continue;
		dsu.unite(und[u.f], und[u.s]);
		sadj[und[u.f]].pb(und[u.s]);
		sadj[und[u.s]].pb(und[u.f]);
		// cout << und[u.f] << " " << und[u.s] << "\n";
	}

	for(auto u: tadj[cen]){
		if(dsu.getSz(u) >= L[0]){
			//cout << u << "\n";
			for(auto x: tadj[cen]){
				if(dsu.sameSet(u, x)){
					//cout << x << "\n";
					good[x] = 1;
				}
			}

			curw = 0;
			getW(u);

			//for(int i = 0; i < n; i++) if(inSet[i]) cout << i << "\n";

			ocount = 0;
			getOnes(u);

			assign2(cen);
			for(auto &u: res) if(u == 0) u = 3;
				// for(auto u: res) cout << u << " ";
				// cout << "\n";
			adjustRes();

			// for(auto u: res) cout << u << " ";
			// cout << "\n";
			assert(checkRes());
			
			return res;
		}
	}

	// for(auto u: res) cout << u << " ";
	// cout << "\n";

	return res;

}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB ok, correct split
2 Correct 7 ms 9728 KB ok, correct split
3 Correct 7 ms 9728 KB ok, correct split
4 Correct 7 ms 9856 KB ok, correct split
5 Correct 7 ms 9728 KB ok, correct split
6 Correct 7 ms 9728 KB ok, correct split
7 Correct 225 ms 25972 KB ok, correct split
8 Correct 199 ms 24180 KB ok, correct split
9 Correct 228 ms 23796 KB ok, correct split
10 Correct 216 ms 26100 KB ok, correct split
11 Correct 224 ms 25056 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB ok, correct split
2 Correct 7 ms 9728 KB ok, correct split
3 Correct 7 ms 9728 KB ok, correct split
4 Correct 235 ms 23784 KB ok, correct split
5 Correct 179 ms 20340 KB ok, correct split
6 Correct 217 ms 25972 KB ok, correct split
7 Correct 232 ms 24052 KB ok, correct split
8 Correct 242 ms 24292 KB ok, correct split
9 Correct 196 ms 20204 KB ok, correct split
10 Correct 123 ms 23520 KB ok, correct split
11 Correct 119 ms 23520 KB ok, correct split
12 Correct 122 ms 23520 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB ok, correct split
2 Correct 186 ms 20592 KB ok, correct split
3 Correct 52 ms 13944 KB ok, correct split
4 Correct 8 ms 9728 KB ok, correct split
5 Correct 222 ms 22136 KB ok, correct split
6 Correct 221 ms 21880 KB ok, correct split
7 Correct 221 ms 21952 KB ok, correct split
8 Correct 226 ms 22776 KB ok, correct split
9 Correct 217 ms 21880 KB ok, correct split
10 Correct 42 ms 13304 KB ok, no valid answer
11 Correct 65 ms 15096 KB ok, no valid answer
12 Correct 133 ms 22132 KB ok, no valid answer
13 Correct 171 ms 20600 KB ok, no valid answer
14 Correct 119 ms 23400 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB ok, correct split
2 Correct 7 ms 9728 KB ok, correct split
3 Correct 7 ms 9728 KB ok, correct split
4 Correct 7 ms 9856 KB ok, correct split
5 Correct 7 ms 9728 KB ok, correct split
6 Correct 7 ms 9728 KB ok, correct split
7 Correct 225 ms 25972 KB ok, correct split
8 Correct 199 ms 24180 KB ok, correct split
9 Correct 228 ms 23796 KB ok, correct split
10 Correct 216 ms 26100 KB ok, correct split
11 Correct 224 ms 25056 KB ok, correct split
12 Correct 7 ms 9728 KB ok, correct split
13 Correct 7 ms 9728 KB ok, correct split
14 Correct 7 ms 9728 KB ok, correct split
15 Correct 235 ms 23784 KB ok, correct split
16 Correct 179 ms 20340 KB ok, correct split
17 Correct 217 ms 25972 KB ok, correct split
18 Correct 232 ms 24052 KB ok, correct split
19 Correct 242 ms 24292 KB ok, correct split
20 Correct 196 ms 20204 KB ok, correct split
21 Correct 123 ms 23520 KB ok, correct split
22 Correct 119 ms 23520 KB ok, correct split
23 Correct 122 ms 23520 KB ok, correct split
24 Correct 7 ms 9728 KB ok, correct split
25 Correct 186 ms 20592 KB ok, correct split
26 Correct 52 ms 13944 KB ok, correct split
27 Correct 8 ms 9728 KB ok, correct split
28 Correct 222 ms 22136 KB ok, correct split
29 Correct 221 ms 21880 KB ok, correct split
30 Correct 221 ms 21952 KB ok, correct split
31 Correct 226 ms 22776 KB ok, correct split
32 Correct 217 ms 21880 KB ok, correct split
33 Correct 42 ms 13304 KB ok, no valid answer
34 Correct 65 ms 15096 KB ok, no valid answer
35 Correct 133 ms 22132 KB ok, no valid answer
36 Correct 171 ms 20600 KB ok, no valid answer
37 Correct 119 ms 23400 KB ok, no valid answer
38 Correct 7 ms 9728 KB ok, correct split
39 Correct 7 ms 9856 KB ok, no valid answer
40 Correct 7 ms 9728 KB ok, correct split
41 Correct 7 ms 9728 KB ok, correct split
42 Correct 7 ms 9856 KB ok, correct split
43 Correct 7 ms 9728 KB ok, correct split
44 Correct 7 ms 9728 KB ok, correct split
45 Correct 7 ms 9728 KB ok, correct split
46 Correct 10 ms 10112 KB ok, correct split
47 Correct 10 ms 10112 KB ok, correct split
48 Correct 7 ms 9728 KB ok, correct split
49 Correct 10 ms 10112 KB ok, correct split
50 Correct 7 ms 9728 KB ok, correct split
51 Correct 7 ms 9728 KB ok, correct split
52 Correct 7 ms 9728 KB ok, correct split
53 Correct 7 ms 9728 KB ok, correct split
54 Correct 7 ms 9728 KB ok, correct split
55 Correct 7 ms 9728 KB ok, correct split
56 Correct 7 ms 9728 KB ok, correct split
57 Correct 8 ms 9856 KB ok, correct split
58 Correct 9 ms 10112 KB ok, correct split
59 Correct 9 ms 10112 KB ok, correct split
60 Correct 9 ms 10112 KB ok, correct split
61 Correct 9 ms 10112 KB ok, correct split
62 Correct 9 ms 10112 KB ok, correct split
63 Correct 10 ms 10240 KB ok, correct split
64 Correct 11 ms 10240 KB ok, correct split
65 Correct 10 ms 10240 KB ok, correct split
66 Correct 7 ms 9728 KB ok, correct split
67 Correct 10 ms 10240 KB ok, correct split
68 Correct 8 ms 9856 KB ok, correct split
69 Correct 8 ms 9728 KB ok, correct split
70 Correct 7 ms 9728 KB ok, correct split
71 Correct 10 ms 10112 KB ok, correct split
72 Correct 9 ms 10112 KB ok, correct split
73 Correct 9 ms 9984 KB ok, correct split
74 Correct 10 ms 10240 KB ok, correct split
75 Correct 11 ms 10240 KB ok, correct split
76 Correct 11 ms 10240 KB ok, correct split
77 Correct 12 ms 10368 KB ok, correct split
78 Correct 9 ms 9984 KB ok, correct split
79 Correct 9 ms 9984 KB ok, correct split
80 Correct 11 ms 10240 KB ok, correct split
81 Correct 10 ms 10240 KB ok, correct split
82 Correct 11 ms 10368 KB ok, correct split
83 Correct 9 ms 10144 KB ok, correct split
84 Correct 9 ms 10112 KB ok, no valid answer
85 Correct 9 ms 9984 KB ok, correct split
86 Correct 9 ms 10112 KB ok, correct split
87 Correct 7 ms 9728 KB ok, no valid answer
88 Correct 7 ms 9728 KB ok, no valid answer
89 Correct 9 ms 10112 KB ok, no valid answer
90 Correct 10 ms 10112 KB ok, no valid answer
91 Correct 9 ms 10112 KB ok, no valid answer
92 Correct 10 ms 10112 KB ok, no valid answer
93 Correct 10 ms 10112 KB ok, no valid answer
94 Correct 220 ms 22764 KB ok, correct split
95 Correct 293 ms 28088 KB ok, correct split
96 Correct 267 ms 25576 KB ok, correct split
97 Correct 53 ms 14424 KB ok, correct split
98 Correct 66 ms 14716 KB ok, correct split
99 Correct 86 ms 17648 KB ok, correct split
100 Correct 250 ms 26980 KB ok, correct split
101 Correct 226 ms 25060 KB ok, correct split
102 Correct 226 ms 26972 KB ok, correct split
103 Correct 202 ms 26724 KB ok, correct split
104 Correct 218 ms 28492 KB ok, correct split
105 Correct 99 ms 17292 KB ok, correct split
106 Correct 199 ms 29004 KB ok, correct split
107 Correct 188 ms 21612 KB ok, correct split
108 Correct 191 ms 21468 KB ok, correct split
109 Correct 257 ms 26468 KB ok, correct split
110 Correct 277 ms 28124 KB ok, correct split
111 Correct 273 ms 28124 KB ok, correct split
112 Correct 258 ms 28576 KB ok, correct split
113 Correct 268 ms 28640 KB ok, correct split
114 Correct 24 ms 11776 KB ok, correct split
115 Correct 23 ms 11648 KB ok, correct split
116 Correct 240 ms 28124 KB ok, correct split
117 Correct 247 ms 27740 KB ok, correct split
118 Correct 216 ms 21492 KB ok, correct split
119 Correct 198 ms 21360 KB ok, correct split
120 Correct 237 ms 23664 KB ok, correct split
121 Correct 170 ms 21368 KB ok, no valid answer
122 Correct 154 ms 21880 KB ok, no valid answer
123 Correct 248 ms 26852 KB ok, no valid answer
124 Correct 238 ms 26980 KB ok, no valid answer
125 Correct 152 ms 25572 KB ok, no valid answer
126 Correct 114 ms 23144 KB ok, no valid answer
127 Correct 194 ms 26208 KB ok, no valid answer