oj.uz

Submission #434744

# Submission time Handle Problem Language Result Execution time Memory
434744 2021-06-21T16:39:00 Z two_sides Split the Attractions (IOI19_split) C++17
100 / 100
 184 ms 25684 KB 
#include "split.h"
#include <bits/stdc++.h>

using namespace std;

namespace {
    vector<vector<int>> adj, chd;
    vector<int> siz, low, num, ans, par;
    int cnt;

    void dfs1(int u) {
        siz[u] = 1;
        low[u] = num[u] = ++cnt;
        for (int v : adj[u])
            if (!num[v]) {
                par[v] = u; dfs1(v);
                siz[u] += siz[v];
                chd[u].push_back(v);
                low[u] = min(low[u], low[v]);
            } else if (v != par[u])
                low[u] = min(low[u], num[v]);
    }

    void dfs2(int u, int &s, int l) {
        if (!s) return;
        s--; ans[u] = l;
        for (int v : chd[u])
            dfs2(v, s, l);
    }

    void dfs3(int u, int &s, int l) {
        if (!s) return;
        s--; ans[u] = l;
        for (int v : adj[u])
            if (!ans[v]) dfs3(v, s, l);
    }
}

vector<int> find_split(int n, int a, int b,
int c, vector<int> p, vector<int> q) {
#define fi first
#define se second
    int m = p.size();
    vector<pair<int, int>> s(3);
    s[0] = {a, 1}; s[1] = {b, 2}; s[2] = {c, 3};
    sort(s.begin(), s.end());
    adj.resize(n); siz.resize(n);
    chd.resize(n); low.resize(n);
    num.resize(n); ans.resize(n);
    par.resize(n); par[0] = -1;
    for (int i = 0; i < m; i++) {
        adj[p[i]].push_back(q[i]);
        adj[q[i]].push_back(p[i]);
    }
    dfs1(0); int u = 0;
    while (true) {
        bool flag = false;
        for (int v : chd[u])
            if (siz[v] >= s[0].fi) {
                u = v; flag = true; break;
            }
        if (!flag) break;
    }
    if (siz[u] + s[1].fi <= n) {
        dfs2(u, s[0].fi, s[0].se);
        dfs3(par[u], s[1].fi, s[1].se);
    } else {
        s[1].fi--; ans[u] = s[1].se;
        for (int v : chd[u])
            if (low[v] >= num[u])
                dfs2(v, s[1].fi, s[1].se);
        for (int v : chd[u])
            if (low[v] < num[u])
                dfs2(v, s[1].fi, s[1].se);
        if (u) dfs3(par[u], s[0].fi, s[0].se);
        if (s[0].fi) return vector<int> (n, 0);
    }
    for (int i = 0; i < n; i++)
        if (!ans[i]) ans[i] = s[2].se;
    return ans;
#undef fi
#undef se
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 1 ms 204 KB ok, correct split
6 Correct 1 ms 204 KB ok, correct split
7 Correct 113 ms 25156 KB ok, correct split
8 Correct 124 ms 22480 KB ok, correct split
9 Correct 107 ms 21676 KB ok, correct split
10 Correct 100 ms 25668 KB ok, correct split
11 Correct 111 ms 25684 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 1 ms 204 KB ok, correct split
4 Correct 140 ms 21172 KB ok, correct split
5 Correct 116 ms 14896 KB ok, correct split
6 Correct 115 ms 25640 KB ok, correct split
7 Correct 111 ms 22212 KB ok, correct split
8 Correct 137 ms 18532 KB ok, correct split
9 Correct 108 ms 16324 KB ok, correct split
10 Correct 72 ms 13604 KB ok, correct split
11 Correct 62 ms 13604 KB ok, correct split
12 Correct 63 ms 14016 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 108 ms 14884 KB ok, correct split
3 Correct 30 ms 6168 KB ok, correct split
4 Correct 1 ms 204 KB ok, correct split
5 Correct 116 ms 19368 KB ok, correct split
6 Correct 132 ms 19140 KB ok, correct split
7 Correct 121 ms 18964 KB ok, correct split
8 Correct 114 ms 20464 KB ok, correct split
9 Correct 108 ms 18628 KB ok, correct split
10 Correct 25 ms 5164 KB ok, no valid answer
11 Correct 39 ms 7516 KB ok, no valid answer
12 Correct 68 ms 14236 KB ok, no valid answer
13 Correct 116 ms 14772 KB ok, no valid answer
14 Correct 61 ms 14016 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, no valid answer
3 Correct 1 ms 204 KB ok, correct split
4 Correct 1 ms 204 KB ok, correct split
5 Correct 1 ms 204 KB ok, correct split
6 Correct 1 ms 204 KB ok, correct split
7 Correct 1 ms 204 KB ok, correct split
8 Correct 1 ms 288 KB ok, correct split
9 Correct 3 ms 716 KB ok, correct split
10 Correct 3 ms 716 KB ok, correct split
11 Correct 1 ms 204 KB ok, correct split
12 Correct 3 ms 716 KB ok, correct split
13 Correct 1 ms 204 KB ok, correct split
14 Correct 1 ms 204 KB ok, correct split
15 Correct 1 ms 204 KB ok, correct split
16 Correct 1 ms 296 KB ok, correct split
17 Correct 1 ms 392 KB ok, correct split
18 Correct 1 ms 204 KB ok, correct split
19 Correct 1 ms 332 KB ok, correct split
20 Correct 1 ms 460 KB ok, correct split
21 Correct 2 ms 716 KB ok, correct split
22 Correct 2 ms 716 KB ok, correct split
23 Correct 2 ms 716 KB ok, correct split
24 Correct 2 ms 716 KB ok, correct split
25 Correct 2 ms 716 KB ok, correct split
26 Correct 3 ms 588 KB ok, correct split
27 Correct 3 ms 588 KB ok, correct split
28 Correct 3 ms 588 KB ok, correct split
29 Correct 1 ms 332 KB ok, correct split
30 Correct 3 ms 588 KB ok, correct split
31 Correct 1 ms 332 KB ok, correct split
32 Correct 1 ms 204 KB ok, correct split
33 Correct 1 ms 332 KB ok, correct split
34 Correct 2 ms 588 KB ok, correct split
35 Correct 3 ms 588 KB ok, correct split
36 Correct 2 ms 588 KB ok, correct split
37 Correct 3 ms 684 KB ok, correct split
38 Correct 3 ms 716 KB ok, correct split
39 Correct 3 ms 716 KB ok, correct split
40 Correct 3 ms 716 KB ok, correct split
41 Correct 2 ms 460 KB ok, correct split
42 Correct 2 ms 460 KB ok, correct split
43 Correct 3 ms 716 KB ok, correct split
44 Correct 3 ms 716 KB ok, correct split
45 Correct 3 ms 716 KB ok, correct split
46 Correct 2 ms 716 KB ok, correct split
47 Correct 2 ms 716 KB ok, no valid answer
48 Correct 2 ms 588 KB ok, correct split
49 Correct 2 ms 716 KB ok, correct split
50 Correct 1 ms 204 KB ok, no valid answer
51 Correct 1 ms 204 KB ok, no valid answer
52 Correct 2 ms 588 KB ok, no valid answer
53 Correct 3 ms 716 KB ok, no valid answer
54 Correct 2 ms 588 KB ok, no valid answer
55 Correct 2 ms 588 KB ok, no valid answer
56 Correct 2 ms 588 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 1 ms 204 KB ok, correct split
6 Correct 1 ms 204 KB ok, correct split
7 Correct 113 ms 25156 KB ok, correct split
8 Correct 124 ms 22480 KB ok, correct split
9 Correct 107 ms 21676 KB ok, correct split
10 Correct 100 ms 25668 KB ok, correct split
11 Correct 111 ms 25684 KB ok, correct split
12 Correct 1 ms 204 KB ok, correct split
13 Correct 1 ms 204 KB ok, correct split
14 Correct 1 ms 204 KB ok, correct split
15 Correct 140 ms 21172 KB ok, correct split
16 Correct 116 ms 14896 KB ok, correct split
17 Correct 115 ms 25640 KB ok, correct split
18 Correct 111 ms 22212 KB ok, correct split
19 Correct 137 ms 18532 KB ok, correct split
20 Correct 108 ms 16324 KB ok, correct split
21 Correct 72 ms 13604 KB ok, correct split
22 Correct 62 ms 13604 KB ok, correct split
23 Correct 63 ms 14016 KB ok, correct split
24 Correct 1 ms 204 KB ok, correct split
25 Correct 108 ms 14884 KB ok, correct split
26 Correct 30 ms 6168 KB ok, correct split
27 Correct 1 ms 204 KB ok, correct split
28 Correct 116 ms 19368 KB ok, correct split
29 Correct 132 ms 19140 KB ok, correct split
30 Correct 121 ms 18964 KB ok, correct split
31 Correct 114 ms 20464 KB ok, correct split
32 Correct 108 ms 18628 KB ok, correct split
33 Correct 25 ms 5164 KB ok, no valid answer
34 Correct 39 ms 7516 KB ok, no valid answer
35 Correct 68 ms 14236 KB ok, no valid answer
36 Correct 116 ms 14772 KB ok, no valid answer
37 Correct 61 ms 14016 KB ok, no valid answer
38 Correct 0 ms 204 KB ok, correct split
39 Correct 1 ms 204 KB ok, no valid answer
40 Correct 1 ms 204 KB ok, correct split
41 Correct 1 ms 204 KB ok, correct split
42 Correct 1 ms 204 KB ok, correct split
43 Correct 1 ms 204 KB ok, correct split
44 Correct 1 ms 204 KB ok, correct split
45 Correct 1 ms 288 KB ok, correct split
46 Correct 3 ms 716 KB ok, correct split
47 Correct 3 ms 716 KB ok, correct split
48 Correct 1 ms 204 KB ok, correct split
49 Correct 3 ms 716 KB ok, correct split
50 Correct 1 ms 204 KB ok, correct split
51 Correct 1 ms 204 KB ok, correct split
52 Correct 1 ms 204 KB ok, correct split
53 Correct 1 ms 296 KB ok, correct split
54 Correct 1 ms 392 KB ok, correct split
55 Correct 1 ms 204 KB ok, correct split
56 Correct 1 ms 332 KB ok, correct split
57 Correct 1 ms 460 KB ok, correct split
58 Correct 2 ms 716 KB ok, correct split
59 Correct 2 ms 716 KB ok, correct split
60 Correct 2 ms 716 KB ok, correct split
61 Correct 2 ms 716 KB ok, correct split
62 Correct 2 ms 716 KB ok, correct split
63 Correct 3 ms 588 KB ok, correct split
64 Correct 3 ms 588 KB ok, correct split
65 Correct 3 ms 588 KB ok, correct split
66 Correct 1 ms 332 KB ok, correct split
67 Correct 3 ms 588 KB ok, correct split
68 Correct 1 ms 332 KB ok, correct split
69 Correct 1 ms 204 KB ok, correct split
70 Correct 1 ms 332 KB ok, correct split
71 Correct 2 ms 588 KB ok, correct split
72 Correct 3 ms 588 KB ok, correct split
73 Correct 2 ms 588 KB ok, correct split
74 Correct 3 ms 684 KB ok, correct split
75 Correct 3 ms 716 KB ok, correct split
76 Correct 3 ms 716 KB ok, correct split
77 Correct 3 ms 716 KB ok, correct split
78 Correct 2 ms 460 KB ok, correct split
79 Correct 2 ms 460 KB ok, correct split
80 Correct 3 ms 716 KB ok, correct split
81 Correct 3 ms 716 KB ok, correct split
82 Correct 3 ms 716 KB ok, correct split
83 Correct 2 ms 716 KB ok, correct split
84 Correct 2 ms 716 KB ok, no valid answer
85 Correct 2 ms 588 KB ok, correct split
86 Correct 2 ms 716 KB ok, correct split
87 Correct 1 ms 204 KB ok, no valid answer
88 Correct 1 ms 204 KB ok, no valid answer
89 Correct 2 ms 588 KB ok, no valid answer
90 Correct 3 ms 716 KB ok, no valid answer
91 Correct 2 ms 588 KB ok, no valid answer
92 Correct 2 ms 588 KB ok, no valid answer
93 Correct 2 ms 588 KB ok, no valid answer
94 Correct 117 ms 18404 KB ok, correct split
95 Correct 169 ms 24504 KB ok, correct split
96 Correct 184 ms 22648 KB ok, correct split
97 Correct 32 ms 6064 KB ok, correct split
98 Correct 32 ms 6348 KB ok, correct split
99 Correct 51 ms 8484 KB ok, correct split
100 Correct 159 ms 19196 KB ok, correct split
101 Correct 130 ms 18092 KB ok, correct split
102 Correct 119 ms 17356 KB ok, correct split
103 Correct 108 ms 16980 KB ok, correct split
104 Correct 99 ms 17316 KB ok, correct split
105 Correct 53 ms 9284 KB ok, correct split
106 Correct 106 ms 17088 KB ok, correct split
107 Correct 91 ms 14896 KB ok, correct split
108 Correct 98 ms 14916 KB ok, correct split
109 Correct 170 ms 18680 KB ok, correct split
110 Correct 161 ms 19388 KB ok, correct split
111 Correct 178 ms 19488 KB ok, correct split
112 Correct 125 ms 18152 KB ok, correct split
113 Correct 153 ms 18120 KB ok, correct split
114 Correct 11 ms 2508 KB ok, correct split
115 Correct 10 ms 2240 KB ok, correct split
116 Correct 130 ms 19384 KB ok, correct split
117 Correct 127 ms 19328 KB ok, correct split
118 Correct 103 ms 16452 KB ok, correct split
119 Correct 106 ms 16288 KB ok, correct split
120 Correct 107 ms 21316 KB ok, correct split
121 Correct 87 ms 14904 KB ok, no valid answer
122 Correct 79 ms 14788 KB ok, no valid answer
123 Correct 136 ms 19508 KB ok, no valid answer
124 Correct 132 ms 19268 KB ok, no valid answer
125 Correct 84 ms 15604 KB ok, no valid answer
126 Correct 52 ms 12736 KB ok, no valid answer
127 Correct 123 ms 16672 KB ok, no valid answer