oj.uz

Submission #143800

# Submission time Handle Problem Language Result Execution time Memory
143800 2019-08-15T07:44:57 Z imeimi2000 Split the Attractions (IOI19_split) C++17
100 / 100
 243 ms 16068 KB 
#include "split.h"
#include <vector>

using namespace std;

struct {
    int par[100000];
    int sz[100000];
    void init(int n) {
        for (int i = 0; i < n; ++i) par[i] = i, sz[i] = 1;
    }
    int find(int x) {
        if (par[x] != x) return par[x] = find(par[x]);
        return x;
    }
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return 0;
        par[y] = x;
        sz[x] += sz[y];
        return 1;
    }
    int size(int x) {
        return sz[find(x)];
    }
} uf;

bool inTree[200000];
vector<int> edge[100000];
int sz[100000];

void dfs1(int x, int p) {
    sz[x] = 1;
    for (int i : edge[x]) {
        if (i == p) continue;
        dfs1(i, x);
        sz[x] += sz[i];
    }
}

int group[100000];
int dfs2(int x, int p, int g) {
    group[x] = g;
    int sz = 1;
    for (int i : edge[x]) {
        if (i == p) continue;
        sz += dfs2(i, x, g);
    }
    return sz;
}

bool choose[100000];
int dfs3(int x, int p, int a) {
    choose[x] = 1;
    if ((a -= sz[x]) <= 0) return a;
    for (int i : edge[x]) {
        if (i == p) continue;
        a = dfs3(i, x, a);
        if (a <= 0) return a;
    }
    return a;
}

bool ab[100000];
vector<int> ret;

int dfs4(int x, int p, int a, int c1, int c2) {
    if (a > 0) ret[x] = c1, --a;
    else ret[x] = c2;
    for (int i : edge[x]) {
        if (i == p) continue;
        a = dfs4(i, x, a, c1, c2);
    }
    return a;
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    int val[3] = { a, b, c };
    int col[3] = { 1, 2, 3 };
    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 2; ++j) {
            if (val[j] > val[j + 1]) {
                swap(val[j], val[j + 1]);
                swap(col[j], col[j + 1]);
            }
        }
    }
    uf.init(n);
    int m = p.size();
    for (int i = 0; i < m; ++i) {
        if (uf.merge(p[i], q[i])) {
            inTree[i] = 1;
            edge[p[i]].push_back(q[i]);
            edge[q[i]].push_back(p[i]);
        }
    }
    dfs1(0, -1);
    int cent = 0;
    {
        int p = -1, loop = 1;
        while (loop) {
            loop = 0;
            for (int i : edge[cent]) {
                if (i == p) continue;
                if (n < (sz[i] << 1)) {
                    p = cent;
                    cent = i;
                    loop = 1;
                    break;
                }
            }
        }
    }
    int k = 0;
    for (int i : edge[cent]) {
        sz[k] = dfs2(i, cent, k);
        uf.par[k] = k;
        uf.sz[k] = sz[k];
        ++k;
    }
    for (int i = 0; i < k; ++i) edge[i].clear();
    for (int i = 0; i < m; ++i) {
        if (inTree[i]) continue;
        if (p[i] == cent || q[i] == cent) continue;
        int x = group[p[i]];
        int y = group[q[i]];
        if (uf.merge(x, y)) {
            edge[x].push_back(y);
            edge[y].push_back(x);
        }
    }
    int r = -1;
    for (int i = 0; i < k; ++i) {
        if (uf.find(i) != i) continue;
        if (uf.size(i) < val[0]) continue;
        r = i;
        break;
    }
    if (r == -1) return vector<int>(n, 0);
    dfs3(r, -1, val[0]);
    for (int i = 0; i < n; ++i) ab[i] = !choose[group[i]];
    ab[cent] = 1;
    for (int i = 0; i < n; ++i) edge[i].clear();
    uf.init(n);
    for (int i = 0; i < m; ++i) {
        if (ab[p[i]] != ab[q[i]]) continue;
        if (uf.merge(p[i], q[i])) {
            edge[p[i]].push_back(q[i]);
            edge[q[i]].push_back(p[i]);
        }
    }
    ret.resize(n, 0);
    for (int i = 0; i < n; ++i) {
        if (ret[i]) continue;
        dfs4(i, -1, val[ab[i]], col[ab[i]], col[2]);
    }
    return ret;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 4 ms 2680 KB ok, correct split
6 Correct 4 ms 2680 KB ok, correct split
7 Correct 167 ms 15864 KB ok, correct split
8 Correct 166 ms 14040 KB ok, correct split
9 Correct 198 ms 13560 KB ok, correct split
10 Correct 200 ms 16068 KB ok, correct split
11 Correct 164 ms 14968 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 158 ms 10860 KB ok, correct split
5 Correct 130 ms 9944 KB ok, correct split
6 Correct 218 ms 15980 KB ok, correct split
7 Correct 166 ms 13864 KB ok, correct split
8 Correct 239 ms 11512 KB ok, correct split
9 Correct 136 ms 10108 KB ok, correct split
10 Correct 77 ms 10352 KB ok, correct split
11 Correct 77 ms 10352 KB ok, correct split
12 Correct 83 ms 10352 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 116 ms 10036 KB ok, correct split
3 Correct 42 ms 5752 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 138 ms 12056 KB ok, correct split
6 Correct 158 ms 11820 KB ok, correct split
7 Correct 129 ms 12152 KB ok, correct split
8 Correct 141 ms 12716 KB ok, correct split
9 Correct 156 ms 11896 KB ok, correct split
10 Correct 30 ms 4896 KB ok, no valid answer
11 Correct 44 ms 6136 KB ok, no valid answer
12 Correct 80 ms 9716 KB ok, no valid answer
13 Correct 129 ms 9640 KB ok, no valid answer
14 Correct 74 ms 9844 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, no valid answer
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 4 ms 2660 KB ok, correct split
5 Correct 4 ms 2680 KB ok, correct split
6 Correct 4 ms 2680 KB ok, correct split
7 Correct 4 ms 2680 KB ok, correct split
8 Correct 4 ms 2680 KB ok, correct split
9 Correct 6 ms 2808 KB ok, correct split
10 Correct 6 ms 2936 KB ok, correct split
11 Correct 4 ms 2680 KB ok, correct split
12 Correct 7 ms 2936 KB ok, correct split
13 Correct 4 ms 2652 KB ok, correct split
14 Correct 4 ms 2680 KB ok, correct split
15 Correct 4 ms 2680 KB ok, correct split
16 Correct 4 ms 2680 KB ok, correct split
17 Correct 4 ms 2680 KB ok, correct split
18 Correct 4 ms 2680 KB ok, correct split
19 Correct 8 ms 2680 KB ok, correct split
20 Correct 5 ms 2808 KB ok, correct split
21 Correct 6 ms 2936 KB ok, correct split
22 Correct 6 ms 2984 KB ok, correct split
23 Correct 6 ms 2936 KB ok, correct split
24 Correct 6 ms 2936 KB ok, correct split
25 Correct 6 ms 2936 KB ok, correct split
26 Correct 6 ms 2936 KB ok, correct split
27 Correct 6 ms 2936 KB ok, correct split
28 Correct 6 ms 2936 KB ok, correct split
29 Correct 4 ms 2680 KB ok, correct split
30 Correct 7 ms 2936 KB ok, correct split
31 Correct 5 ms 2680 KB ok, correct split
32 Correct 5 ms 2680 KB ok, correct split
33 Correct 4 ms 2680 KB ok, correct split
34 Correct 6 ms 2940 KB ok, correct split
35 Correct 8 ms 2936 KB ok, correct split
36 Correct 6 ms 2808 KB ok, correct split
37 Correct 6 ms 2936 KB ok, correct split
38 Correct 7 ms 2936 KB ok, correct split
39 Correct 7 ms 3004 KB ok, correct split
40 Correct 6 ms 2936 KB ok, correct split
41 Correct 5 ms 2808 KB ok, correct split
42 Correct 7 ms 2808 KB ok, correct split
43 Correct 7 ms 2936 KB ok, correct split
44 Correct 7 ms 2964 KB ok, correct split
45 Correct 6 ms 2936 KB ok, correct split
46 Correct 7 ms 2936 KB ok, correct split
47 Correct 5 ms 2936 KB ok, no valid answer
48 Correct 6 ms 2808 KB ok, correct split
49 Correct 6 ms 2936 KB ok, correct split
50 Correct 4 ms 2680 KB ok, no valid answer
51 Correct 5 ms 2680 KB ok, no valid answer
52 Correct 6 ms 2808 KB ok, no valid answer
53 Correct 7 ms 2808 KB ok, no valid answer
54 Correct 5 ms 2808 KB ok, no valid answer
55 Correct 7 ms 2808 KB ok, no valid answer
56 Correct 5 ms 2808 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 4 ms 2680 KB ok, correct split
6 Correct 4 ms 2680 KB ok, correct split
7 Correct 167 ms 15864 KB ok, correct split
8 Correct 166 ms 14040 KB ok, correct split
9 Correct 198 ms 13560 KB ok, correct split
10 Correct 200 ms 16068 KB ok, correct split
11 Correct 164 ms 14968 KB ok, correct split
12 Correct 4 ms 2680 KB ok, correct split
13 Correct 4 ms 2680 KB ok, correct split
14 Correct 4 ms 2680 KB ok, correct split
15 Correct 158 ms 10860 KB ok, correct split
16 Correct 130 ms 9944 KB ok, correct split
17 Correct 218 ms 15980 KB ok, correct split
18 Correct 166 ms 13864 KB ok, correct split
19 Correct 239 ms 11512 KB ok, correct split
20 Correct 136 ms 10108 KB ok, correct split
21 Correct 77 ms 10352 KB ok, correct split
22 Correct 77 ms 10352 KB ok, correct split
23 Correct 83 ms 10352 KB ok, correct split
24 Correct 4 ms 2680 KB ok, correct split
25 Correct 116 ms 10036 KB ok, correct split
26 Correct 42 ms 5752 KB ok, correct split
27 Correct 4 ms 2680 KB ok, correct split
28 Correct 138 ms 12056 KB ok, correct split
29 Correct 158 ms 11820 KB ok, correct split
30 Correct 129 ms 12152 KB ok, correct split
31 Correct 141 ms 12716 KB ok, correct split
32 Correct 156 ms 11896 KB ok, correct split
33 Correct 30 ms 4896 KB ok, no valid answer
34 Correct 44 ms 6136 KB ok, no valid answer
35 Correct 80 ms 9716 KB ok, no valid answer
36 Correct 129 ms 9640 KB ok, no valid answer
37 Correct 74 ms 9844 KB ok, no valid answer
38 Correct 4 ms 2680 KB ok, correct split
39 Correct 4 ms 2680 KB ok, no valid answer
40 Correct 4 ms 2680 KB ok, correct split
41 Correct 4 ms 2660 KB ok, correct split
42 Correct 4 ms 2680 KB ok, correct split
43 Correct 4 ms 2680 KB ok, correct split
44 Correct 4 ms 2680 KB ok, correct split
45 Correct 4 ms 2680 KB ok, correct split
46 Correct 6 ms 2808 KB ok, correct split
47 Correct 6 ms 2936 KB ok, correct split
48 Correct 4 ms 2680 KB ok, correct split
49 Correct 7 ms 2936 KB ok, correct split
50 Correct 4 ms 2652 KB ok, correct split
51 Correct 4 ms 2680 KB ok, correct split
52 Correct 4 ms 2680 KB ok, correct split
53 Correct 4 ms 2680 KB ok, correct split
54 Correct 4 ms 2680 KB ok, correct split
55 Correct 4 ms 2680 KB ok, correct split
56 Correct 8 ms 2680 KB ok, correct split
57 Correct 5 ms 2808 KB ok, correct split
58 Correct 6 ms 2936 KB ok, correct split
59 Correct 6 ms 2984 KB ok, correct split
60 Correct 6 ms 2936 KB ok, correct split
61 Correct 6 ms 2936 KB ok, correct split
62 Correct 6 ms 2936 KB ok, correct split
63 Correct 6 ms 2936 KB ok, correct split
64 Correct 6 ms 2936 KB ok, correct split
65 Correct 6 ms 2936 KB ok, correct split
66 Correct 4 ms 2680 KB ok, correct split
67 Correct 7 ms 2936 KB ok, correct split
68 Correct 5 ms 2680 KB ok, correct split
69 Correct 5 ms 2680 KB ok, correct split
70 Correct 4 ms 2680 KB ok, correct split
71 Correct 6 ms 2940 KB ok, correct split
72 Correct 8 ms 2936 KB ok, correct split
73 Correct 6 ms 2808 KB ok, correct split
74 Correct 6 ms 2936 KB ok, correct split
75 Correct 7 ms 2936 KB ok, correct split
76 Correct 7 ms 3004 KB ok, correct split
77 Correct 6 ms 2936 KB ok, correct split
78 Correct 5 ms 2808 KB ok, correct split
79 Correct 7 ms 2808 KB ok, correct split
80 Correct 7 ms 2936 KB ok, correct split
81 Correct 7 ms 2964 KB ok, correct split
82 Correct 6 ms 2936 KB ok, correct split
83 Correct 7 ms 2936 KB ok, correct split
84 Correct 5 ms 2936 KB ok, no valid answer
85 Correct 6 ms 2808 KB ok, correct split
86 Correct 6 ms 2936 KB ok, correct split
87 Correct 4 ms 2680 KB ok, no valid answer
88 Correct 5 ms 2680 KB ok, no valid answer
89 Correct 6 ms 2808 KB ok, no valid answer
90 Correct 7 ms 2808 KB ok, no valid answer
91 Correct 5 ms 2808 KB ok, no valid answer
92 Correct 7 ms 2808 KB ok, no valid answer
93 Correct 5 ms 2808 KB ok, no valid answer
94 Correct 228 ms 10328 KB ok, correct split
95 Correct 176 ms 11640 KB ok, correct split
96 Correct 174 ms 11128 KB ok, correct split
97 Correct 54 ms 5624 KB ok, correct split
98 Correct 54 ms 5752 KB ok, correct split
99 Correct 68 ms 6008 KB ok, correct split
100 Correct 208 ms 11648 KB ok, correct split
101 Correct 161 ms 11128 KB ok, correct split
102 Correct 189 ms 11508 KB ok, correct split
103 Correct 136 ms 11340 KB ok, correct split
104 Correct 136 ms 12408 KB ok, correct split
105 Correct 75 ms 7288 KB ok, correct split
106 Correct 131 ms 12784 KB ok, correct split
107 Correct 196 ms 9976 KB ok, correct split
108 Correct 199 ms 10072 KB ok, correct split
109 Correct 243 ms 11512 KB ok, correct split
110 Correct 172 ms 11892 KB ok, correct split
111 Correct 167 ms 11892 KB ok, correct split
112 Correct 169 ms 12148 KB ok, correct split
113 Correct 170 ms 12148 KB ok, correct split
114 Correct 19 ms 3704 KB ok, correct split
115 Correct 18 ms 3676 KB ok, correct split
116 Correct 183 ms 11856 KB ok, correct split
117 Correct 213 ms 11912 KB ok, correct split
118 Correct 225 ms 10104 KB ok, correct split
119 Correct 141 ms 9976 KB ok, correct split
120 Correct 159 ms 12408 KB ok, correct split
121 Correct 97 ms 9464 KB ok, no valid answer
122 Correct 138 ms 9608 KB ok, no valid answer
123 Correct 144 ms 11128 KB ok, no valid answer
124 Correct 139 ms 11128 KB ok, no valid answer
125 Correct 92 ms 10224 KB ok, no valid answer
126 Correct 68 ms 9328 KB ok, no valid answer
127 Correct 104 ms 10452 KB ok, no valid answer