oj.uz

Submission #351393

# Submission time Handle Problem Language Result Execution time Memory
351393 2021-01-20T02:57:06 Z amunduzbaev Split the Attractions (IOI19_split) C++14
100 / 100
 229 ms 20332 KB 
#include <bits/stdc++.h>
#include "split.h"

#ifndef EVAL
#include "grader.cpp"
#endif

using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}

using namespace std;

const int N = 2e5+5;

vpii dd, ex;
vii edges[N];
int par[N], sz[N], sis[N];
int nn, rr;

void dfs(int u, int p){
	sis[u] = 1;
	for(auto x:edges[u]){
		if(x == p) continue;
		dfs(x, u);
		sis[u] += sis[x];
	}
}

int dfs_centr(int u, int p){
	int mx = 0, in = 0;
	for(auto x:edges[u]){
		if(x == p) continue;
		if(sis[x] > mx) mx = sis[x], in = x;
	}
	//assert(in != -1);
	if(mx*2 <= nn) return u; 
	return dfs_centr(in, u);
	//return u;
}

/* ###############################################################################
 * dsu part
 * ############################################################################### */

int f(int x){
	if(x == par[x]) return x;
	return par[x] = f(par[x]);
}

bool  merge(int a, int b){
	a = f(a), b = f(b);
	if(a == b) return 0;
	par[b] = a;
	sz[a] += sz[b];
	return 1;
}

void add_dsu(int u, int p){
	for(auto x:edges[u]){
		if(x == p) continue;
		merge(u, x);
		add_dsu(x, u);
	}
}

/* ###############################################################################
 * solving part
 * ############################################################################### */

set<pii> ss;

bool check(){
	if(!sz(ss)) return 0;
	auto x = --ss.end();
	return (*x).ff >= dd[0].ff;
}

vector<int> res;
int siz;
void s_a(int u){
	if(siz == dd[0].ff) return;
	res[u] = dd[0].ss, siz++;
	for(auto x:edges[u]){
		if(siz == dd[0].ff) return;
		if(f(x) == f(u) && res[x] == 0) s_a(x);
	}
}

void s_b(int u){
	if(siz == dd[1].ff) return;
	res[u] = dd[1].ss, siz++;
	for(auto x:edges[u]){
		if(siz == dd[1].ff) return;
		if(res[x] == 0) s_b(x);
	}
}

vii solve(){
	siz = 0; 
	res.assign(nn, 0);
	s_a((*--ss.end()).ss);
	siz = 0;
	s_b(rr);
	for(int i=0;i<nn;i++) if(res[i] == 0) res[i] = dd[2].ss; 
	
	return res;
}

/* ###############################################################################
 * end of solving part
 * ############################################################################### */

vii find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	nn = n;
	dd.pb(mp(a, 1));
	dd.pb(mp(b, 2));
	dd.pb(mp(c, 3));
	
	sort(all(dd));
	for(int i=0;i<n;i++) par[i] = i, sz[i] = 1;
	
	for(int i=0;i<sz(p);i++){
		int a = p[i], b = q[i];
		if(merge(a, b)){
			edges[a].pb(b);
			edges[b].pb(a);
		}else ex.pb({a, b});
	}
	dfs(0, -1);
	rr = dfs_centr(0, -1);
	
	for(int i=0;i<n;i++) par[i] = i, sz[i] = 1;
	for(auto x:edges[rr]){
		add_dsu(x, rr);
		ss.insert(mp(sz[f(x)], f(x)));
	}
	if(check()) return solve();
	
	for(auto x : ex){
		int a = x.ff, b = x.ss;
		int pa = f(a), pb = f(b);
		if(pa == pb || b == rr || a == rr) continue;
		ss.erase({sz[pa], pa});
		ss.erase({sz[pb], pb});
		merge(pa, pb);
		ss.insert({sz[f(pa)], f(pa)});
		edges[a].pb(b);
		edges[b].pb(a);
		if(check()) return solve();
	}
	res.assign(n, 0);
	return res;
}

/*

6 5
2 2 2
0 1
0 2
0 3
0 4
0 5

9 11 2 3 4
0 1
0 2
0 4
0 3
0 5
0 6
0 8
1 7
3 7
4 5
5 6

*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4972 KB ok, correct split
2 Correct 5 ms 5120 KB ok, correct split
3 Correct 3 ms 4972 KB ok, correct split
4 Correct 4 ms 4972 KB ok, correct split
5 Correct 4 ms 4972 KB ok, correct split
6 Correct 4 ms 4972 KB ok, correct split
7 Correct 142 ms 20332 KB ok, correct split
8 Correct 116 ms 18028 KB ok, correct split
9 Correct 118 ms 17260 KB ok, correct split
10 Correct 115 ms 20332 KB ok, correct split
11 Correct 118 ms 19180 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4972 KB ok, correct split
2 Correct 3 ms 4972 KB ok, correct split
3 Correct 3 ms 4972 KB ok, correct split
4 Correct 111 ms 12900 KB ok, correct split
5 Correct 96 ms 11756 KB ok, correct split
6 Correct 110 ms 19180 KB ok, correct split
7 Correct 114 ms 16620 KB ok, correct split
8 Correct 127 ms 13920 KB ok, correct split
9 Correct 104 ms 11756 KB ok, correct split
10 Correct 122 ms 16868 KB ok, correct split
11 Correct 107 ms 16740 KB ok, correct split
12 Correct 111 ms 16740 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4972 KB ok, correct split
2 Correct 95 ms 11832 KB ok, correct split
3 Correct 32 ms 8172 KB ok, correct split
4 Correct 4 ms 4972 KB ok, correct split
5 Correct 110 ms 15468 KB ok, correct split
6 Correct 114 ms 15212 KB ok, correct split
7 Correct 120 ms 14976 KB ok, correct split
8 Correct 113 ms 16364 KB ok, correct split
9 Correct 126 ms 14956 KB ok, correct split
10 Correct 26 ms 7660 KB ok, no valid answer
11 Correct 40 ms 9068 KB ok, no valid answer
12 Correct 102 ms 16104 KB ok, no valid answer
13 Correct 97 ms 13420 KB ok, no valid answer
14 Correct 106 ms 17892 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4972 KB ok, correct split
2 Correct 5 ms 5120 KB ok, correct split
3 Correct 3 ms 4972 KB ok, correct split
4 Correct 4 ms 4972 KB ok, correct split
5 Correct 4 ms 4972 KB ok, correct split
6 Correct 4 ms 4972 KB ok, correct split
7 Correct 142 ms 20332 KB ok, correct split
8 Correct 116 ms 18028 KB ok, correct split
9 Correct 118 ms 17260 KB ok, correct split
10 Correct 115 ms 20332 KB ok, correct split
11 Correct 118 ms 19180 KB ok, correct split
12 Correct 3 ms 4972 KB ok, correct split
13 Correct 3 ms 4972 KB ok, correct split
14 Correct 3 ms 4972 KB ok, correct split
15 Correct 111 ms 12900 KB ok, correct split
16 Correct 96 ms 11756 KB ok, correct split
17 Correct 110 ms 19180 KB ok, correct split
18 Correct 114 ms 16620 KB ok, correct split
19 Correct 127 ms 13920 KB ok, correct split
20 Correct 104 ms 11756 KB ok, correct split
21 Correct 122 ms 16868 KB ok, correct split
22 Correct 107 ms 16740 KB ok, correct split
23 Correct 111 ms 16740 KB ok, correct split
24 Correct 4 ms 4972 KB ok, correct split
25 Correct 95 ms 11832 KB ok, correct split
26 Correct 32 ms 8172 KB ok, correct split
27 Correct 4 ms 4972 KB ok, correct split
28 Correct 110 ms 15468 KB ok, correct split
29 Correct 114 ms 15212 KB ok, correct split
30 Correct 120 ms 14976 KB ok, correct split
31 Correct 113 ms 16364 KB ok, correct split
32 Correct 126 ms 14956 KB ok, correct split
33 Correct 26 ms 7660 KB ok, no valid answer
34 Correct 40 ms 9068 KB ok, no valid answer
35 Correct 102 ms 16104 KB ok, no valid answer
36 Correct 97 ms 13420 KB ok, no valid answer
37 Correct 106 ms 17892 KB ok, no valid answer
38 Correct 3 ms 4972 KB ok, correct split
39 Correct 3 ms 4972 KB ok, no valid answer
40 Correct 3 ms 5100 KB ok, correct split
41 Correct 3 ms 4972 KB ok, correct split
42 Correct 3 ms 4972 KB ok, correct split
43 Correct 4 ms 4972 KB ok, correct split
44 Correct 4 ms 4972 KB ok, correct split
45 Correct 4 ms 5116 KB ok, correct split
46 Correct 6 ms 5228 KB ok, correct split
47 Correct 6 ms 5356 KB ok, correct split
48 Correct 4 ms 5100 KB ok, correct split
49 Correct 6 ms 5356 KB ok, correct split
50 Correct 4 ms 4972 KB ok, correct split
51 Correct 4 ms 5100 KB ok, correct split
52 Correct 4 ms 4972 KB ok, correct split
53 Correct 4 ms 4972 KB ok, correct split
54 Correct 4 ms 4972 KB ok, correct split
55 Correct 3 ms 4972 KB ok, correct split
56 Correct 4 ms 5100 KB ok, correct split
57 Correct 4 ms 5100 KB ok, correct split
58 Correct 5 ms 5356 KB ok, correct split
59 Correct 5 ms 5228 KB ok, correct split
60 Correct 5 ms 5356 KB ok, correct split
61 Correct 5 ms 5356 KB ok, correct split
62 Correct 5 ms 5356 KB ok, correct split
63 Correct 6 ms 5356 KB ok, correct split
64 Correct 6 ms 5356 KB ok, correct split
65 Correct 6 ms 5356 KB ok, correct split
66 Correct 4 ms 5100 KB ok, correct split
67 Correct 7 ms 5484 KB ok, correct split
68 Correct 4 ms 5100 KB ok, correct split
69 Correct 4 ms 5100 KB ok, correct split
70 Correct 4 ms 5100 KB ok, correct split
71 Correct 5 ms 5228 KB ok, correct split
72 Correct 5 ms 5228 KB ok, correct split
73 Correct 5 ms 5228 KB ok, correct split
74 Correct 7 ms 5356 KB ok, correct split
75 Correct 7 ms 5356 KB ok, correct split
76 Correct 6 ms 5356 KB ok, correct split
77 Correct 7 ms 5324 KB ok, correct split
78 Correct 5 ms 5228 KB ok, correct split
79 Correct 5 ms 5228 KB ok, correct split
80 Correct 6 ms 5356 KB ok, correct split
81 Correct 6 ms 5356 KB ok, correct split
82 Correct 6 ms 5356 KB ok, correct split
83 Correct 5 ms 5356 KB ok, correct split
84 Correct 5 ms 5356 KB ok, no valid answer
85 Correct 6 ms 5228 KB ok, correct split
86 Correct 5 ms 5228 KB ok, correct split
87 Correct 3 ms 4972 KB ok, no valid answer
88 Correct 4 ms 4992 KB ok, no valid answer
89 Correct 5 ms 5228 KB ok, no valid answer
90 Correct 7 ms 5356 KB ok, no valid answer
91 Correct 5 ms 5356 KB ok, no valid answer
92 Correct 6 ms 5356 KB ok, no valid answer
93 Correct 6 ms 5356 KB ok, no valid answer
94 Correct 103 ms 13672 KB ok, correct split
95 Correct 133 ms 16352 KB ok, correct split
96 Correct 123 ms 15328 KB ok, correct split
97 Correct 32 ms 8172 KB ok, correct split
98 Correct 33 ms 8428 KB ok, correct split
99 Correct 45 ms 9956 KB ok, correct split
100 Correct 123 ms 16628 KB ok, correct split
101 Correct 119 ms 15716 KB ok, correct split
102 Correct 165 ms 18272 KB ok, correct split
103 Correct 144 ms 18224 KB ok, correct split
104 Correct 115 ms 17508 KB ok, correct split
105 Correct 54 ms 10220 KB ok, correct split
106 Correct 120 ms 19032 KB ok, correct split
107 Correct 99 ms 13164 KB ok, correct split
108 Correct 101 ms 12908 KB ok, correct split
109 Correct 132 ms 16096 KB ok, correct split
110 Correct 222 ms 18784 KB ok, correct split
111 Correct 229 ms 18784 KB ok, correct split
112 Correct 216 ms 18912 KB ok, correct split
113 Correct 211 ms 18912 KB ok, correct split
114 Correct 15 ms 6508 KB ok, correct split
115 Correct 15 ms 6380 KB ok, correct split
116 Correct 143 ms 18784 KB ok, correct split
117 Correct 142 ms 18528 KB ok, correct split
118 Correct 106 ms 12908 KB ok, correct split
119 Correct 108 ms 12908 KB ok, correct split
120 Correct 118 ms 15980 KB ok, correct split
121 Correct 98 ms 13036 KB ok, no valid answer
122 Correct 97 ms 13932 KB ok, no valid answer
123 Correct 132 ms 16352 KB ok, no valid answer
124 Correct 133 ms 16608 KB ok, no valid answer
125 Correct 147 ms 18020 KB ok, no valid answer
126 Correct 93 ms 16996 KB ok, no valid answer
127 Correct 185 ms 18148 KB ok, no valid answer