oj.uz

Submission #950615

# Submission time Handle Problem Language Result Execution time Memory
950615 2024-03-20T13:49:11 Z qin Split the Attractions (IOI19_split) C++17
40 / 100
 86 ms 19540 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vv vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int inf = 2e09; ll infll = 2e18; int mod = 119<<23|1;
struct graph{
		vv<vv<int>> bg, g;
		vv<int> vis, sz, col;
		void init(int n){
				bg.resize(n), vis.resize(n), g.resize(n), sz.resize(n, 0), col.resize(n, 0);
		}
		void add_edge_b(int a, int b){ bg[a].emplace_back(b), bg[b].emplace_back(a); }
		void add_edge_g(int a, int b){ g[a].emplace_back(b), g[b].emplace_back(a); }
		void get_tree(int x){
				vis[x] = 1;
				for(int u : bg[x]) if(!vis[u]) add_edge_g(u, x), get_tree(u);
		}
		void dfs_sz(int x, int par){
				sz[x] = 1;
				for(int u : g[x]) if(u != par) dfs_sz(u, x), sz[x] += sz[u];
		}
		int find_centroid(int x, int par, int &n){
				int ret = x;
				for(int u : g[x]) if(u != par && sz[u] > n/2) ret = find_centroid(u, x, n);
				return ret;
		}
		void dfs_col(int x, int par, int k, int kol){
				col[x] = kol; --k;
				for(int u : g[x]) if(u != par && !col[u] && k){
						if(k <= sz[u]) dfs_col(u, x, k, kol), k = 0;
						else dfs_col(u, x, sz[u], kol), k -= sz[u];
				}
		}
};
vv<int> find_split(int n, int a, int b, int c, vv<int> p, vv<int> q){
		int A = 1, B = 2, C = 3;
		if(a > b) swap(a, b), swap(A, B);
		if(b > c) swap(b, c), swap(B, C);
		if(a > b) swap(a, b), swap(A, B);
		int m = ssize(p);
		graph g; g.init(n);
		for(int i = 0; i < m; ++i) g.add_edge_b(p[i], q[i]);
		g.get_tree(0);
		g.dfs_sz(0, -1);
		int x = g.find_centroid(0, -1, n);
		g.dfs_sz(x, -1);
		bool good = 0;
		//~ printf("%d\n", x);
		for(int u : g.g[x]) if(a <= g.sz[u]){ g.dfs_col(u, x, a, A), good = 1; break; }
		if(good){
				g.dfs_col(x, -1, b, B);
				for(int i = 0; i < n; ++i) if(!g.col[i]) g.col[i] = C;
		}
		return g.col;
}
#ifdef LOCAL
int main(){
		int T = 1;
		for(++T; --T; ){
				int n, m, a, b, c; scanf("%d%d%d%d%d", &n, &m, &a, &b, &c);
				vv<int> p(m), q(m);
				for(int i = 0; i < m; ++i) scanf("%d%d", &p[i], &q[i]);
				vv<int> res = find_split(n, a, b, c, p, q);
				for(int u : res) printf("%d ", u);
				pn;
		}
		return 0;
}
#endif

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 344 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 64 ms 19284 KB ok, correct split
8 Correct 61 ms 18124 KB ok, correct split
9 Correct 60 ms 18256 KB ok, correct split
10 Correct 60 ms 19536 KB ok, correct split
11 Correct 62 ms 19540 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB ok, correct split
2 Correct 1 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 86 ms 17280 KB ok, correct split
5 Correct 59 ms 14676 KB ok, correct split
6 Correct 58 ms 18512 KB ok, correct split
7 Correct 63 ms 17068 KB ok, correct split
8 Correct 79 ms 18512 KB ok, correct split
9 Correct 56 ms 15700 KB ok, correct split
10 Correct 46 ms 16072 KB ok, correct split
11 Correct 49 ms 16072 KB ok, correct split
12 Correct 49 ms 16332 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok, correct split
2 Correct 59 ms 15716 KB ok, correct split
3 Correct 27 ms 6480 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 59 ms 17080 KB ok, correct split
6 Correct 59 ms 17232 KB ok, correct split
7 Correct 63 ms 17076 KB ok, correct split
8 Correct 71 ms 17468 KB ok, correct split
9 Correct 55 ms 17236 KB ok, correct split
10 Correct 21 ms 5464 KB ok, no valid answer
11 Correct 28 ms 8040 KB ok, no valid answer
12 Correct 67 ms 16108 KB ok, no valid answer
13 Correct 54 ms 15956 KB ok, no valid answer
14 Correct 45 ms 16332 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 0 ms 344 KB ok, no valid answer
3 Correct 1 ms 348 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 1 ms 436 KB ok, correct split
6 Correct 1 ms 344 KB ok, correct split
7 Correct 1 ms 348 KB ok, correct split
8 Correct 0 ms 344 KB ok, correct split
9 Correct 2 ms 860 KB ok, correct split
10 Correct 2 ms 856 KB ok, correct split
11 Correct 1 ms 348 KB ok, correct split
12 Correct 2 ms 860 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 0 ms 348 KB ok, correct split
16 Correct 0 ms 432 KB ok, correct split
17 Correct 1 ms 348 KB ok, correct split
18 Correct 0 ms 348 KB ok, correct split
19 Correct 1 ms 444 KB ok, correct split
20 Correct 1 ms 348 KB ok, correct split
21 Correct 2 ms 604 KB ok, correct split
22 Correct 1 ms 604 KB ok, correct split
23 Correct 2 ms 736 KB ok, correct split
24 Correct 2 ms 604 KB ok, correct split
25 Correct 2 ms 604 KB ok, correct split
26 Incorrect 2 ms 860 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 0 ms 348 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 344 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 64 ms 19284 KB ok, correct split
8 Correct 61 ms 18124 KB ok, correct split
9 Correct 60 ms 18256 KB ok, correct split
10 Correct 60 ms 19536 KB ok, correct split
11 Correct 62 ms 19540 KB ok, correct split
12 Correct 1 ms 344 KB ok, correct split
13 Correct 1 ms 348 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 86 ms 17280 KB ok, correct split
16 Correct 59 ms 14676 KB ok, correct split
17 Correct 58 ms 18512 KB ok, correct split
18 Correct 63 ms 17068 KB ok, correct split
19 Correct 79 ms 18512 KB ok, correct split
20 Correct 56 ms 15700 KB ok, correct split
21 Correct 46 ms 16072 KB ok, correct split
22 Correct 49 ms 16072 KB ok, correct split
23 Correct 49 ms 16332 KB ok, correct split
24 Correct 1 ms 348 KB ok, correct split
25 Correct 59 ms 15716 KB ok, correct split
26 Correct 27 ms 6480 KB ok, correct split
27 Correct 0 ms 348 KB ok, correct split
28 Correct 59 ms 17080 KB ok, correct split
29 Correct 59 ms 17232 KB ok, correct split
30 Correct 63 ms 17076 KB ok, correct split
31 Correct 71 ms 17468 KB ok, correct split
32 Correct 55 ms 17236 KB ok, correct split
33 Correct 21 ms 5464 KB ok, no valid answer
34 Correct 28 ms 8040 KB ok, no valid answer
35 Correct 67 ms 16108 KB ok, no valid answer
36 Correct 54 ms 15956 KB ok, no valid answer
37 Correct 45 ms 16332 KB ok, no valid answer
38 Correct 0 ms 344 KB ok, correct split
39 Correct 0 ms 344 KB ok, no valid answer
40 Correct 1 ms 348 KB ok, correct split
41 Correct 1 ms 348 KB ok, correct split
42 Correct 1 ms 436 KB ok, correct split
43 Correct 1 ms 344 KB ok, correct split
44 Correct 1 ms 348 KB ok, correct split
45 Correct 0 ms 344 KB ok, correct split
46 Correct 2 ms 860 KB ok, correct split
47 Correct 2 ms 856 KB ok, correct split
48 Correct 1 ms 348 KB ok, correct split
49 Correct 2 ms 860 KB ok, correct split
50 Correct 0 ms 348 KB ok, correct split
51 Correct 0 ms 348 KB ok, correct split
52 Correct 0 ms 348 KB ok, correct split
53 Correct 0 ms 432 KB ok, correct split
54 Correct 1 ms 348 KB ok, correct split
55 Correct 0 ms 348 KB ok, correct split
56 Correct 1 ms 444 KB ok, correct split
57 Correct 1 ms 348 KB ok, correct split
58 Correct 2 ms 604 KB ok, correct split
59 Correct 1 ms 604 KB ok, correct split
60 Correct 2 ms 736 KB ok, correct split
61 Correct 2 ms 604 KB ok, correct split
62 Correct 2 ms 604 KB ok, correct split
63 Incorrect 2 ms 860 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -