oj.uz

Submission #167802

# Submission time Handle Problem Language Result Execution time Memory
167802 2019-12-10T07:57:13 Z oolimry Split the Attractions (IOI19_split) C++14
100 / 100
 226 ms 27512 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 pa[100005];
static bool vis[100005];

class UFDS {
public:
    vi p, rak, setSize;
    int numSets;

    void create(int n){
        setSize.assign(n, 1);
        numSets = n;
        rak.assign(n, 0);
        p.assign(n, 0);
        for(int i =0;i < n;i++){
            p[i] = i;
        }
    }

    int findSet(int i){
        return (p[i] == i) ? i : (p[i] = findSet(p[i]));
    }

    bool isSameSet(int i, int j){
        return findSet(i) == findSet(j);
    }

    int unionSet(int i, int j){
        if(isSameSet(i,j))
            return 0;
        numSets--;
        int x = findSet(i);
        int y = findSet(j);

        if(rak[x] > rak[y]) {
            p[y] = x; setSize[x] += setSize[y];
        }

        else {
            p[x] = y; setSize[y] += setSize[x];
            if(rak[x] == rak[y]) rak[y]++;
        }
		return max(setSize[x],setSize[y]);
    }
};

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);
			pa[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) {
	
	///WLOG, let A <= B <= C.
	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 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;
		}
	}
	
	int R = -1;
	for(int u = 0;u < n;u++){
		bool can = true;
		for(int v : child[u]){
			if(sz[v] >= A){
				can = false;
				break;
			}
		}
		if(n - sz[u] >= A) can = false;
		if(can){
			R = u;
			break;
		}
	}
	
	assert(R != -1);
	
	UFDS uf;
	uf.create(n);
	for(int i = 0;i < (int) p.size();i++){
		int u = p[i]; int v = q[i];
		if(u == R || v == R) continue;
		if(pa[u] == v || pa[v] == u){
			uf.unionSet(u,v);
		}
	}

	for(int i = 0;i < (int) p.size();i++){
		int u = p[i]; int v = q[i];
		if(u == R || v == R) continue;
		if(pa[u] == v || pa[v] == u) continue;
			
		tree[u].push_back(v);
		tree[v].push_back(u);
		if(uf.unionSet(u,v) >= A){
			int x = u;
			int y = R;
			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 7292 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 163 ms 26104 KB ok, correct split
8 Correct 144 ms 24184 KB ok, correct split
9 Correct 145 ms 23672 KB ok, correct split
10 Correct 142 ms 26292 KB ok, correct split
11 Correct 154 ms 26232 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7288 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 8 ms 7288 KB ok, correct split
4 Correct 176 ms 22976 KB ok, correct split
5 Correct 153 ms 18808 KB ok, correct split
6 Correct 142 ms 26396 KB ok, correct split
7 Correct 154 ms 24048 KB ok, correct split
8 Correct 181 ms 21240 KB ok, correct split
9 Correct 138 ms 20092 KB ok, correct split
10 Correct 90 ms 18288 KB ok, correct split
11 Correct 90 ms 18292 KB ok, correct split
12 Correct 96 ms 18204 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7288 KB ok, correct split
2 Correct 125 ms 18708 KB ok, correct split
3 Correct 56 ms 12024 KB ok, correct split
4 Correct 10 ms 7416 KB ok, correct split
5 Correct 150 ms 22136 KB ok, correct split
6 Correct 196 ms 21880 KB ok, correct split
7 Correct 144 ms 22008 KB ok, correct split
8 Correct 156 ms 22748 KB ok, correct split
9 Correct 148 ms 21624 KB ok, correct split
10 Correct 42 ms 11516 KB ok, no valid answer
11 Correct 64 ms 13688 KB ok, no valid answer
12 Correct 115 ms 19572 KB ok, no valid answer
13 Correct 141 ms 19804 KB ok, no valid answer
14 Correct 97 ms 19184 KB ok, no valid answer

Subtask #4
24.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 7288 KB ok, correct split
4 Correct 8 ms 7292 KB ok, correct split
5 Correct 8 ms 7288 KB ok, correct split
6 Correct 8 ms 7416 KB ok, correct split
7 Correct 9 ms 7332 KB ok, correct split
8 Correct 8 ms 7416 KB ok, correct split
9 Correct 11 ms 7672 KB ok, correct split
10 Correct 11 ms 7672 KB ok, correct split
11 Correct 9 ms 7544 KB ok, correct split
12 Correct 11 ms 7672 KB ok, correct split
13 Correct 9 ms 7416 KB ok, correct split
14 Correct 9 ms 7416 KB ok, correct split
15 Correct 8 ms 7416 KB ok, correct split
16 Correct 9 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 10 ms 7416 KB ok, correct split
20 Correct 9 ms 7544 KB ok, correct split
21 Correct 10 ms 7676 KB ok, correct split
22 Correct 12 ms 7800 KB ok, correct split
23 Correct 12 ms 7800 KB ok, correct split
24 Correct 10 ms 7800 KB ok, correct split
25 Correct 12 ms 7672 KB ok, correct split
26 Correct 13 ms 7800 KB ok, correct split
27 Correct 13 ms 7800 KB ok, correct split
28 Correct 13 ms 7800 KB ok, correct split
29 Correct 10 ms 7416 KB ok, correct split
30 Correct 13 ms 7672 KB ok, correct split
31 Correct 11 ms 7544 KB ok, correct split
32 Correct 10 ms 7416 KB ok, correct split
33 Correct 8 ms 7416 KB ok, correct split
34 Correct 11 ms 7800 KB ok, correct split
35 Correct 11 ms 7672 KB ok, correct split
36 Correct 10 ms 7672 KB ok, correct split
37 Correct 12 ms 7800 KB ok, correct split
38 Correct 12 ms 7928 KB ok, correct split
39 Correct 11 ms 7800 KB ok, correct split
40 Correct 12 ms 7800 KB ok, correct split
41 Correct 10 ms 7544 KB ok, correct split
42 Correct 10 ms 7544 KB ok, correct split
43 Correct 11 ms 7804 KB ok, correct split
44 Correct 11 ms 7800 KB ok, correct split
45 Correct 11 ms 7800 KB ok, correct split
46 Correct 10 ms 7800 KB ok, correct split
47 Correct 10 ms 7800 KB ok, no valid answer
48 Correct 10 ms 7800 KB ok, correct split
49 Correct 10 ms 7800 KB ok, correct split
50 Correct 10 ms 7416 KB ok, no valid answer
51 Correct 8 ms 7416 KB ok, no valid answer
52 Correct 11 ms 7804 KB ok, no valid answer
53 Correct 12 ms 7800 KB ok, no valid answer
54 Correct 10 ms 7672 KB ok, no valid answer
55 Correct 11 ms 7800 KB ok, no valid answer
56 Correct 11 ms 7800 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7292 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 163 ms 26104 KB ok, correct split
8 Correct 144 ms 24184 KB ok, correct split
9 Correct 145 ms 23672 KB ok, correct split
10 Correct 142 ms 26292 KB ok, correct split
11 Correct 154 ms 26232 KB ok, correct split
12 Correct 8 ms 7288 KB ok, correct split
13 Correct 8 ms 7416 KB ok, correct split
14 Correct 8 ms 7288 KB ok, correct split
15 Correct 176 ms 22976 KB ok, correct split
16 Correct 153 ms 18808 KB ok, correct split
17 Correct 142 ms 26396 KB ok, correct split
18 Correct 154 ms 24048 KB ok, correct split
19 Correct 181 ms 21240 KB ok, correct split
20 Correct 138 ms 20092 KB ok, correct split
21 Correct 90 ms 18288 KB ok, correct split
22 Correct 90 ms 18292 KB ok, correct split
23 Correct 96 ms 18204 KB ok, correct split
24 Correct 8 ms 7288 KB ok, correct split
25 Correct 125 ms 18708 KB ok, correct split
26 Correct 56 ms 12024 KB ok, correct split
27 Correct 10 ms 7416 KB ok, correct split
28 Correct 150 ms 22136 KB ok, correct split
29 Correct 196 ms 21880 KB ok, correct split
30 Correct 144 ms 22008 KB ok, correct split
31 Correct 156 ms 22748 KB ok, correct split
32 Correct 148 ms 21624 KB ok, correct split
33 Correct 42 ms 11516 KB ok, no valid answer
34 Correct 64 ms 13688 KB ok, no valid answer
35 Correct 115 ms 19572 KB ok, no valid answer
36 Correct 141 ms 19804 KB ok, no valid answer
37 Correct 97 ms 19184 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 7288 KB ok, correct split
41 Correct 8 ms 7292 KB ok, correct split
42 Correct 8 ms 7288 KB ok, correct split
43 Correct 8 ms 7416 KB ok, correct split
44 Correct 9 ms 7332 KB ok, correct split
45 Correct 8 ms 7416 KB ok, correct split
46 Correct 11 ms 7672 KB ok, correct split
47 Correct 11 ms 7672 KB ok, correct split
48 Correct 9 ms 7544 KB ok, correct split
49 Correct 11 ms 7672 KB ok, correct split
50 Correct 9 ms 7416 KB ok, correct split
51 Correct 9 ms 7416 KB ok, correct split
52 Correct 8 ms 7416 KB ok, correct split
53 Correct 9 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 10 ms 7416 KB ok, correct split
57 Correct 9 ms 7544 KB ok, correct split
58 Correct 10 ms 7676 KB ok, correct split
59 Correct 12 ms 7800 KB ok, correct split
60 Correct 12 ms 7800 KB ok, correct split
61 Correct 10 ms 7800 KB ok, correct split
62 Correct 12 ms 7672 KB ok, correct split
63 Correct 13 ms 7800 KB ok, correct split
64 Correct 13 ms 7800 KB ok, correct split
65 Correct 13 ms 7800 KB ok, correct split
66 Correct 10 ms 7416 KB ok, correct split
67 Correct 13 ms 7672 KB ok, correct split
68 Correct 11 ms 7544 KB ok, correct split
69 Correct 10 ms 7416 KB ok, correct split
70 Correct 8 ms 7416 KB ok, correct split
71 Correct 11 ms 7800 KB ok, correct split
72 Correct 11 ms 7672 KB ok, correct split
73 Correct 10 ms 7672 KB ok, correct split
74 Correct 12 ms 7800 KB ok, correct split
75 Correct 12 ms 7928 KB ok, correct split
76 Correct 11 ms 7800 KB ok, correct split
77 Correct 12 ms 7800 KB ok, correct split
78 Correct 10 ms 7544 KB ok, correct split
79 Correct 10 ms 7544 KB ok, correct split
80 Correct 11 ms 7804 KB ok, correct split
81 Correct 11 ms 7800 KB ok, correct split
82 Correct 11 ms 7800 KB ok, correct split
83 Correct 10 ms 7800 KB ok, correct split
84 Correct 10 ms 7800 KB ok, no valid answer
85 Correct 10 ms 7800 KB ok, correct split
86 Correct 10 ms 7800 KB ok, correct split
87 Correct 10 ms 7416 KB ok, no valid answer
88 Correct 8 ms 7416 KB ok, no valid answer
89 Correct 11 ms 7804 KB ok, no valid answer
90 Correct 12 ms 7800 KB ok, no valid answer
91 Correct 10 ms 7672 KB ok, no valid answer
92 Correct 11 ms 7800 KB ok, no valid answer
93 Correct 11 ms 7800 KB ok, no valid answer
94 Correct 150 ms 22520 KB ok, correct split
95 Correct 195 ms 27512 KB ok, correct split
96 Correct 181 ms 25848 KB ok, correct split
97 Correct 49 ms 12408 KB ok, correct split
98 Correct 50 ms 12640 KB ok, correct split
99 Correct 73 ms 14640 KB ok, correct split
100 Correct 177 ms 24132 KB ok, correct split
101 Correct 163 ms 22904 KB ok, correct split
102 Correct 154 ms 22512 KB ok, correct split
103 Correct 149 ms 22260 KB ok, correct split
104 Correct 133 ms 22500 KB ok, correct split
105 Correct 87 ms 15864 KB ok, correct split
106 Correct 146 ms 23880 KB ok, correct split
107 Correct 133 ms 21116 KB ok, correct split
108 Correct 140 ms 21112 KB ok, correct split
109 Correct 201 ms 24824 KB ok, correct split
110 Correct 204 ms 25584 KB ok, correct split
111 Correct 197 ms 25460 KB ok, correct split
112 Correct 193 ms 24400 KB ok, correct split
113 Correct 174 ms 24304 KB ok, correct split
114 Correct 23 ms 9208 KB ok, correct split
115 Correct 24 ms 9080 KB ok, correct split
116 Correct 199 ms 25616 KB ok, correct split
117 Correct 186 ms 25328 KB ok, correct split
118 Correct 135 ms 21240 KB ok, correct split
119 Correct 139 ms 21316 KB ok, correct split
120 Correct 159 ms 24440 KB ok, correct split
121 Correct 144 ms 21112 KB ok, no valid answer
122 Correct 127 ms 20992 KB ok, no valid answer
123 Correct 226 ms 26988 KB ok, no valid answer
124 Correct 217 ms 26872 KB ok, no valid answer
125 Correct 125 ms 22128 KB ok, no valid answer
126 Correct 81 ms 19060 KB ok, no valid answer
127 Correct 154 ms 22896 KB ok, no valid answer