oj.uz

Submission #296147

# Submission time Handle Problem Language Result Execution time Memory
296147 2020-09-10T10:44:59 Z MoNsTeR_CuBe Split the Attractions (IOI19_split) C++17
100 / 100
 268 ms 32616 KB 
#include "split.h"
#include <bits/stdc++.h>

using namespace std;

vector< int > U;
vector< int > unionSize;

int getParents(int a){
	if(U[a] == a) return a;
	else return U[a] = getParents(U[a]);
}

void Union(int a, int b){
	if(getParents(a) == getParents(b)) return;
	unionSize[getParents(b)] += unionSize[getParents(a)];
	U[getParents(a)] = getParents(b);
}

void compute_tree(int root, int last, vector< bool > &visited, vector< vector< int > > &Graph, vector< vector< int > > &Tree, vector< pair<int, int> > &back_edges){
		visited[root] = true;
		for(int a : Graph[root]){
			if(visited[a] && a != last){
				back_edges.push_back({root, a});
				continue;
			}else if(visited[a]) continue;
			Tree[root].push_back(a);
			Tree[a].push_back(root);
			compute_tree(a,root, visited, Graph, Tree, back_edges);
		}
		
}

void compute_subtrees(int root, int last, vector< vector< int > > &Tree, vector< int > &dp){
	//cout << "ROOT " << root << ' ' << last << endl;
	for(int a : Tree[root]){
		if(a == last){
			continue;
		}
		else{
			compute_subtrees(a, root, Tree, dp);
			dp[root] += dp[a];
		}
	}
}

int find_centroid(int root, int last, vector< vector< int > > &Tree, vector< int > &dp, int &n){
	
	for(int a : Tree[root]){
		if(a == last) continue;
		if(dp[a] > n/2){
			return find_centroid(a, root, Tree,dp,n);
		}
	}
	return root;
}

void compute_centroid_graph(int root, vector< vector< int > > &Tree, vector< vector< int > > &centroidGraph,vector< bool > &visitedCentroid, const int &centroid, vector< pair<int, int> > &centroidEdges){
	visitedCentroid[root] = true;
	for(int a : Tree[root]){
		if(visitedCentroid[a]) continue;
		if(a == centroid){
			centroidEdges.push_back({a,root});
			continue;
		}
		//cout << "ROOT " << root << " " << a << endl;
		centroidGraph[a].push_back(root);
		centroidGraph[root].push_back(a);
		compute_centroid_graph(a, Tree, centroidGraph, visitedCentroid, centroid, centroidEdges);
	}
}

int computeSizeSubtree(int root, vector< vector< int > > &centroidGraph, vector< bool > &visitedSubset, const int bigRoot){
	int tot = 1;
	visitedSubset[root] = true;
	Union(root, bigRoot);
	//cout << "SUBTREE " << root << endl;
	//cout << centroidGraph[root].size() << endl;
	for(int a : centroidGraph[root]){
		if(visitedSubset[a]) continue;
		//cout << root << ' ' << a << endl;
		tot += computeSizeSubtree(a, centroidGraph, visitedSubset, bigRoot);
	}
	return tot;
}

void colourGraph(int root, vector< vector< int > > &centroidGraph, vector< bool > &visitedColouring, vector< int > &ans, const int colour, int &total){
	if(total == 0) return;
	visitedColouring[root] = true;
	ans[root] = colour;
	total--;
	//cout << "COLOURING " << root << " in " << colour << endl;
	if(total == 0) return;
	for(int a : centroidGraph[root]){
		if(visitedColouring[a]) continue;
		colourGraph(a, centroidGraph, visitedColouring, ans, colour, total);
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	
	vector< pair<int, int> > sorting = {{a,1},{b,2},{c,3}};
	sort(sorting.begin(), sorting.end());
	a = sorting[0].first;
	b = sorting[1].first;
	c = sorting[2].first;
	
	vector< vector< int > > Graph(n);
	vector< bool > visited(n,false);
	
	for(int i = 0; i < (int)p.size(); i++){
		Graph[p[i]].push_back(q[i]);
		Graph[q[i]].push_back(p[i]);
	}
	
	//TRANSFORM THE GRAPH TO A TREE
	
	vector< vector< int > > Tree(n);
	vector< pair<int, int> > back_edges;
	//cout << "OK" << endl;
	compute_tree(0,-1, visited, Graph, Tree, back_edges);
	//cout << "OK" << endl;
	//for(auto e: back_edges) cout << e.first << ' ' << e.second << endl;
	
	//COMPUTE SIZE OF SUBTREES
	
	vector< int > dp(n, 1);
	compute_subtrees(0,-1,Tree,dp);
	
	//FIND THE CENTROID
	int centroid = find_centroid(0,-1, Tree, dp,n);
	//cout << "CENTROID " << centroid << endl;
	//COMPUTE CENTROID GRAPH
	vector< vector< int > > centroidGraph(n);
	vector< bool > visitedCentroid(n,false);
	
	vector< pair<int, int> > centroidEdges;
	
	for(int i = 0; i < n; i++){
		if(!visitedCentroid[i] && i != centroid){
			compute_centroid_graph(i,Tree, centroidGraph,visitedCentroid, centroid, centroidEdges);
		}
	}
	//COMPUTE SIZE AND ROOT OF EACH SUBSET
	
	U.resize(n);
	unionSize.resize(n,1);
	for(int i = 0; i < n; i++) U[i] = i;
	
	vector< pair<int, int> > sizeAndRootOfSubset;
	vector< bool > visitedSubset(n, false);
	
	for(int i = 0; i < n; i++){
		if(!visitedSubset[i]){
			int size = computeSizeSubtree(i, centroidGraph, visitedSubset, i);
			sizeAndRootOfSubset.push_back({size,i});
			//cout << "SIZE " << size << ' ' << "ROOT " << i << endl;
		}
	}
	//cout << "OK" << endl;
	//CHECK IF ONE OF THEM IS SMALLER THAN A
	sort(sizeAndRootOfSubset.begin(), sizeAndRootOfSubset.end());
	if(sizeAndRootOfSubset.back().second == centroid) swap(sizeAndRootOfSubset.back(),sizeAndRootOfSubset[sizeAndRootOfSubset.size()-2]);
	if(sizeAndRootOfSubset.back().first >= a){
		vector< int > ans(n,-1);
		vector< bool > visitedColouring(n,false);
		colourGraph(sizeAndRootOfSubset.back().second,  centroidGraph, visitedColouring, ans, sorting[0].second, a);
		assert(a == 0);
		//ADD EDGES TO CENTROID
		for(auto e : centroidEdges){
			centroidGraph[e.first].push_back(e.second);
			centroidGraph[e.second].push_back(e.first);
		}
		int left = b;
		//cout << left << endl;
		colourGraph(centroid, centroidGraph, visitedColouring, ans, sorting[1].second, left);
		assert(left == 0);
		//REPLACE ALL -1 by 3
		for(int &A : ans){
			if(A == -1) A=sorting[2].second;
		}
		return ans;
	}
	for(auto e : back_edges){
		if(e.first == centroid || e.second == centroid) continue;
		centroidGraph[e.first].push_back(e.second);
		centroidGraph[e.second].push_back(e.first);
		if(getParents(e.first) == getParents(e.second)){
			continue;
		}
		else{
			Union(e.first, e.second);
			if(unionSize[getParents(e.first)] >= a){
				vector< int > ans(n,-1);
				vector< bool > visitedColouring(n,false);
				colourGraph(getParents(e.first),  centroidGraph, visitedColouring, ans, sorting[0].second, a);
				assert(a==0);
				for(auto E : centroidEdges){
					centroidGraph[E.first].push_back(E.second);
					centroidGraph[E.second].push_back(E.first);
				}
				int left = b;
				colourGraph(centroid, centroidGraph, visitedColouring, ans, sorting[1].second, left);
				assert(left == 0);
				//REPLACE ALL -1 by 3
				for(int &A : ans){
					if(A == -1) A=sorting[2].second;
				}
				return ans;
			}
		}
	}
	vector< int > ans(n);
	return ans;
}

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 0 ms 256 KB ok, correct split
4 Correct 0 ms 256 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 0 ms 384 KB ok, correct split
7 Correct 199 ms 30328 KB ok, correct split
8 Correct 192 ms 27256 KB ok, correct split
9 Correct 193 ms 26232 KB ok, correct split
10 Correct 207 ms 30840 KB ok, correct split
11 Correct 203 ms 30840 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 1 ms 384 KB ok, correct split
3 Correct 1 ms 256 KB ok, correct split
4 Correct 219 ms 26860 KB ok, correct split
5 Correct 161 ms 20216 KB ok, correct split
6 Correct 190 ms 30968 KB ok, correct split
7 Correct 191 ms 27000 KB ok, correct split
8 Correct 235 ms 23472 KB ok, correct split
9 Correct 167 ms 20088 KB ok, correct split
10 Correct 106 ms 22636 KB ok, correct split
11 Correct 113 ms 22636 KB ok, correct split
12 Correct 108 ms 22636 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 168 ms 20216 KB ok, correct split
3 Correct 50 ms 8312 KB ok, correct split
4 Correct 1 ms 256 KB ok, correct split
5 Correct 182 ms 23672 KB ok, correct split
6 Correct 189 ms 23288 KB ok, correct split
7 Correct 187 ms 23032 KB ok, correct split
8 Correct 200 ms 24952 KB ok, correct split
9 Correct 187 ms 22736 KB ok, correct split
10 Correct 42 ms 7040 KB ok, no valid answer
11 Correct 65 ms 10360 KB ok, no valid answer
12 Correct 126 ms 19704 KB ok, no valid answer
13 Correct 162 ms 20216 KB ok, no valid answer
14 Correct 99 ms 19692 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, no valid answer
3 Correct 1 ms 256 KB ok, correct split
4 Correct 1 ms 256 KB ok, correct split
5 Correct 0 ms 256 KB ok, correct split
6 Correct 0 ms 256 KB ok, correct split
7 Correct 0 ms 256 KB ok, correct split
8 Correct 1 ms 256 KB ok, correct split
9 Correct 4 ms 896 KB ok, correct split
10 Correct 4 ms 896 KB ok, correct split
11 Correct 1 ms 384 KB ok, correct split
12 Correct 4 ms 896 KB ok, correct split
13 Correct 0 ms 256 KB ok, correct split
14 Correct 0 ms 256 KB ok, correct split
15 Correct 0 ms 384 KB ok, correct split
16 Correct 1 ms 256 KB ok, correct split
17 Correct 0 ms 256 KB ok, correct split
18 Correct 0 ms 256 KB ok, correct split
19 Correct 1 ms 384 KB ok, correct split
20 Correct 2 ms 640 KB ok, correct split
21 Correct 3 ms 896 KB ok, correct split
22 Correct 4 ms 896 KB ok, correct split
23 Correct 3 ms 896 KB ok, correct split
24 Correct 3 ms 896 KB ok, correct split
25 Correct 3 ms 896 KB ok, correct split
26 Correct 3 ms 1024 KB ok, correct split
27 Correct 4 ms 896 KB ok, correct split
28 Correct 3 ms 896 KB ok, correct split
29 Correct 1 ms 384 KB ok, correct split
30 Correct 3 ms 1024 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 4 ms 896 KB ok, correct split
35 Correct 3 ms 896 KB ok, correct split
36 Correct 3 ms 768 KB ok, correct split
37 Correct 4 ms 896 KB ok, correct split
38 Correct 6 ms 896 KB ok, correct split
39 Correct 4 ms 896 KB ok, correct split
40 Correct 4 ms 896 KB ok, correct split
41 Correct 2 ms 640 KB ok, correct split
42 Correct 2 ms 640 KB ok, correct split
43 Correct 4 ms 964 KB ok, correct split
44 Correct 4 ms 896 KB ok, correct split
45 Correct 4 ms 896 KB ok, correct split
46 Correct 4 ms 896 KB ok, correct split
47 Correct 3 ms 896 KB ok, no valid answer
48 Correct 3 ms 768 KB ok, correct split
49 Correct 4 ms 1024 KB ok, correct split
50 Correct 1 ms 256 KB ok, no valid answer
51 Correct 0 ms 256 KB ok, no valid answer
52 Correct 3 ms 768 KB ok, no valid answer
53 Correct 4 ms 1024 KB ok, no valid answer
54 Correct 3 ms 768 KB ok, no valid answer
55 Correct 3 ms 896 KB ok, no valid answer
56 Correct 4 ms 896 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 0 ms 256 KB ok, correct split
4 Correct 0 ms 256 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 0 ms 384 KB ok, correct split
7 Correct 199 ms 30328 KB ok, correct split
8 Correct 192 ms 27256 KB ok, correct split
9 Correct 193 ms 26232 KB ok, correct split
10 Correct 207 ms 30840 KB ok, correct split
11 Correct 203 ms 30840 KB ok, correct split
12 Correct 0 ms 256 KB ok, correct split
13 Correct 1 ms 384 KB ok, correct split
14 Correct 1 ms 256 KB ok, correct split
15 Correct 219 ms 26860 KB ok, correct split
16 Correct 161 ms 20216 KB ok, correct split
17 Correct 190 ms 30968 KB ok, correct split
18 Correct 191 ms 27000 KB ok, correct split
19 Correct 235 ms 23472 KB ok, correct split
20 Correct 167 ms 20088 KB ok, correct split
21 Correct 106 ms 22636 KB ok, correct split
22 Correct 113 ms 22636 KB ok, correct split
23 Correct 108 ms 22636 KB ok, correct split
24 Correct 0 ms 256 KB ok, correct split
25 Correct 168 ms 20216 KB ok, correct split
26 Correct 50 ms 8312 KB ok, correct split
27 Correct 1 ms 256 KB ok, correct split
28 Correct 182 ms 23672 KB ok, correct split
29 Correct 189 ms 23288 KB ok, correct split
30 Correct 187 ms 23032 KB ok, correct split
31 Correct 200 ms 24952 KB ok, correct split
32 Correct 187 ms 22736 KB ok, correct split
33 Correct 42 ms 7040 KB ok, no valid answer
34 Correct 65 ms 10360 KB ok, no valid answer
35 Correct 126 ms 19704 KB ok, no valid answer
36 Correct 162 ms 20216 KB ok, no valid answer
37 Correct 99 ms 19692 KB ok, no valid answer
38 Correct 1 ms 256 KB ok, correct split
39 Correct 0 ms 256 KB ok, no valid answer
40 Correct 1 ms 256 KB ok, correct split
41 Correct 1 ms 256 KB ok, correct split
42 Correct 0 ms 256 KB ok, correct split
43 Correct 0 ms 256 KB ok, correct split
44 Correct 0 ms 256 KB ok, correct split
45 Correct 1 ms 256 KB ok, correct split
46 Correct 4 ms 896 KB ok, correct split
47 Correct 4 ms 896 KB ok, correct split
48 Correct 1 ms 384 KB ok, correct split
49 Correct 4 ms 896 KB ok, correct split
50 Correct 0 ms 256 KB ok, correct split
51 Correct 0 ms 256 KB ok, correct split
52 Correct 0 ms 384 KB ok, correct split
53 Correct 1 ms 256 KB ok, correct split
54 Correct 0 ms 256 KB ok, correct split
55 Correct 0 ms 256 KB ok, correct split
56 Correct 1 ms 384 KB ok, correct split
57 Correct 2 ms 640 KB ok, correct split
58 Correct 3 ms 896 KB ok, correct split
59 Correct 4 ms 896 KB ok, correct split
60 Correct 3 ms 896 KB ok, correct split
61 Correct 3 ms 896 KB ok, correct split
62 Correct 3 ms 896 KB ok, correct split
63 Correct 3 ms 1024 KB ok, correct split
64 Correct 4 ms 896 KB ok, correct split
65 Correct 3 ms 896 KB ok, correct split
66 Correct 1 ms 384 KB ok, correct split
67 Correct 3 ms 1024 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 4 ms 896 KB ok, correct split
72 Correct 3 ms 896 KB ok, correct split
73 Correct 3 ms 768 KB ok, correct split
74 Correct 4 ms 896 KB ok, correct split
75 Correct 6 ms 896 KB ok, correct split
76 Correct 4 ms 896 KB ok, correct split
77 Correct 4 ms 896 KB ok, correct split
78 Correct 2 ms 640 KB ok, correct split
79 Correct 2 ms 640 KB ok, correct split
80 Correct 4 ms 964 KB ok, correct split
81 Correct 4 ms 896 KB ok, correct split
82 Correct 4 ms 896 KB ok, correct split
83 Correct 4 ms 896 KB ok, correct split
84 Correct 3 ms 896 KB ok, no valid answer
85 Correct 3 ms 768 KB ok, correct split
86 Correct 4 ms 1024 KB ok, correct split
87 Correct 1 ms 256 KB ok, no valid answer
88 Correct 0 ms 256 KB ok, no valid answer
89 Correct 3 ms 768 KB ok, no valid answer
90 Correct 4 ms 1024 KB ok, no valid answer
91 Correct 3 ms 768 KB ok, no valid answer
92 Correct 3 ms 896 KB ok, no valid answer
93 Correct 4 ms 896 KB ok, no valid answer
94 Correct 200 ms 25532 KB ok, correct split
95 Correct 258 ms 32616 KB ok, correct split
96 Correct 233 ms 30316 KB ok, correct split
97 Correct 49 ms 8824 KB ok, correct split
98 Correct 54 ms 9116 KB ok, correct split
99 Correct 72 ms 11496 KB ok, correct split
100 Correct 231 ms 26616 KB ok, correct split
101 Correct 218 ms 25192 KB ok, correct split
102 Correct 194 ms 25576 KB ok, correct split
103 Correct 186 ms 25580 KB ok, correct split
104 Correct 196 ms 27112 KB ok, correct split
105 Correct 88 ms 13432 KB ok, correct split
106 Correct 175 ms 28748 KB ok, correct split
107 Correct 165 ms 21496 KB ok, correct split
108 Correct 164 ms 21368 KB ok, correct split
109 Correct 246 ms 26344 KB ok, correct split
110 Correct 214 ms 26220 KB ok, correct split
111 Correct 266 ms 26220 KB ok, correct split
112 Correct 220 ms 26600 KB ok, correct split
113 Correct 234 ms 26740 KB ok, correct split
114 Correct 17 ms 3324 KB ok, correct split
115 Correct 15 ms 3068 KB ok, correct split
116 Correct 211 ms 25952 KB ok, correct split
117 Correct 208 ms 25576 KB ok, correct split
118 Correct 171 ms 21244 KB ok, correct split
119 Correct 166 ms 21240 KB ok, correct split
120 Correct 216 ms 26872 KB ok, correct split
121 Correct 158 ms 21496 KB ok, no valid answer
122 Correct 148 ms 21492 KB ok, no valid answer
123 Correct 264 ms 29036 KB ok, no valid answer
124 Correct 268 ms 28788 KB ok, no valid answer
125 Correct 149 ms 23020 KB ok, no valid answer
126 Correct 94 ms 18796 KB ok, no valid answer
127 Correct 169 ms 24684 KB ok, no valid answer