oj.uz

Submission #702660

# Submission time Handle Problem Language Result Execution time Memory
702660 2023-02-24T17:49:55 Z onjo0127 Split the Attractions (IOI19_split) C++17
100 / 100
 144 ms 21208 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
 
const int MXN = 100009;
bool vs[MXN];
vector<int> G[MXN], T[MXN];
int N, M, F1 = 1, F2 = 2, F3 = 3, A, B, C, sz[MXN], P[MXN], ans[MXN], cent, U[MXN], S[MXN], I[MXN];
 
int root(int x) {
    if(U[x] == x) return x;
    return U[x] = root(U[x]);
}
 
void merg(int u, int v) {
    u = root(u); v = root(v);
    if(u != v) U[u] = v, S[v] += S[u];
}
 
void dfs1(int x) {
    vs[x] = 1; sz[x] = 1;
    for(auto& it: G[x]) if(!vs[it]) {
        dfs1(it);
        sz[x] += sz[it];
        T[x].push_back(it);
        T[it].push_back(x);
    }
}
 
int fnd(int rt, int x) {
    int mxi = -1;
    for(auto &it: T[x]) {
        if(sz[it] > sz[x]) continue;
        if(mxi == -1 || sz[mxi] < sz[it]) mxi = it;
    }
    if(mxi == -1 || sz[mxi] * 2 <= sz[rt]) return x;
    return fnd(rt, mxi);
}
 
void dfs2(int x, int p, int c) {
    sz[x] = 1; P[x] = p; I[x] = c;
    for(auto& it: T[x]) if(it != p) {
        dfs2(it, x, x == p ? ++c : c);
        sz[x] += sz[it];
    }
}
 
int lft;
void grd(int x, int p, int col) {
    if(!lft || ans[x]) return;
    ans[x] = col; --lft;
    for(auto& it: T[x]) if(it != p) grd(it, x, col);
}
 
void mka(vector<int> &res, int x, int c, int r) {
	if(!lft) return;
	res[x] = r; --lft;
	for(auto& it: G[x]) if(ans[it] == c && res[it] != r) mka(res, it, c, r);
}
 
vector<int> makeans(bool fail) {
    if(fail) {
        vector<int> res(N, 0);
        return res;
    }
    vector<int> res(N, F3);
    for(int i=0; i<N; i++) {
        if(ans[i] == 1) {
        	lft = A;
        	mka(res, i, 1, F1);
        	break;
        }
    }
    for(int i=0; i<N; i++) {
        if(ans[i] == 2) {
        	lft = B;
        	mka(res, i, 2, F2);
        	break;
        }
    }
    return res;
}
 
void bfs(int st) {
    int cnt = 0;
    queue<int> que; que.push(st);
    while(cnt < A) {
    	queue<int> Q; Q.push(que.front()); que.pop();
    	while(Q.size()) {
	        int x = Q.front(); Q.pop();
	        if(ans[x] == 1) continue;
	        ans[x] = 1; ++cnt;
	        for(auto& it: T[x]) {
	            if(it == cent) continue;
	            if(!ans[it]) {
	                ans[it] = -1;
	                Q.push(it);
	            }
	        }
	        for(auto& it: G[x]) if(I[x] != I[it]) {
	            if(it == cent) continue;
	            if(!ans[it]) {
	                que.push(it);
	            }
	        }
    	}
    }
    for(int i=0; i<N; i++) if(ans[i] == -1) ans[i] = 0;
}
 
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	if(a > b) swap(a, b), swap(F1, F2);
	if(a > c) swap(a, c), swap(F1, F3);
    if(b > c) swap(b, c), swap(F2, F3);
    A = a; B = b; C = c; N = n; M = p.size();
    for(int i=0; i<M; i++) {
        G[p[i]].push_back(q[i]);
        G[q[i]].push_back(p[i]);
    }
    dfs1(0);
    cent = fnd(0, 0);
    dfs2(cent, cent, 0);
    for(int i=0; i<N; i++) {
        if(i == cent) continue;
        if(sz[i] >= A && N - sz[i] >= B) {
            lft = -1; grd(i, P[i], 1);
            for(int j=0; j<N; j++) if(!ans[j]) ans[j] = 2;
            return makeans(0);
        }
    }
    for(int i=0; i<N; i++) S[i] = 1, U[i] = i;
    for(int i=0; i<M; i++) {
        if(p[i] == cent || q[i] == cent) continue;
        merg(p[i], q[i]);
    }
    int st = -1;
    for(auto& it: T[cent]) if(S[root(it)] >= A) st = it;
    if(st == -1) return makeans(1);
    bfs(st);
    int c1 = 0, c2 = 0;
    for(int i=0; i<N; i++) {
    	if(!ans[i]) {
    		ans[i] = 2;
    		++c2;
    	}
    	else ++c1;
    }
	return makeans(0);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 2 ms 4948 KB ok, correct split
7 Correct 88 ms 20728 KB ok, correct split
8 Correct 91 ms 19020 KB ok, correct split
9 Correct 87 ms 18728 KB ok, correct split
10 Correct 87 ms 21068 KB ok, correct split
11 Correct 97 ms 21032 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB ok, correct split
2 Correct 3 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 109 ms 18744 KB ok, correct split
5 Correct 93 ms 15052 KB ok, correct split
6 Correct 84 ms 21208 KB ok, correct split
7 Correct 90 ms 18872 KB ok, correct split
8 Correct 119 ms 16884 KB ok, correct split
9 Correct 77 ms 14888 KB ok, correct split
10 Correct 65 ms 15656 KB ok, correct split
11 Correct 57 ms 15596 KB ok, correct split
12 Correct 55 ms 15720 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 91 ms 15104 KB ok, correct split
3 Correct 26 ms 9044 KB ok, correct split
4 Correct 3 ms 4948 KB ok, correct split
5 Correct 101 ms 17176 KB ok, correct split
6 Correct 96 ms 17216 KB ok, correct split
7 Correct 89 ms 17228 KB ok, correct split
8 Correct 87 ms 17632 KB ok, correct split
9 Correct 94 ms 17156 KB ok, correct split
10 Correct 25 ms 8532 KB ok, no valid answer
11 Correct 34 ms 10188 KB ok, no valid answer
12 Correct 72 ms 15816 KB ok, no valid answer
13 Correct 104 ms 15464 KB ok, no valid answer
14 Correct 60 ms 16068 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, no valid answer
3 Correct 4 ms 4948 KB ok, correct split
4 Correct 3 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 3 ms 4948 KB ok, correct split
7 Correct 3 ms 4948 KB ok, correct split
8 Correct 3 ms 4948 KB ok, correct split
9 Correct 5 ms 5308 KB ok, correct split
10 Correct 5 ms 5268 KB ok, correct split
11 Correct 3 ms 5012 KB ok, correct split
12 Correct 5 ms 5272 KB ok, correct split
13 Correct 4 ms 4948 KB ok, correct split
14 Correct 3 ms 4948 KB ok, correct split
15 Correct 3 ms 4948 KB ok, correct split
16 Correct 3 ms 4948 KB ok, correct split
17 Correct 3 ms 4948 KB ok, correct split
18 Correct 3 ms 4948 KB ok, correct split
19 Correct 3 ms 4948 KB ok, correct split
20 Correct 3 ms 5076 KB ok, correct split
21 Correct 4 ms 5332 KB ok, correct split
22 Correct 4 ms 5204 KB ok, correct split
23 Correct 4 ms 5332 KB ok, correct split
24 Correct 4 ms 5332 KB ok, correct split
25 Correct 4 ms 5204 KB ok, correct split
26 Correct 5 ms 5332 KB ok, correct split
27 Correct 4 ms 5332 KB ok, correct split
28 Correct 6 ms 5332 KB ok, correct split
29 Correct 3 ms 4948 KB ok, correct split
30 Correct 4 ms 5332 KB ok, correct split
31 Correct 3 ms 5076 KB ok, correct split
32 Correct 3 ms 4948 KB ok, correct split
33 Correct 3 ms 4948 KB ok, correct split
34 Correct 5 ms 5288 KB ok, correct split
35 Correct 4 ms 5204 KB ok, correct split
36 Correct 4 ms 5204 KB ok, correct split
37 Correct 5 ms 5332 KB ok, correct split
38 Correct 5 ms 5332 KB ok, correct split
39 Correct 7 ms 5332 KB ok, correct split
40 Correct 5 ms 5284 KB ok, correct split
41 Correct 4 ms 5076 KB ok, correct split
42 Correct 4 ms 5176 KB ok, correct split
43 Correct 6 ms 5332 KB ok, correct split
44 Correct 6 ms 5204 KB ok, correct split
45 Correct 5 ms 5332 KB ok, correct split
46 Correct 5 ms 5332 KB ok, correct split
47 Correct 4 ms 5332 KB ok, no valid answer
48 Correct 4 ms 5204 KB ok, correct split
49 Correct 4 ms 5332 KB ok, correct split
50 Correct 3 ms 4948 KB ok, no valid answer
51 Correct 2 ms 4948 KB ok, no valid answer
52 Correct 6 ms 5280 KB ok, no valid answer
53 Correct 5 ms 5332 KB ok, no valid answer
54 Correct 4 ms 5204 KB ok, no valid answer
55 Correct 4 ms 5332 KB ok, no valid answer
56 Correct 4 ms 5256 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 2 ms 4948 KB ok, correct split
7 Correct 88 ms 20728 KB ok, correct split
8 Correct 91 ms 19020 KB ok, correct split
9 Correct 87 ms 18728 KB ok, correct split
10 Correct 87 ms 21068 KB ok, correct split
11 Correct 97 ms 21032 KB ok, correct split
12 Correct 3 ms 4948 KB ok, correct split
13 Correct 3 ms 4948 KB ok, correct split
14 Correct 3 ms 4948 KB ok, correct split
15 Correct 109 ms 18744 KB ok, correct split
16 Correct 93 ms 15052 KB ok, correct split
17 Correct 84 ms 21208 KB ok, correct split
18 Correct 90 ms 18872 KB ok, correct split
19 Correct 119 ms 16884 KB ok, correct split
20 Correct 77 ms 14888 KB ok, correct split
21 Correct 65 ms 15656 KB ok, correct split
22 Correct 57 ms 15596 KB ok, correct split
23 Correct 55 ms 15720 KB ok, correct split
24 Correct 2 ms 4948 KB ok, correct split
25 Correct 91 ms 15104 KB ok, correct split
26 Correct 26 ms 9044 KB ok, correct split
27 Correct 3 ms 4948 KB ok, correct split
28 Correct 101 ms 17176 KB ok, correct split
29 Correct 96 ms 17216 KB ok, correct split
30 Correct 89 ms 17228 KB ok, correct split
31 Correct 87 ms 17632 KB ok, correct split
32 Correct 94 ms 17156 KB ok, correct split
33 Correct 25 ms 8532 KB ok, no valid answer
34 Correct 34 ms 10188 KB ok, no valid answer
35 Correct 72 ms 15816 KB ok, no valid answer
36 Correct 104 ms 15464 KB ok, no valid answer
37 Correct 60 ms 16068 KB ok, no valid answer
38 Correct 2 ms 4948 KB ok, correct split
39 Correct 2 ms 4948 KB ok, no valid answer
40 Correct 4 ms 4948 KB ok, correct split
41 Correct 3 ms 4948 KB ok, correct split
42 Correct 3 ms 4948 KB ok, correct split
43 Correct 3 ms 4948 KB ok, correct split
44 Correct 3 ms 4948 KB ok, correct split
45 Correct 3 ms 4948 KB ok, correct split
46 Correct 5 ms 5308 KB ok, correct split
47 Correct 5 ms 5268 KB ok, correct split
48 Correct 3 ms 5012 KB ok, correct split
49 Correct 5 ms 5272 KB ok, correct split
50 Correct 4 ms 4948 KB ok, correct split
51 Correct 3 ms 4948 KB ok, correct split
52 Correct 3 ms 4948 KB ok, correct split
53 Correct 3 ms 4948 KB ok, correct split
54 Correct 3 ms 4948 KB ok, correct split
55 Correct 3 ms 4948 KB ok, correct split
56 Correct 3 ms 4948 KB ok, correct split
57 Correct 3 ms 5076 KB ok, correct split
58 Correct 4 ms 5332 KB ok, correct split
59 Correct 4 ms 5204 KB ok, correct split
60 Correct 4 ms 5332 KB ok, correct split
61 Correct 4 ms 5332 KB ok, correct split
62 Correct 4 ms 5204 KB ok, correct split
63 Correct 5 ms 5332 KB ok, correct split
64 Correct 4 ms 5332 KB ok, correct split
65 Correct 6 ms 5332 KB ok, correct split
66 Correct 3 ms 4948 KB ok, correct split
67 Correct 4 ms 5332 KB ok, correct split
68 Correct 3 ms 5076 KB ok, correct split
69 Correct 3 ms 4948 KB ok, correct split
70 Correct 3 ms 4948 KB ok, correct split
71 Correct 5 ms 5288 KB ok, correct split
72 Correct 4 ms 5204 KB ok, correct split
73 Correct 4 ms 5204 KB ok, correct split
74 Correct 5 ms 5332 KB ok, correct split
75 Correct 5 ms 5332 KB ok, correct split
76 Correct 7 ms 5332 KB ok, correct split
77 Correct 5 ms 5284 KB ok, correct split
78 Correct 4 ms 5076 KB ok, correct split
79 Correct 4 ms 5176 KB ok, correct split
80 Correct 6 ms 5332 KB ok, correct split
81 Correct 6 ms 5204 KB ok, correct split
82 Correct 5 ms 5332 KB ok, correct split
83 Correct 5 ms 5332 KB ok, correct split
84 Correct 4 ms 5332 KB ok, no valid answer
85 Correct 4 ms 5204 KB ok, correct split
86 Correct 4 ms 5332 KB ok, correct split
87 Correct 3 ms 4948 KB ok, no valid answer
88 Correct 2 ms 4948 KB ok, no valid answer
89 Correct 6 ms 5280 KB ok, no valid answer
90 Correct 5 ms 5332 KB ok, no valid answer
91 Correct 4 ms 5204 KB ok, no valid answer
92 Correct 4 ms 5332 KB ok, no valid answer
93 Correct 4 ms 5256 KB ok, no valid answer
94 Correct 99 ms 17220 KB ok, correct split
95 Correct 144 ms 20940 KB ok, correct split
96 Correct 123 ms 19572 KB ok, correct split
97 Correct 27 ms 9048 KB ok, correct split
98 Correct 27 ms 9076 KB ok, correct split
99 Correct 44 ms 10376 KB ok, correct split
100 Correct 110 ms 17356 KB ok, correct split
101 Correct 115 ms 16640 KB ok, correct split
102 Correct 94 ms 16452 KB ok, correct split
103 Correct 102 ms 16500 KB ok, correct split
104 Correct 100 ms 17700 KB ok, correct split
105 Correct 49 ms 11684 KB ok, correct split
106 Correct 101 ms 19248 KB ok, correct split
107 Correct 85 ms 15856 KB ok, correct split
108 Correct 84 ms 15820 KB ok, correct split
109 Correct 124 ms 17692 KB ok, correct split
110 Correct 118 ms 17664 KB ok, correct split
111 Correct 119 ms 19988 KB ok, correct split
112 Correct 136 ms 20268 KB ok, correct split
113 Correct 128 ms 20464 KB ok, correct split
114 Correct 12 ms 6740 KB ok, correct split
115 Correct 11 ms 6564 KB ok, correct split
116 Correct 109 ms 19868 KB ok, correct split
117 Correct 143 ms 20392 KB ok, correct split
118 Correct 80 ms 16036 KB ok, correct split
119 Correct 81 ms 16028 KB ok, correct split
120 Correct 86 ms 19280 KB ok, correct split
121 Correct 78 ms 16540 KB ok, no valid answer
122 Correct 75 ms 16656 KB ok, no valid answer
123 Correct 121 ms 20268 KB ok, no valid answer
124 Correct 139 ms 20024 KB ok, no valid answer
125 Correct 79 ms 17912 KB ok, no valid answer
126 Correct 51 ms 15924 KB ok, no valid answer
127 Correct 86 ms 18380 KB ok, no valid answer