oj.uz

Submission #167793

# Submission time Handle Problem Language Result Execution time Memory
167793 2019-12-10T07:01:50 Z oolimry Split the Attractions (IOI19_split) C++14
40 / 100
 197 ms 27000 KB 
#include "split.h"
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> ii;

static vi answer;
static vi adj[100005];
static vi child[100005];
static vi tree[100005];
static int sz[100005];
static int p[100005];
static bool vis[100005];

void dfs(int u){
	vis[u] = true;
	sz[u] = 1;
	for(int v : adj[u]){
		if(!vis[v]){
			child[u].push_back(v);
			tree[u].push_back(v);
			tree[v].push_back(u);
			p[v] = u;
			dfs(v);
			sz[u] += sz[v];
		}	
	}
}

void bfs(int root, int number){
	if(number == 0) return;
	queue<int> bf;
	bf.push(root);
	while(!bf.empty()){
		int u = bf.front(); bf.pop();
		for(int v : tree[u]){
			if(answer[v] == 0){
				answer[v] = answer[u];
				number--;
				if(number == 0) return;
				bf.push(v);
			}
		}
	}
}
vi find_split(int n, int aaa, int bbb, int ccc, vi p, vi q) {
	vector<ii> v = {ii(aaa,1),ii(bbb,2),ii(ccc,3)};
	sort(v.begin(),v.end());
	int A = v[0].first;
	int B = v[1].first;
	int AColour = v[0].second;
	int BColour = v[1].second;
	int CColour = v[2].second;
	
	answer.assign(n,0);
	
	for(int i = 0;i < (int) p.size();i++){
		int x = p[i], y = q[i];
		adj[y].push_back(x);
		adj[x].push_back(y);
	}
	
	dfs(0);
	/*
	for(int u = 0;u < n;u++){
		vector<ii> subtrees;
		for(int v : child[u]){
			subtrees.push_back({sz[v],v});
		}
		subtrees.push_back({n - sz[u],p[u]});
		
		for(ii x : subtrees){
			if(x.first >= A && n - x.first >= B){
				//cout << x.second << " " << u << "\n";
				answer[x.second] = AColour;
				answer[u] = BColour;
				bfs(x.second, A-1);
				bfs(u,B-1);
				for(int i = 0;i < n;i++){
					if(answer[i] == 0) answer[i] = CColour;
				}
				return answer;
			}
		}
	}
	*/
	
	for(int i = 0;i < (int) p.size();i++){
		int x = p[i], y = q[i];
		if(sz[y] < sz[x]) swap(x,y); ///x is child of y
		
		int l = sz[x], r = n - sz[x];
		if(l > r) swap(l,r), swap(x,y);
		
		if(l >= A && r >= B){
			answer[x] = AColour;
			answer[y] = BColour;
			bfs(x,A-1);
			bfs(y,B-1);
			for(int i = 0;i < n;i++){
				if(answer[i] == 0) answer[i] = CColour;
			}
			return answer;
		}
	}
	
	return answer;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 8 ms 7416 KB ok, correct split
4 Correct 8 ms 7416 KB ok, correct split
5 Correct 8 ms 7416 KB ok, correct split
6 Correct 8 ms 7416 KB ok, correct split
7 Correct 158 ms 25592 KB ok, correct split
8 Correct 145 ms 24952 KB ok, correct split
9 Correct 147 ms 24440 KB ok, correct split
10 Correct 143 ms 26972 KB ok, correct split
11 Correct 140 ms 27000 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 8 ms 7420 KB ok, correct split
4 Correct 152 ms 22604 KB ok, correct split
5 Correct 126 ms 18424 KB ok, correct split
6 Correct 139 ms 25872 KB ok, correct split
7 Correct 153 ms 23544 KB ok, correct split
8 Correct 159 ms 20856 KB ok, correct split
9 Correct 142 ms 19704 KB ok, correct split
10 Correct 84 ms 17904 KB ok, correct split
11 Correct 91 ms 17900 KB ok, correct split
12 Correct 88 ms 17888 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 129 ms 18448 KB ok, correct split
3 Correct 45 ms 12408 KB ok, correct split
4 Correct 8 ms 7416 KB ok, correct split
5 Correct 134 ms 22904 KB ok, correct split
6 Correct 134 ms 22648 KB ok, correct split
7 Correct 130 ms 22520 KB ok, correct split
8 Correct 197 ms 23516 KB ok, correct split
9 Correct 142 ms 22392 KB ok, correct split
10 Correct 39 ms 11384 KB ok, no valid answer
11 Correct 72 ms 13432 KB ok, no valid answer
12 Correct 99 ms 19060 KB ok, no valid answer
13 Correct 122 ms 19448 KB ok, no valid answer
14 Correct 93 ms 18920 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, no valid answer
3 Correct 8 ms 7420 KB ok, correct split
4 Correct 8 ms 7416 KB ok, correct split
5 Correct 9 ms 7420 KB ok, correct split
6 Correct 10 ms 7416 KB ok, correct split
7 Correct 10 ms 7416 KB ok, correct split
8 Correct 10 ms 7416 KB ok, correct split
9 Correct 12 ms 7804 KB ok, correct split
10 Correct 11 ms 7800 KB ok, correct split
11 Correct 8 ms 7416 KB ok, correct split
12 Correct 11 ms 7672 KB ok, correct split
13 Correct 8 ms 7416 KB ok, correct split
14 Correct 8 ms 7416 KB ok, correct split
15 Correct 8 ms 7416 KB ok, correct split
16 Correct 8 ms 7416 KB ok, correct split
17 Correct 8 ms 7416 KB ok, correct split
18 Correct 8 ms 7416 KB ok, correct split
19 Correct 8 ms 7416 KB ok, correct split
20 Correct 9 ms 7544 KB ok, correct split
21 Correct 10 ms 7800 KB ok, correct split
22 Correct 10 ms 7672 KB ok, correct split
23 Correct 10 ms 7800 KB ok, correct split
24 Correct 10 ms 7800 KB ok, correct split
25 Correct 10 ms 7800 KB ok, correct split
26 Incorrect 10 ms 7672 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 8 ms 7416 KB ok, correct split
4 Correct 8 ms 7416 KB ok, correct split
5 Correct 8 ms 7416 KB ok, correct split
6 Correct 8 ms 7416 KB ok, correct split
7 Correct 158 ms 25592 KB ok, correct split
8 Correct 145 ms 24952 KB ok, correct split
9 Correct 147 ms 24440 KB ok, correct split
10 Correct 143 ms 26972 KB ok, correct split
11 Correct 140 ms 27000 KB ok, correct split
12 Correct 8 ms 7416 KB ok, correct split
13 Correct 8 ms 7416 KB ok, correct split
14 Correct 8 ms 7420 KB ok, correct split
15 Correct 152 ms 22604 KB ok, correct split
16 Correct 126 ms 18424 KB ok, correct split
17 Correct 139 ms 25872 KB ok, correct split
18 Correct 153 ms 23544 KB ok, correct split
19 Correct 159 ms 20856 KB ok, correct split
20 Correct 142 ms 19704 KB ok, correct split
21 Correct 84 ms 17904 KB ok, correct split
22 Correct 91 ms 17900 KB ok, correct split
23 Correct 88 ms 17888 KB ok, correct split
24 Correct 8 ms 7416 KB ok, correct split
25 Correct 129 ms 18448 KB ok, correct split
26 Correct 45 ms 12408 KB ok, correct split
27 Correct 8 ms 7416 KB ok, correct split
28 Correct 134 ms 22904 KB ok, correct split
29 Correct 134 ms 22648 KB ok, correct split
30 Correct 130 ms 22520 KB ok, correct split
31 Correct 197 ms 23516 KB ok, correct split
32 Correct 142 ms 22392 KB ok, correct split
33 Correct 39 ms 11384 KB ok, no valid answer
34 Correct 72 ms 13432 KB ok, no valid answer
35 Correct 99 ms 19060 KB ok, no valid answer
36 Correct 122 ms 19448 KB ok, no valid answer
37 Correct 93 ms 18920 KB ok, no valid answer
38 Correct 8 ms 7416 KB ok, correct split
39 Correct 8 ms 7416 KB ok, no valid answer
40 Correct 8 ms 7420 KB ok, correct split
41 Correct 8 ms 7416 KB ok, correct split
42 Correct 9 ms 7420 KB ok, correct split
43 Correct 10 ms 7416 KB ok, correct split
44 Correct 10 ms 7416 KB ok, correct split
45 Correct 10 ms 7416 KB ok, correct split
46 Correct 12 ms 7804 KB ok, correct split
47 Correct 11 ms 7800 KB ok, correct split
48 Correct 8 ms 7416 KB ok, correct split
49 Correct 11 ms 7672 KB ok, correct split
50 Correct 8 ms 7416 KB ok, correct split
51 Correct 8 ms 7416 KB ok, correct split
52 Correct 8 ms 7416 KB ok, correct split
53 Correct 8 ms 7416 KB ok, correct split
54 Correct 8 ms 7416 KB ok, correct split
55 Correct 8 ms 7416 KB ok, correct split
56 Correct 8 ms 7416 KB ok, correct split
57 Correct 9 ms 7544 KB ok, correct split
58 Correct 10 ms 7800 KB ok, correct split
59 Correct 10 ms 7672 KB ok, correct split
60 Correct 10 ms 7800 KB ok, correct split
61 Correct 10 ms 7800 KB ok, correct split
62 Correct 10 ms 7800 KB ok, correct split
63 Incorrect 10 ms 7672 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -