oj.uz

답안 #832135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832135 2023-08-21T02:28:16 Z maomao90 Split the Attractions (IOI19_split) C++17
100 / 100
 98 ms 30004 KB 
// I can do all things through Christ who strengthens me
// Philippians 4:13

#include "split.h"
#include "bits/stdc++.h"
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <class T>
inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define SZ(x) (int) x.size()
#define ALL(x) x.begin(), x.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tuple<int, int, int> iii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXN = 200005;

int n, m, s[3], ss[3];
vi adj[MAXN];
vi ans;

bool ban[MAXN];
vi tree[MAXN];
void mark(int u, int p, int &rem, int x) {
    if (rem == 0) {
        return;
    }
    ans[u] = x;
    rem--;
    for (int v : tree[u]) {
        if (v == p || ban[v]) {
            continue;
        }
        mark(v, u, rem, x);
    }
}
void markall(int u, int &rem, int x) {
    if (rem == 0) {
        return;
    }
    ans[u] = x;
    rem--;
    for (int v : adj[u]) {
        if (ans[v] != ss[2] + 1) {
            continue;
        }
        markall(v, rem, x);
    }
}

int sub[MAXN];
int pre[MAXN], low[MAXN], ptr;
void getsub(int u, int p) {
    sub[u] = 1;
    pre[u] = low[u] = ptr++;
    for (int v : adj[u]) {
        if (v == p) {
            continue;
        }
        if (pre[v] != -1) {
            mnto(low[u], pre[v]);
            continue;
        }
        tree[u].pb(v);
        tree[v].pb(u);
        getsub(v, u);
        mnto(low[u], low[v]);
        sub[u] += sub[v];
    }
}
bool dfs(int u, int p) {
    bool bad = sub[u] < s[ss[0]] || u == 0;
    for (int v : tree[u]) {
        if (v == p) {
            continue;
        }
        if (sub[v] >= s[ss[0]] && n - sub[v] >= s[ss[1]]) {
            mark(v, u, s[ss[0]], ss[0] + 1);
            mark(u, v, s[ss[1]], ss[1] + 1);
            return 1;
        }
        bad |= sub[v] >= s[ss[0]];
        if (dfs(v, u)) {
            return 1;
        }
    }
    if (bad) {
        return 0;
    }
    assert(sub[u] > s[ss[0]] + s[ss[2]]);
    int csub = sub[u];
    ban[p] = 1;
    for (int v : tree[u]) {
        if (v == p) {
            continue;
        }
        if (low[v] < pre[u]) {
            ban[v] = 1;
            csub -= sub[v];
            if (csub >= s[ss[0]] && n - csub >= s[ss[1]]) {
                mark(u, p, s[ss[0]], ss[0] + 1);
                markall(p, s[ss[1]], ss[1] + 1);
                assert(s[ss[1]] == 0);
                return 1;
            }
        }
    }
    for (int v : tree[u]) {
        ban[v] = 0;
    }
    return 0;
}

vi find_split(int n, int a, int b, int c, vi p, vi q) {
    ::n = n; s[0] = a; s[1] = b; s[2] = c;
    iota(ss, ss + 3, 0);
    sort(ss, ss + 3, [&] (int l, int r) {
            return s[l] < s[r];
            });
    m = SZ(p);
    REP (i, 0, m) {
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }
    ans = vi(n, ss[2] + 1);
    memset(pre, -1, sizeof pre);
    getsub(0, -1);
    if (dfs(0, -1)) {
        return ans;
    }
    swap(ss[0], ss[1]);
    if (dfs(0, -1)) {
        return ans;
    }
    ans = vi(n, 0);
    return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10452 KB ok, correct split
2 Correct 5 ms 10452 KB ok, correct split
3 Correct 4 ms 10452 KB ok, correct split
4 Correct 4 ms 10456 KB ok, correct split
5 Correct 5 ms 10452 KB ok, correct split
6 Correct 4 ms 10452 KB ok, correct split
7 Correct 65 ms 28788 KB ok, correct split
8 Correct 65 ms 26088 KB ok, correct split
9 Correct 65 ms 25200 KB ok, correct split
10 Correct 59 ms 29188 KB ok, correct split
11 Correct 64 ms 29228 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10452 KB ok, correct split
2 Correct 5 ms 10452 KB ok, correct split
3 Correct 5 ms 10452 KB ok, correct split
4 Correct 73 ms 25164 KB ok, correct split
5 Correct 58 ms 20068 KB ok, correct split
6 Correct 59 ms 29192 KB ok, correct split
7 Correct 66 ms 25836 KB ok, correct split
8 Correct 78 ms 21828 KB ok, correct split
9 Correct 57 ms 19856 KB ok, correct split
10 Correct 49 ms 20620 KB ok, correct split
11 Correct 49 ms 20544 KB ok, correct split
12 Correct 46 ms 20548 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10452 KB ok, correct split
2 Correct 56 ms 20104 KB ok, correct split
3 Correct 26 ms 14256 KB ok, correct split
4 Correct 5 ms 10452 KB ok, correct split
5 Correct 60 ms 22904 KB ok, correct split
6 Correct 58 ms 22652 KB ok, correct split
7 Correct 60 ms 22920 KB ok, correct split
8 Correct 60 ms 23984 KB ok, correct split
9 Correct 62 ms 22616 KB ok, correct split
10 Correct 20 ms 13652 KB ok, no valid answer
11 Correct 29 ms 15308 KB ok, no valid answer
12 Correct 51 ms 20420 KB ok, no valid answer
13 Correct 60 ms 20172 KB ok, no valid answer
14 Correct 47 ms 20684 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10452 KB ok, correct split
2 Correct 4 ms 10412 KB ok, no valid answer
3 Correct 5 ms 10452 KB ok, correct split
4 Correct 5 ms 10452 KB ok, correct split
5 Correct 5 ms 10384 KB ok, correct split
6 Correct 5 ms 10496 KB ok, correct split
7 Correct 5 ms 10452 KB ok, correct split
8 Correct 4 ms 10420 KB ok, correct split
9 Correct 6 ms 10760 KB ok, correct split
10 Correct 6 ms 10708 KB ok, correct split
11 Correct 5 ms 10452 KB ok, correct split
12 Correct 6 ms 10708 KB ok, correct split
13 Correct 5 ms 10452 KB ok, correct split
14 Correct 5 ms 10452 KB ok, correct split
15 Correct 5 ms 10452 KB ok, correct split
16 Correct 4 ms 10452 KB ok, correct split
17 Correct 5 ms 10452 KB ok, correct split
18 Correct 5 ms 10452 KB ok, correct split
19 Correct 5 ms 10452 KB ok, correct split
20 Correct 5 ms 10580 KB ok, correct split
21 Correct 5 ms 10708 KB ok, correct split
22 Correct 6 ms 10780 KB ok, correct split
23 Correct 6 ms 10836 KB ok, correct split
24 Correct 6 ms 10708 KB ok, correct split
25 Correct 6 ms 10708 KB ok, correct split
26 Correct 6 ms 10708 KB ok, correct split
27 Correct 6 ms 10836 KB ok, correct split
28 Correct 7 ms 10772 KB ok, correct split
29 Correct 5 ms 10468 KB ok, correct split
30 Correct 6 ms 10736 KB ok, correct split
31 Correct 5 ms 10580 KB ok, correct split
32 Correct 5 ms 10452 KB ok, correct split
33 Correct 5 ms 10440 KB ok, correct split
34 Correct 6 ms 10708 KB ok, correct split
35 Correct 6 ms 10744 KB ok, correct split
36 Correct 5 ms 10708 KB ok, correct split
37 Correct 6 ms 10708 KB ok, correct split
38 Correct 6 ms 10836 KB ok, correct split
39 Correct 6 ms 10804 KB ok, correct split
40 Correct 7 ms 10736 KB ok, correct split
41 Correct 5 ms 10580 KB ok, correct split
42 Correct 5 ms 10580 KB ok, correct split
43 Correct 6 ms 10708 KB ok, correct split
44 Correct 6 ms 10708 KB ok, correct split
45 Correct 6 ms 10708 KB ok, correct split
46 Correct 6 ms 10740 KB ok, correct split
47 Correct 6 ms 10836 KB ok, no valid answer
48 Correct 6 ms 10648 KB ok, correct split
49 Correct 6 ms 10836 KB ok, correct split
50 Correct 5 ms 10452 KB ok, no valid answer
51 Correct 5 ms 10452 KB ok, no valid answer
52 Correct 5 ms 10696 KB ok, no valid answer
53 Correct 7 ms 10828 KB ok, no valid answer
54 Correct 6 ms 10740 KB ok, no valid answer
55 Correct 6 ms 10740 KB ok, no valid answer
56 Correct 6 ms 10736 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10452 KB ok, correct split
2 Correct 5 ms 10452 KB ok, correct split
3 Correct 4 ms 10452 KB ok, correct split
4 Correct 4 ms 10456 KB ok, correct split
5 Correct 5 ms 10452 KB ok, correct split
6 Correct 4 ms 10452 KB ok, correct split
7 Correct 65 ms 28788 KB ok, correct split
8 Correct 65 ms 26088 KB ok, correct split
9 Correct 65 ms 25200 KB ok, correct split
10 Correct 59 ms 29188 KB ok, correct split
11 Correct 64 ms 29228 KB ok, correct split
12 Correct 5 ms 10452 KB ok, correct split
13 Correct 5 ms 10452 KB ok, correct split
14 Correct 5 ms 10452 KB ok, correct split
15 Correct 73 ms 25164 KB ok, correct split
16 Correct 58 ms 20068 KB ok, correct split
17 Correct 59 ms 29192 KB ok, correct split
18 Correct 66 ms 25836 KB ok, correct split
19 Correct 78 ms 21828 KB ok, correct split
20 Correct 57 ms 19856 KB ok, correct split
21 Correct 49 ms 20620 KB ok, correct split
22 Correct 49 ms 20544 KB ok, correct split
23 Correct 46 ms 20548 KB ok, correct split
24 Correct 5 ms 10452 KB ok, correct split
25 Correct 56 ms 20104 KB ok, correct split
26 Correct 26 ms 14256 KB ok, correct split
27 Correct 5 ms 10452 KB ok, correct split
28 Correct 60 ms 22904 KB ok, correct split
29 Correct 58 ms 22652 KB ok, correct split
30 Correct 60 ms 22920 KB ok, correct split
31 Correct 60 ms 23984 KB ok, correct split
32 Correct 62 ms 22616 KB ok, correct split
33 Correct 20 ms 13652 KB ok, no valid answer
34 Correct 29 ms 15308 KB ok, no valid answer
35 Correct 51 ms 20420 KB ok, no valid answer
36 Correct 60 ms 20172 KB ok, no valid answer
37 Correct 47 ms 20684 KB ok, no valid answer
38 Correct 5 ms 10452 KB ok, correct split
39 Correct 4 ms 10412 KB ok, no valid answer
40 Correct 5 ms 10452 KB ok, correct split
41 Correct 5 ms 10452 KB ok, correct split
42 Correct 5 ms 10384 KB ok, correct split
43 Correct 5 ms 10496 KB ok, correct split
44 Correct 5 ms 10452 KB ok, correct split
45 Correct 4 ms 10420 KB ok, correct split
46 Correct 6 ms 10760 KB ok, correct split
47 Correct 6 ms 10708 KB ok, correct split
48 Correct 5 ms 10452 KB ok, correct split
49 Correct 6 ms 10708 KB ok, correct split
50 Correct 5 ms 10452 KB ok, correct split
51 Correct 5 ms 10452 KB ok, correct split
52 Correct 5 ms 10452 KB ok, correct split
53 Correct 4 ms 10452 KB ok, correct split
54 Correct 5 ms 10452 KB ok, correct split
55 Correct 5 ms 10452 KB ok, correct split
56 Correct 5 ms 10452 KB ok, correct split
57 Correct 5 ms 10580 KB ok, correct split
58 Correct 5 ms 10708 KB ok, correct split
59 Correct 6 ms 10780 KB ok, correct split
60 Correct 6 ms 10836 KB ok, correct split
61 Correct 6 ms 10708 KB ok, correct split
62 Correct 6 ms 10708 KB ok, correct split
63 Correct 6 ms 10708 KB ok, correct split
64 Correct 6 ms 10836 KB ok, correct split
65 Correct 7 ms 10772 KB ok, correct split
66 Correct 5 ms 10468 KB ok, correct split
67 Correct 6 ms 10736 KB ok, correct split
68 Correct 5 ms 10580 KB ok, correct split
69 Correct 5 ms 10452 KB ok, correct split
70 Correct 5 ms 10440 KB ok, correct split
71 Correct 6 ms 10708 KB ok, correct split
72 Correct 6 ms 10744 KB ok, correct split
73 Correct 5 ms 10708 KB ok, correct split
74 Correct 6 ms 10708 KB ok, correct split
75 Correct 6 ms 10836 KB ok, correct split
76 Correct 6 ms 10804 KB ok, correct split
77 Correct 7 ms 10736 KB ok, correct split
78 Correct 5 ms 10580 KB ok, correct split
79 Correct 5 ms 10580 KB ok, correct split
80 Correct 6 ms 10708 KB ok, correct split
81 Correct 6 ms 10708 KB ok, correct split
82 Correct 6 ms 10708 KB ok, correct split
83 Correct 6 ms 10740 KB ok, correct split
84 Correct 6 ms 10836 KB ok, no valid answer
85 Correct 6 ms 10648 KB ok, correct split
86 Correct 6 ms 10836 KB ok, correct split
87 Correct 5 ms 10452 KB ok, no valid answer
88 Correct 5 ms 10452 KB ok, no valid answer
89 Correct 5 ms 10696 KB ok, no valid answer
90 Correct 7 ms 10828 KB ok, no valid answer
91 Correct 6 ms 10740 KB ok, no valid answer
92 Correct 6 ms 10740 KB ok, no valid answer
93 Correct 6 ms 10736 KB ok, no valid answer
94 Correct 86 ms 24740 KB ok, correct split
95 Correct 97 ms 30004 KB ok, correct split
96 Correct 86 ms 28180 KB ok, correct split
97 Correct 24 ms 14740 KB ok, correct split
98 Correct 25 ms 14924 KB ok, correct split
99 Correct 38 ms 17228 KB ok, correct split
100 Correct 82 ms 24700 KB ok, correct split
101 Correct 74 ms 23696 KB ok, correct split
102 Correct 75 ms 23288 KB ok, correct split
103 Correct 74 ms 23160 KB ok, correct split
104 Correct 68 ms 24928 KB ok, correct split
105 Correct 37 ms 17100 KB ok, correct split
106 Correct 71 ms 24932 KB ok, correct split
107 Correct 57 ms 21260 KB ok, correct split
108 Correct 60 ms 21224 KB ok, correct split
109 Correct 98 ms 24160 KB ok, correct split
110 Correct 82 ms 24204 KB ok, correct split
111 Correct 92 ms 24388 KB ok, correct split
112 Correct 84 ms 24552 KB ok, correct split
113 Correct 83 ms 24456 KB ok, correct split
114 Correct 13 ms 12244 KB ok, correct split
115 Correct 14 ms 12032 KB ok, correct split
116 Correct 89 ms 24052 KB ok, correct split
117 Correct 82 ms 24016 KB ok, correct split
118 Correct 58 ms 21136 KB ok, correct split
119 Correct 88 ms 21128 KB ok, correct split
120 Correct 71 ms 25996 KB ok, correct split
121 Correct 72 ms 21196 KB ok, no valid answer
122 Correct 58 ms 21444 KB ok, no valid answer
123 Correct 88 ms 25196 KB ok, no valid answer
124 Correct 94 ms 24948 KB ok, no valid answer
125 Correct 60 ms 22716 KB ok, no valid answer
126 Correct 45 ms 20736 KB ok, no valid answer
127 Correct 81 ms 23132 KB ok, no valid answer