oj.uz

Submission #535417

# Submission time Handle Problem Language Result Execution time Memory
535417 2022-03-10T09:07:26 Z mario05092929 Split the Attractions (IOI19_split) C++14
100 / 100
 288 ms 25112 KB 
#include "split.h"
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair <int,int> pi;
typedef vector <int> vec;
vector <int> rv[100005];
vector <int> v[100005];
int n,m,A,B,C,a,b;
int cnt,cntmx;
int c[100005],sz[100005],p[100005],szp[100005];
int ch[100005],poham[100005];
pi po[3];
vector <int> ans;
vector <int> tv[100005];
vector <int> com,dfscom;

int Find(int x) {return (x == p[x] ? x : p[x] = Find(p[x]));}

void init_union() {
    for(int i = 0;i < n;i++) {
        p[i] = i, szp[i] = 1;
    }
}

int get_sz(int x,int pp) {
    sz[x] = 1;
    for(int i : tv[x]) {
        if(i == pp) continue;
        sz[x] += get_sz(i,x);
    }
    return sz[x];
}

int get_cent(int x,int pp,int cap) {
    for(int i : tv[x]) if(i != pp&&sz[i] > cap) return get_cent(i,x,cap);
    return x;
}

int make_cent() {
    return get_cent(0,-1,get_sz(0,-1)/2);
}

void dfs_fill(int x,int pp,int color) {
    if(cnt == cntmx||ans[x]) return;
    cnt++;
    ans[x] = color;
    for(int i : tv[x]) {
        if(i == pp) continue;
        dfs_fill(i,x,color);
    }
}

void dfs_pofill(int x,int color,int isok) {
    if(cnt == cntmx||ans[x]||poham[x] != isok) return;
    cnt++;
    ans[x] = color;
    for(int i : rv[x]) {
        dfs_pofill(i,color,isok);
    }
}

void canDo(int x,int wi) {
    cnt = 0, cntmx = a; dfs_fill(wi,x,po[0].y);
    cnt = 0, cntmx = b; dfs_fill(x,wi,po[1].y);
    for(int i = 0;i < n;i++) {
        if(!ans[i]) ans[i] = po[2].y;
    }
}

void merge(int x,int y) {
    if(Find(x) == Find(y)) return;
    x = Find(x), y = Find(y);
    p[x] = y;
    szp[y] += szp[x];
}

void dfs_union(int x,int pp) {
    for(int i : tv[x]) {
        if(i == pp) continue;
        merge(i,x);
        dfs_union(i,x);
    }
}

void dfs_com(int x) {
    if(c[x]) return;
    c[x] = 1;
    dfscom.push_back(x);
    for(int i : v[x]) dfs_com(i);
}

vec find_split(int N,int AA,int BB,int CC,vec vec1,vec vec2) {
    n = N, A = AA, B = BB, C = CC;
    m = vec1.size();
    po[0] = {A,1}, po[1] = {B,2}, po[2] = {C,3};
    sort(po,po+3);
    a = po[0].x, b = po[1].x;
    ans.resize(n,0);
    init_union();
    for(int i = 0;i < m;i++) {
        int x = vec1[i], y = vec2[i];
        rv[x].push_back(y);
        rv[y].push_back(x);
        if(Find(x) == Find(y)) continue;
        merge(x,y);
        tv[x].push_back(y);
        tv[y].push_back(x);
    }
    int cent = make_cent();
    get_sz(cent,-1);
    init_union();
    for(int i : tv[cent]) {
        dfs_union(i,cent);
        if(szp[Find(i)] >= a) {
            canDo(cent,i);
            return ans;
        }
    }
    for(int i = 0;i < m;i++) {
        if(vec1[i] == cent||vec2[i] == cent) continue;
        int x = vec1[i], y = vec2[i];
        if(Find(x) != Find(y)) {
            v[p[x]].push_back(p[y]);
            v[p[y]].push_back(p[x]);
        }
    }
    memset(c,0,sizeof(c));
    for(int i = 0;i < n;i++) {
        if(i == cent||Find(i) != i||c[i]) continue;
        dfscom.clear(), com.clear();
        dfs_com(i);
        int sum = 0;
        for(int j : dfscom) {
            sum += szp[j];
            com.push_back(j);
            if(sum >= a) break;
        }
        if(sum >= a) {
            int st = -1;
            for(int j : com) ch[j] = 1;
            for(int j = 0;j < n;j++) {
                if(ch[Find(j)]) {
                    poham[j] = 1;
                    st = j;
                }
            }
            cnt = 0, cntmx = a; dfs_pofill(st,po[0].y,1);
            cnt = 0, cntmx = b; dfs_pofill(cent,po[1].y,0);
            for(int j = 0;j < n;j++) {
                if(!ans[j]) ans[j] = po[2].y;
            }
            return ans;
        }
    }
    return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB ok, correct split
2 Correct 5 ms 7380 KB ok, correct split
3 Correct 4 ms 7352 KB ok, correct split
4 Correct 8 ms 7356 KB ok, correct split
5 Correct 5 ms 7380 KB ok, correct split
6 Correct 4 ms 7356 KB ok, correct split
7 Correct 199 ms 24136 KB ok, correct split
8 Correct 143 ms 22440 KB ok, correct split
9 Correct 153 ms 22128 KB ok, correct split
10 Correct 174 ms 24300 KB ok, correct split
11 Correct 165 ms 23232 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB ok, correct split
2 Correct 4 ms 7252 KB ok, correct split
3 Correct 4 ms 7252 KB ok, correct split
4 Correct 163 ms 19912 KB ok, correct split
5 Correct 125 ms 18508 KB ok, correct split
6 Correct 160 ms 24256 KB ok, correct split
7 Correct 158 ms 22272 KB ok, correct split
8 Correct 190 ms 21544 KB ok, correct split
9 Correct 156 ms 18356 KB ok, correct split
10 Correct 80 ms 18616 KB ok, correct split
11 Correct 86 ms 18628 KB ok, correct split
12 Correct 88 ms 18996 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7312 KB ok, correct split
2 Correct 155 ms 18448 KB ok, correct split
3 Correct 60 ms 11788 KB ok, correct split
4 Correct 4 ms 7252 KB ok, correct split
5 Correct 167 ms 20528 KB ok, correct split
6 Correct 162 ms 20520 KB ok, correct split
7 Correct 175 ms 20544 KB ok, correct split
8 Correct 171 ms 21064 KB ok, correct split
9 Correct 175 ms 20620 KB ok, correct split
10 Correct 29 ms 11448 KB ok, no valid answer
11 Correct 52 ms 13260 KB ok, no valid answer
12 Correct 102 ms 19256 KB ok, no valid answer
13 Correct 154 ms 18964 KB ok, no valid answer
14 Correct 83 ms 19384 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB ok, correct split
2 Correct 4 ms 7764 KB ok, no valid answer
3 Correct 5 ms 7252 KB ok, correct split
4 Correct 4 ms 7252 KB ok, correct split
5 Correct 5 ms 7252 KB ok, correct split
6 Correct 5 ms 7380 KB ok, correct split
7 Correct 5 ms 7252 KB ok, correct split
8 Correct 5 ms 7252 KB ok, correct split
9 Correct 7 ms 7636 KB ok, correct split
10 Correct 7 ms 7644 KB ok, correct split
11 Correct 5 ms 7360 KB ok, correct split
12 Correct 8 ms 8140 KB ok, correct split
13 Correct 4 ms 7360 KB ok, correct split
14 Correct 5 ms 7252 KB ok, correct split
15 Correct 6 ms 7380 KB ok, correct split
16 Correct 5 ms 7380 KB ok, correct split
17 Correct 4 ms 7380 KB ok, correct split
18 Correct 5 ms 7252 KB ok, correct split
19 Correct 7 ms 7380 KB ok, correct split
20 Correct 5 ms 7380 KB ok, correct split
21 Correct 7 ms 7628 KB ok, correct split
22 Correct 8 ms 7636 KB ok, correct split
23 Correct 7 ms 7656 KB ok, correct split
24 Correct 6 ms 7656 KB ok, correct split
25 Correct 7 ms 7636 KB ok, correct split
26 Correct 6 ms 7636 KB ok, correct split
27 Correct 6 ms 7624 KB ok, correct split
28 Correct 6 ms 7636 KB ok, correct split
29 Correct 4 ms 7380 KB ok, correct split
30 Correct 6 ms 7636 KB ok, correct split
31 Correct 5 ms 7380 KB ok, correct split
32 Correct 5 ms 7344 KB ok, correct split
33 Correct 5 ms 7380 KB ok, correct split
34 Correct 6 ms 7636 KB ok, correct split
35 Correct 7 ms 7628 KB ok, correct split
36 Correct 6 ms 7508 KB ok, correct split
37 Correct 8 ms 8076 KB ok, correct split
38 Correct 8 ms 8140 KB ok, correct split
39 Correct 7 ms 8148 KB ok, correct split
40 Correct 7 ms 8076 KB ok, correct split
41 Correct 6 ms 7892 KB ok, correct split
42 Correct 6 ms 7892 KB ok, correct split
43 Correct 6 ms 7648 KB ok, correct split
44 Correct 8 ms 7696 KB ok, correct split
45 Correct 7 ms 7636 KB ok, correct split
46 Correct 7 ms 7636 KB ok, correct split
47 Correct 7 ms 8020 KB ok, no valid answer
48 Correct 7 ms 7624 KB ok, correct split
49 Correct 6 ms 8052 KB ok, correct split
50 Correct 5 ms 7764 KB ok, no valid answer
51 Correct 5 ms 7764 KB ok, no valid answer
52 Correct 7 ms 8016 KB ok, no valid answer
53 Correct 7 ms 8008 KB ok, no valid answer
54 Correct 6 ms 8020 KB ok, no valid answer
55 Correct 7 ms 8076 KB ok, no valid answer
56 Correct 9 ms 8020 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB ok, correct split
2 Correct 5 ms 7380 KB ok, correct split
3 Correct 4 ms 7352 KB ok, correct split
4 Correct 8 ms 7356 KB ok, correct split
5 Correct 5 ms 7380 KB ok, correct split
6 Correct 4 ms 7356 KB ok, correct split
7 Correct 199 ms 24136 KB ok, correct split
8 Correct 143 ms 22440 KB ok, correct split
9 Correct 153 ms 22128 KB ok, correct split
10 Correct 174 ms 24300 KB ok, correct split
11 Correct 165 ms 23232 KB ok, correct split
12 Correct 4 ms 7252 KB ok, correct split
13 Correct 4 ms 7252 KB ok, correct split
14 Correct 4 ms 7252 KB ok, correct split
15 Correct 163 ms 19912 KB ok, correct split
16 Correct 125 ms 18508 KB ok, correct split
17 Correct 160 ms 24256 KB ok, correct split
18 Correct 158 ms 22272 KB ok, correct split
19 Correct 190 ms 21544 KB ok, correct split
20 Correct 156 ms 18356 KB ok, correct split
21 Correct 80 ms 18616 KB ok, correct split
22 Correct 86 ms 18628 KB ok, correct split
23 Correct 88 ms 18996 KB ok, correct split
24 Correct 4 ms 7312 KB ok, correct split
25 Correct 155 ms 18448 KB ok, correct split
26 Correct 60 ms 11788 KB ok, correct split
27 Correct 4 ms 7252 KB ok, correct split
28 Correct 167 ms 20528 KB ok, correct split
29 Correct 162 ms 20520 KB ok, correct split
30 Correct 175 ms 20544 KB ok, correct split
31 Correct 171 ms 21064 KB ok, correct split
32 Correct 175 ms 20620 KB ok, correct split
33 Correct 29 ms 11448 KB ok, no valid answer
34 Correct 52 ms 13260 KB ok, no valid answer
35 Correct 102 ms 19256 KB ok, no valid answer
36 Correct 154 ms 18964 KB ok, no valid answer
37 Correct 83 ms 19384 KB ok, no valid answer
38 Correct 4 ms 7252 KB ok, correct split
39 Correct 4 ms 7764 KB ok, no valid answer
40 Correct 5 ms 7252 KB ok, correct split
41 Correct 4 ms 7252 KB ok, correct split
42 Correct 5 ms 7252 KB ok, correct split
43 Correct 5 ms 7380 KB ok, correct split
44 Correct 5 ms 7252 KB ok, correct split
45 Correct 5 ms 7252 KB ok, correct split
46 Correct 7 ms 7636 KB ok, correct split
47 Correct 7 ms 7644 KB ok, correct split
48 Correct 5 ms 7360 KB ok, correct split
49 Correct 8 ms 8140 KB ok, correct split
50 Correct 4 ms 7360 KB ok, correct split
51 Correct 5 ms 7252 KB ok, correct split
52 Correct 6 ms 7380 KB ok, correct split
53 Correct 5 ms 7380 KB ok, correct split
54 Correct 4 ms 7380 KB ok, correct split
55 Correct 5 ms 7252 KB ok, correct split
56 Correct 7 ms 7380 KB ok, correct split
57 Correct 5 ms 7380 KB ok, correct split
58 Correct 7 ms 7628 KB ok, correct split
59 Correct 8 ms 7636 KB ok, correct split
60 Correct 7 ms 7656 KB ok, correct split
61 Correct 6 ms 7656 KB ok, correct split
62 Correct 7 ms 7636 KB ok, correct split
63 Correct 6 ms 7636 KB ok, correct split
64 Correct 6 ms 7624 KB ok, correct split
65 Correct 6 ms 7636 KB ok, correct split
66 Correct 4 ms 7380 KB ok, correct split
67 Correct 6 ms 7636 KB ok, correct split
68 Correct 5 ms 7380 KB ok, correct split
69 Correct 5 ms 7344 KB ok, correct split
70 Correct 5 ms 7380 KB ok, correct split
71 Correct 6 ms 7636 KB ok, correct split
72 Correct 7 ms 7628 KB ok, correct split
73 Correct 6 ms 7508 KB ok, correct split
74 Correct 8 ms 8076 KB ok, correct split
75 Correct 8 ms 8140 KB ok, correct split
76 Correct 7 ms 8148 KB ok, correct split
77 Correct 7 ms 8076 KB ok, correct split
78 Correct 6 ms 7892 KB ok, correct split
79 Correct 6 ms 7892 KB ok, correct split
80 Correct 6 ms 7648 KB ok, correct split
81 Correct 8 ms 7696 KB ok, correct split
82 Correct 7 ms 7636 KB ok, correct split
83 Correct 7 ms 7636 KB ok, correct split
84 Correct 7 ms 8020 KB ok, no valid answer
85 Correct 7 ms 7624 KB ok, correct split
86 Correct 6 ms 8052 KB ok, correct split
87 Correct 5 ms 7764 KB ok, no valid answer
88 Correct 5 ms 7764 KB ok, no valid answer
89 Correct 7 ms 8016 KB ok, no valid answer
90 Correct 7 ms 8008 KB ok, no valid answer
91 Correct 6 ms 8020 KB ok, no valid answer
92 Correct 7 ms 8076 KB ok, no valid answer
93 Correct 9 ms 8020 KB ok, no valid answer
94 Correct 191 ms 19084 KB ok, correct split
95 Correct 280 ms 21972 KB ok, correct split
96 Correct 288 ms 23324 KB ok, correct split
97 Correct 60 ms 11748 KB ok, correct split
98 Correct 61 ms 11828 KB ok, correct split
99 Correct 61 ms 13376 KB ok, correct split
100 Correct 219 ms 21960 KB ok, correct split
101 Correct 199 ms 20712 KB ok, correct split
102 Correct 219 ms 22504 KB ok, correct split
103 Correct 192 ms 22244 KB ok, correct split
104 Correct 184 ms 22448 KB ok, correct split
105 Correct 90 ms 14152 KB ok, correct split
106 Correct 146 ms 22068 KB ok, correct split
107 Correct 183 ms 18544 KB ok, correct split
108 Correct 182 ms 18484 KB ok, correct split
109 Correct 254 ms 21520 KB ok, correct split
110 Correct 264 ms 24676 KB ok, correct split
111 Correct 256 ms 24764 KB ok, correct split
112 Correct 233 ms 25016 KB ok, correct split
113 Correct 223 ms 25112 KB ok, correct split
114 Correct 21 ms 9628 KB ok, correct split
115 Correct 22 ms 9436 KB ok, correct split
116 Correct 217 ms 21588 KB ok, correct split
117 Correct 213 ms 21400 KB ok, correct split
118 Correct 198 ms 18368 KB ok, correct split
119 Correct 196 ms 19128 KB ok, correct split
120 Correct 195 ms 21432 KB ok, correct split
121 Correct 182 ms 18852 KB ok, no valid answer
122 Correct 136 ms 19020 KB ok, no valid answer
123 Correct 267 ms 22416 KB ok, no valid answer
124 Correct 231 ms 22348 KB ok, no valid answer
125 Correct 128 ms 20772 KB ok, no valid answer
126 Correct 82 ms 18352 KB ok, no valid answer
127 Correct 182 ms 21688 KB ok, no valid answer