oj.uz

Submission #189348

# Submission time Handle Problem Language Result Execution time Memory
189348 2020-01-14T02:02:51 Z kig9981 Split the Attractions (IOI19_split) C++17
100 / 100
 269 ms 23960 KB 
#include "split.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> adj[100000], tree[100000], ans;
int node_cnt, num[100000], low[100000], cnt[100000], parent[100000], G[100000];

void dfs(int c)
{
	num[c]=low[c]=++node_cnt;
	cnt[c]=1;
	for(auto n: adj[c]) {
		if(num[n]==0) {
			parent[n]=c;
			tree[n].push_back(c);
			tree[c].push_back(n);
			dfs(n);
			low[c]=min(low[c],low[n]);
			cnt[c]+=cnt[n];
		}
		else if(n!=parent[c]) low[c]=min(low[c],num[n]);
	}
}

int centroid(int c)
{
	for(auto n: tree[c]) if(parent[n]==c && 2*cnt[n]>cnt[0]) return centroid(n);
	return c;
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
	vector<pair<int,int>> V;
	queue<int> Q;
	int tot=0; ans.clear();
	for(int i=node_cnt=0;i<n;i++) {
		num[i]=0;
		G[i]=-1;
		adj[i].clear();
		tree[i].clear();
	}
	V.emplace_back(a,1);
	V.emplace_back(b,2);
	V.emplace_back(c,3);
	sort(V.begin(),V.end());
	for(int i=0;i<p.size();i++) {
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	dfs(0);
	c=centroid(0);
	ans.resize(n);
	for(auto n: tree[c]) {
		if(parent[n]==c && cnt[n]>=V[1].first || parent[c]==n && cnt[0]-cnt[c]>=V[1].first) {
			ans[n]=V[1].second;
			ans[c]=V[0].second;
			Q.push(n);
			V[1].first--;
			V[0].first--;
			while(!Q.empty() && V[1].first) {
				int c=Q.front();
				Q.pop();
				for(auto n: tree[c]) if(ans[n]==0 && V[1].first) {
					ans[n]=ans[c];
					V[1].first--;
					Q.push(n);
				}
			}
			while(Q.size()) Q.pop();
			Q.push(c);
			while(!Q.empty() && V[0].first) {
				int c=Q.front();
				Q.pop();
				for(auto n: adj[c]) if(ans[n]==0 && V[0].first) {
					ans[n]=ans[c];
					V[0].first--;
					Q.push(n);
				}
			}
			for(auto &v: ans) if(v==0) v=V[2].second;
			return ans;
		}
		else if(parent[n]==c && cnt[n]>=V[0].first || parent[c]==n && cnt[0]-cnt[c]>=V[0].first) {
			ans[n]=V[0].second;
			ans[c]=V[1].second;
			V[1].first--;
			V[0].first--;
			Q.push(n);
			while(!Q.empty() && V[0].first) {
				int c=Q.front();
				Q.pop();
				for(auto n: tree[c]) if(ans[n]==0 && V[0].first) {
					ans[n]=ans[c];
					V[0].first--;
					Q.push(n);
				}
			}
			while(Q.size()) Q.pop();
			Q.push(c);
			while(!Q.empty() && V[1].first) {
				int c=Q.front();
				Q.pop();
				for(auto n: adj[c]) if(ans[n]==0 && V[1].first) {
					ans[n]=ans[c];
					V[1].first--;
					Q.push(n);
				}
			}
			for(auto &v: ans) if(v==0) v=V[2].second;
			return ans;
		}
	}
	G[c]=0;
	G[parent[c]]=1;
	Q.push(parent[c]);
	while(!Q.empty()) {
		int c=Q.front();
		Q.pop();
		for(auto n: tree[c]) if(G[n]==-1) {
			G[n]=G[c];
			Q.push(n);
		}
	}
	tot=n-cnt[c];
	for(auto n: tree[c]) if(parent[n]==c && low[n]<num[c]) {
		G[n]=1;
		Q.push(n);
		while(!Q.empty()) {
			int c=Q.front();
			Q.pop();
			for(auto n: tree[c]) if(G[n]==-1) {
				G[n]=G[c];
				Q.push(n);
			}
		}
		if((tot+=cnt[n])>=V[0].first) {
			ans[parent[c]]=V[0].second;
			ans[c]=V[1].second;
			V[1].first--;
			V[0].first--;
			Q.push(parent[c]);
			while(!Q.empty() && V[0].first) {
				int c=Q.front();
				Q.pop();
				for(auto n: adj[c]) if(G[n]==G[c] && ans[n]==0 && V[0].first) {
					ans[n]=ans[c];
					V[0].first--;
					Q.push(n);
				}
			}
			while(Q.size()) Q.pop();
			Q.push(c);
			while(!Q.empty() && V[1].first) {
				int c=Q.front();
				Q.pop();
				for(auto n: adj[c]) if(ans[n]==0 && V[1].first) {
					ans[n]=ans[c];
					V[1].first--;
					Q.push(n);
				}
			}
			for(auto &v: ans) if(v==0) v=V[2].second;
			return ans;
		}
	}
	return ans;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:47:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<p.size();i++) {
              ~^~~~~~~~~
split.cpp:55:19: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   if(parent[n]==c && cnt[n]>=V[1].first || parent[c]==n && cnt[0]-cnt[c]>=V[1].first) {
      ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
split.cpp:84:24: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   else if(parent[n]==c && cnt[n]>=V[0].first || parent[c]==n && cnt[0]-cnt[c]>=V[0].first) {
           ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4984 KB ok, correct split
2 Correct 8 ms 4984 KB ok, correct split
3 Correct 8 ms 4984 KB ok, correct split
4 Correct 7 ms 5064 KB ok, correct split
5 Correct 9 ms 5112 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 213 ms 23032 KB ok, correct split
8 Correct 139 ms 20856 KB ok, correct split
9 Correct 145 ms 20392 KB ok, correct split
10 Correct 149 ms 23116 KB ok, correct split
11 Correct 220 ms 23032 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4984 KB ok, correct split
2 Correct 5 ms 5112 KB ok, correct split
3 Correct 6 ms 4984 KB ok, correct split
4 Correct 202 ms 21280 KB ok, correct split
5 Correct 143 ms 17144 KB ok, correct split
6 Correct 195 ms 23168 KB ok, correct split
7 Correct 219 ms 20732 KB ok, correct split
8 Correct 182 ms 19832 KB ok, correct split
9 Correct 134 ms 16760 KB ok, correct split
10 Correct 101 ms 17392 KB ok, correct split
11 Correct 100 ms 17392 KB ok, correct split
12 Correct 116 ms 17776 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB ok, correct split
2 Correct 189 ms 17016 KB ok, correct split
3 Correct 44 ms 10104 KB ok, correct split
4 Correct 6 ms 4984 KB ok, correct split
5 Correct 146 ms 18932 KB ok, correct split
6 Correct 157 ms 18780 KB ok, correct split
7 Correct 151 ms 18692 KB ok, correct split
8 Correct 195 ms 19736 KB ok, correct split
9 Correct 181 ms 18508 KB ok, correct split
10 Correct 38 ms 9080 KB ok, no valid answer
11 Correct 54 ms 11132 KB ok, no valid answer
12 Correct 117 ms 17268 KB ok, no valid answer
13 Correct 133 ms 17016 KB ok, no valid answer
14 Correct 103 ms 17524 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB ok, correct split
2 Correct 11 ms 5112 KB ok, no valid answer
3 Correct 7 ms 4988 KB ok, correct split
4 Correct 6 ms 4984 KB ok, correct split
5 Correct 7 ms 4984 KB ok, correct split
6 Correct 4 ms 5240 KB ok, correct split
7 Correct 8 ms 5220 KB ok, correct split
8 Correct 8 ms 4984 KB ok, correct split
9 Correct 10 ms 5496 KB ok, correct split
10 Correct 9 ms 5368 KB ok, correct split
11 Correct 9 ms 4984 KB ok, correct split
12 Correct 9 ms 5496 KB ok, correct split
13 Correct 7 ms 5112 KB ok, correct split
14 Correct 6 ms 4984 KB ok, correct split
15 Correct 6 ms 4984 KB ok, correct split
16 Correct 6 ms 4984 KB ok, correct split
17 Correct 6 ms 4984 KB ok, correct split
18 Correct 6 ms 5112 KB ok, correct split
19 Correct 4 ms 4984 KB ok, correct split
20 Correct 7 ms 5112 KB ok, correct split
21 Correct 10 ms 5500 KB ok, correct split
22 Correct 9 ms 5368 KB ok, correct split
23 Correct 10 ms 5372 KB ok, correct split
24 Correct 8 ms 5344 KB ok, correct split
25 Correct 10 ms 5372 KB ok, correct split
26 Correct 9 ms 5368 KB ok, correct split
27 Correct 9 ms 5372 KB ok, correct split
28 Correct 9 ms 5368 KB ok, correct split
29 Correct 8 ms 5112 KB ok, correct split
30 Correct 9 ms 5752 KB ok, correct split
31 Correct 7 ms 5116 KB ok, correct split
32 Correct 6 ms 5112 KB ok, correct split
33 Correct 13 ms 5240 KB ok, correct split
34 Correct 6 ms 5496 KB ok, correct split
35 Correct 9 ms 5368 KB ok, correct split
36 Correct 8 ms 5368 KB ok, correct split
37 Correct 8 ms 5368 KB ok, correct split
38 Correct 10 ms 5368 KB ok, correct split
39 Correct 9 ms 5368 KB ok, correct split
40 Correct 10 ms 5368 KB ok, correct split
41 Correct 9 ms 5240 KB ok, correct split
42 Correct 10 ms 5240 KB ok, correct split
43 Correct 1 ms 5496 KB ok, correct split
44 Correct 12 ms 5532 KB ok, correct split
45 Correct 9 ms 5368 KB ok, correct split
46 Correct 9 ms 5496 KB ok, correct split
47 Correct 13 ms 5496 KB ok, no valid answer
48 Correct 10 ms 5584 KB ok, correct split
49 Correct 11 ms 5368 KB ok, correct split
50 Correct 7 ms 5112 KB ok, no valid answer
51 Correct 7 ms 5112 KB ok, no valid answer
52 Correct 10 ms 5368 KB ok, no valid answer
53 Correct 13 ms 5496 KB ok, no valid answer
54 Correct 10 ms 5368 KB ok, no valid answer
55 Correct 10 ms 5368 KB ok, no valid answer
56 Correct 10 ms 5368 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4984 KB ok, correct split
2 Correct 8 ms 4984 KB ok, correct split
3 Correct 8 ms 4984 KB ok, correct split
4 Correct 7 ms 5064 KB ok, correct split
5 Correct 9 ms 5112 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 213 ms 23032 KB ok, correct split
8 Correct 139 ms 20856 KB ok, correct split
9 Correct 145 ms 20392 KB ok, correct split
10 Correct 149 ms 23116 KB ok, correct split
11 Correct 220 ms 23032 KB ok, correct split
12 Correct 4 ms 4984 KB ok, correct split
13 Correct 5 ms 5112 KB ok, correct split
14 Correct 6 ms 4984 KB ok, correct split
15 Correct 202 ms 21280 KB ok, correct split
16 Correct 143 ms 17144 KB ok, correct split
17 Correct 195 ms 23168 KB ok, correct split
18 Correct 219 ms 20732 KB ok, correct split
19 Correct 182 ms 19832 KB ok, correct split
20 Correct 134 ms 16760 KB ok, correct split
21 Correct 101 ms 17392 KB ok, correct split
22 Correct 100 ms 17392 KB ok, correct split
23 Correct 116 ms 17776 KB ok, correct split
24 Correct 8 ms 4984 KB ok, correct split
25 Correct 189 ms 17016 KB ok, correct split
26 Correct 44 ms 10104 KB ok, correct split
27 Correct 6 ms 4984 KB ok, correct split
28 Correct 146 ms 18932 KB ok, correct split
29 Correct 157 ms 18780 KB ok, correct split
30 Correct 151 ms 18692 KB ok, correct split
31 Correct 195 ms 19736 KB ok, correct split
32 Correct 181 ms 18508 KB ok, correct split
33 Correct 38 ms 9080 KB ok, no valid answer
34 Correct 54 ms 11132 KB ok, no valid answer
35 Correct 117 ms 17268 KB ok, no valid answer
36 Correct 133 ms 17016 KB ok, no valid answer
37 Correct 103 ms 17524 KB ok, no valid answer
38 Correct 6 ms 4984 KB ok, correct split
39 Correct 11 ms 5112 KB ok, no valid answer
40 Correct 7 ms 4988 KB ok, correct split
41 Correct 6 ms 4984 KB ok, correct split
42 Correct 7 ms 4984 KB ok, correct split
43 Correct 4 ms 5240 KB ok, correct split
44 Correct 8 ms 5220 KB ok, correct split
45 Correct 8 ms 4984 KB ok, correct split
46 Correct 10 ms 5496 KB ok, correct split
47 Correct 9 ms 5368 KB ok, correct split
48 Correct 9 ms 4984 KB ok, correct split
49 Correct 9 ms 5496 KB ok, correct split
50 Correct 7 ms 5112 KB ok, correct split
51 Correct 6 ms 4984 KB ok, correct split
52 Correct 6 ms 4984 KB ok, correct split
53 Correct 6 ms 4984 KB ok, correct split
54 Correct 6 ms 4984 KB ok, correct split
55 Correct 6 ms 5112 KB ok, correct split
56 Correct 4 ms 4984 KB ok, correct split
57 Correct 7 ms 5112 KB ok, correct split
58 Correct 10 ms 5500 KB ok, correct split
59 Correct 9 ms 5368 KB ok, correct split
60 Correct 10 ms 5372 KB ok, correct split
61 Correct 8 ms 5344 KB ok, correct split
62 Correct 10 ms 5372 KB ok, correct split
63 Correct 9 ms 5368 KB ok, correct split
64 Correct 9 ms 5372 KB ok, correct split
65 Correct 9 ms 5368 KB ok, correct split
66 Correct 8 ms 5112 KB ok, correct split
67 Correct 9 ms 5752 KB ok, correct split
68 Correct 7 ms 5116 KB ok, correct split
69 Correct 6 ms 5112 KB ok, correct split
70 Correct 13 ms 5240 KB ok, correct split
71 Correct 6 ms 5496 KB ok, correct split
72 Correct 9 ms 5368 KB ok, correct split
73 Correct 8 ms 5368 KB ok, correct split
74 Correct 8 ms 5368 KB ok, correct split
75 Correct 10 ms 5368 KB ok, correct split
76 Correct 9 ms 5368 KB ok, correct split
77 Correct 10 ms 5368 KB ok, correct split
78 Correct 9 ms 5240 KB ok, correct split
79 Correct 10 ms 5240 KB ok, correct split
80 Correct 1 ms 5496 KB ok, correct split
81 Correct 12 ms 5532 KB ok, correct split
82 Correct 9 ms 5368 KB ok, correct split
83 Correct 9 ms 5496 KB ok, correct split
84 Correct 13 ms 5496 KB ok, no valid answer
85 Correct 10 ms 5584 KB ok, correct split
86 Correct 11 ms 5368 KB ok, correct split
87 Correct 7 ms 5112 KB ok, no valid answer
88 Correct 7 ms 5112 KB ok, no valid answer
89 Correct 10 ms 5368 KB ok, no valid answer
90 Correct 13 ms 5496 KB ok, no valid answer
91 Correct 10 ms 5368 KB ok, no valid answer
92 Correct 10 ms 5368 KB ok, no valid answer
93 Correct 10 ms 5368 KB ok, no valid answer
94 Correct 227 ms 19356 KB ok, correct split
95 Correct 229 ms 23960 KB ok, correct split
96 Correct 191 ms 22392 KB ok, correct split
97 Correct 55 ms 9848 KB ok, correct split
98 Correct 62 ms 10108 KB ok, correct split
99 Correct 91 ms 11980 KB ok, correct split
100 Correct 259 ms 20468 KB ok, correct split
101 Correct 171 ms 19424 KB ok, correct split
102 Correct 233 ms 19260 KB ok, correct split
103 Correct 152 ms 19172 KB ok, correct split
104 Correct 165 ms 20824 KB ok, correct split
105 Correct 81 ms 12536 KB ok, correct split
106 Correct 176 ms 21036 KB ok, correct split
107 Correct 139 ms 17040 KB ok, correct split
108 Correct 197 ms 17200 KB ok, correct split
109 Correct 193 ms 20064 KB ok, correct split
110 Correct 193 ms 20080 KB ok, correct split
111 Correct 181 ms 20124 KB ok, correct split
112 Correct 198 ms 20376 KB ok, correct split
113 Correct 178 ms 20336 KB ok, correct split
114 Correct 20 ms 6904 KB ok, correct split
115 Correct 20 ms 6648 KB ok, correct split
116 Correct 177 ms 19928 KB ok, correct split
117 Correct 227 ms 19844 KB ok, correct split
118 Correct 141 ms 16876 KB ok, correct split
119 Correct 139 ms 16744 KB ok, correct split
120 Correct 168 ms 20140 KB ok, correct split
121 Correct 186 ms 16948 KB ok, no valid answer
122 Correct 160 ms 17204 KB ok, no valid answer
123 Correct 269 ms 20600 KB ok, no valid answer
124 Correct 208 ms 20528 KB ok, no valid answer
125 Correct 127 ms 18320 KB ok, no valid answer
126 Correct 79 ms 16340 KB ok, no valid answer
127 Correct 151 ms 18720 KB ok, no valid answer