oj.uz

답안 #246771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246771 2020-07-10T07:19:02 Z LifeHappen__ Split the Attractions (IOI19_split) C++14
100 / 100
 167 ms 18936 KB 
#include <bits/stdc++.h>
#include "split.h"

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef unsigned long long ull;
typedef double db;

#define forinc(a, b, c) for(int a = b, _c = c; a <= _c; ++a)
#define fordec(a, b, c) for(int a = b, _c = c; a >= _c; --a)
#define rep(i, a) forinc(i, 1, a)
#define repv(i, a) forinc(i, 0, a - 1)
#define forv(a, b) for(auto &a : b)

#define ii pair<int, int>
#define fi first
#define se second
#define reset(f, x) memset(f, x, sizeof(f))
#define all(a) begin(a), end(a)
#define pb push_back
#define eb emplace_back
#define mp make_pair

#define bit(x, i) (x >> (i - 1) & 1ll)
#define on(x, i) (x | (1ll << (i - 1)))
#define off(x, i) (x & ~(1ll << (i - 1)))

const int N = 2e5 + 5;
vector <int> ad[N];
int id[N];

int root(int x) {return id[x] < 0 ? x : id[x] = root(id[x]);}
bool mer(int u, int v){
    if((u = root(u)) == (v = root(v))) return false;
    if(id[u] < id[v]) swap(u, v);
    id[u] += id[v];
    id[v] = u;
    return 1;
}
int to(int x) {return -id[root(x)];}
int sz[N], pd[N];
int ftr(int s) {
    function<void(int)> dfs = [&](int u) {
        sz[u] = 1;
        forv(v, ad[u]) if(v != pd[u]) {
            pd[v] = u;
            dfs(v);
            sz[u] += sz[v];
        }
    };
    dfs(0);
    int now=0;
    while(1) {
        ii mx = {-1, -1};
        forv(v, ad[now]) if(v != pd[now]) mx = max(mx, make_pair(sz[v], v));
        if(mx.first <= s) return now;
        now = mx.se;
    }
    assert(0);
}

vector <int> find_split(int n, int a, int b, int c, vector <int> p, vector <int> q) {
    int m = p.size();
    int ca = 1, cb = 2, cc = 3;
    vector <ii> pp;
    vector <int> dd(n, 0);
    pp.eb(a, ca); pp.eb(b, cb); pp.eb(c, cc);
    sort(all(pp)); tie(a, ca) = pp[0]; tie(b, cb) = pp[1], tie(c, cc) = pp[2];
    reset(id, -1);
    repv(i, m) {
        int u = p[i], v = q[i];
        if(mer(u, v)) ad[u].pb(v), ad[v].pb(u);
    }
    reset(id, -1);
    int rt = ftr(n - b);
    repv(i, n) {
        forv(v, ad[i]) {
            if(i != rt && v != rt) mer(i, v);
        }
    }
    repv(i, m) {
        int u = p[i], v = q[i];
        if(to(u) >= a || to(v) >= a) continue;
        if(u == rt || v == rt) continue;
        if(mer(u, v)) {
            ad[u].pb(v); ad[v].pb(u);
        }
    }
    function<void(int, int &, int, int)> dfs=[&](int u, int &cnt, int cl, int bl) {
        if(u == bl || !cnt || dd[u]) return 0;
        dd[u] = cl;
        cnt -= 1;
        forv(v, ad[u]) if(!dd[v]) {
            dfs(v, cnt, cl, bl);
        }
    };
    forv(v, ad[rt]) if(to(v) >= a) {
        dfs(v, a, ca, rt);
        dfs(rt, b, cb, -1);
        repv(i, n) if(!dd[i]) dd[i] = cc;
        break;
    }
    return dd;
}
/*
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    if(fopen("inp.txt", "r")) freopen("inp.txt", "r", stdin);
    int n, m, a, b, c;
    cin >> n >> m >> a >> b >> c;
    vector <int> p(m), q(m);
    repv(i, m) cin >> p[i] >> q[i];
    vector <int> ans = find_split(n, a, b, c, p, q);
    forv(v, ans) cout << v << ' ';
}
*/

Compilation message

split.cpp: In lambda function:
split.cpp:99:5: warning: control reaches end of non-void function [-Wreturn-type]
     };
     ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5760 KB ok, correct split
2 Correct 8 ms 5760 KB ok, correct split
3 Correct 10 ms 5760 KB ok, correct split
4 Correct 8 ms 5760 KB ok, correct split
5 Correct 10 ms 5760 KB ok, correct split
6 Correct 8 ms 5760 KB ok, correct split
7 Correct 153 ms 18936 KB ok, correct split
8 Correct 114 ms 17016 KB ok, correct split
9 Correct 105 ms 17528 KB ok, correct split
10 Correct 103 ms 18880 KB ok, correct split
11 Correct 109 ms 17916 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5760 KB ok, correct split
2 Correct 7 ms 5888 KB ok, correct split
3 Correct 8 ms 5760 KB ok, correct split
4 Correct 124 ms 12664 KB ok, correct split
5 Correct 109 ms 11896 KB ok, correct split
6 Correct 97 ms 17656 KB ok, correct split
7 Correct 113 ms 16376 KB ok, correct split
8 Correct 133 ms 13176 KB ok, correct split
9 Correct 93 ms 11768 KB ok, correct split
10 Correct 65 ms 12016 KB ok, correct split
11 Correct 60 ms 12016 KB ok, correct split
12 Correct 68 ms 12016 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5760 KB ok, correct split
2 Correct 105 ms 11768 KB ok, correct split
3 Correct 37 ms 8184 KB ok, correct split
4 Correct 9 ms 5760 KB ok, correct split
5 Correct 106 ms 14456 KB ok, correct split
6 Correct 106 ms 14456 KB ok, correct split
7 Correct 107 ms 14512 KB ok, correct split
8 Correct 112 ms 14456 KB ok, correct split
9 Correct 114 ms 14456 KB ok, correct split
10 Correct 39 ms 7800 KB ok, no valid answer
11 Correct 56 ms 8824 KB ok, no valid answer
12 Correct 85 ms 12148 KB ok, no valid answer
13 Correct 93 ms 11896 KB ok, no valid answer
14 Correct 72 ms 12016 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5760 KB ok, correct split
2 Correct 8 ms 5760 KB ok, no valid answer
3 Correct 7 ms 5888 KB ok, correct split
4 Correct 7 ms 5888 KB ok, correct split
5 Correct 8 ms 5760 KB ok, correct split
6 Correct 7 ms 5760 KB ok, correct split
7 Correct 7 ms 5760 KB ok, correct split
8 Correct 7 ms 5760 KB ok, correct split
9 Correct 10 ms 6016 KB ok, correct split
10 Correct 11 ms 6016 KB ok, correct split
11 Correct 8 ms 5760 KB ok, correct split
12 Correct 11 ms 6016 KB ok, correct split
13 Correct 8 ms 5760 KB ok, correct split
14 Correct 8 ms 5760 KB ok, correct split
15 Correct 8 ms 5760 KB ok, correct split
16 Correct 7 ms 5760 KB ok, correct split
17 Correct 8 ms 5760 KB ok, correct split
18 Correct 8 ms 5888 KB ok, correct split
19 Correct 8 ms 5888 KB ok, correct split
20 Correct 8 ms 5888 KB ok, correct split
21 Correct 10 ms 6016 KB ok, correct split
22 Correct 9 ms 6016 KB ok, correct split
23 Correct 9 ms 6016 KB ok, correct split
24 Correct 9 ms 6016 KB ok, correct split
25 Correct 10 ms 6016 KB ok, correct split
26 Correct 10 ms 6016 KB ok, correct split
27 Correct 10 ms 6016 KB ok, correct split
28 Correct 10 ms 6016 KB ok, correct split
29 Correct 8 ms 5760 KB ok, correct split
30 Correct 10 ms 6016 KB ok, correct split
31 Correct 8 ms 5888 KB ok, correct split
32 Correct 8 ms 5888 KB ok, correct split
33 Correct 8 ms 5888 KB ok, correct split
34 Correct 10 ms 6016 KB ok, correct split
35 Correct 10 ms 6016 KB ok, correct split
36 Correct 9 ms 6016 KB ok, correct split
37 Correct 10 ms 6016 KB ok, correct split
38 Correct 10 ms 6144 KB ok, correct split
39 Correct 10 ms 6016 KB ok, correct split
40 Correct 10 ms 6016 KB ok, correct split
41 Correct 9 ms 5888 KB ok, correct split
42 Correct 12 ms 5888 KB ok, correct split
43 Correct 11 ms 6144 KB ok, correct split
44 Correct 10 ms 6016 KB ok, correct split
45 Correct 10 ms 6016 KB ok, correct split
46 Correct 9 ms 6016 KB ok, correct split
47 Correct 9 ms 6016 KB ok, no valid answer
48 Correct 10 ms 6016 KB ok, correct split
49 Correct 10 ms 6272 KB ok, correct split
50 Correct 8 ms 5760 KB ok, no valid answer
51 Correct 8 ms 5760 KB ok, no valid answer
52 Correct 10 ms 6016 KB ok, no valid answer
53 Correct 11 ms 6016 KB ok, no valid answer
54 Correct 9 ms 6016 KB ok, no valid answer
55 Correct 9 ms 6016 KB ok, no valid answer
56 Correct 10 ms 6016 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5760 KB ok, correct split
2 Correct 8 ms 5760 KB ok, correct split
3 Correct 10 ms 5760 KB ok, correct split
4 Correct 8 ms 5760 KB ok, correct split
5 Correct 10 ms 5760 KB ok, correct split
6 Correct 8 ms 5760 KB ok, correct split
7 Correct 153 ms 18936 KB ok, correct split
8 Correct 114 ms 17016 KB ok, correct split
9 Correct 105 ms 17528 KB ok, correct split
10 Correct 103 ms 18880 KB ok, correct split
11 Correct 109 ms 17916 KB ok, correct split
12 Correct 8 ms 5760 KB ok, correct split
13 Correct 7 ms 5888 KB ok, correct split
14 Correct 8 ms 5760 KB ok, correct split
15 Correct 124 ms 12664 KB ok, correct split
16 Correct 109 ms 11896 KB ok, correct split
17 Correct 97 ms 17656 KB ok, correct split
18 Correct 113 ms 16376 KB ok, correct split
19 Correct 133 ms 13176 KB ok, correct split
20 Correct 93 ms 11768 KB ok, correct split
21 Correct 65 ms 12016 KB ok, correct split
22 Correct 60 ms 12016 KB ok, correct split
23 Correct 68 ms 12016 KB ok, correct split
24 Correct 8 ms 5760 KB ok, correct split
25 Correct 105 ms 11768 KB ok, correct split
26 Correct 37 ms 8184 KB ok, correct split
27 Correct 9 ms 5760 KB ok, correct split
28 Correct 106 ms 14456 KB ok, correct split
29 Correct 106 ms 14456 KB ok, correct split
30 Correct 107 ms 14512 KB ok, correct split
31 Correct 112 ms 14456 KB ok, correct split
32 Correct 114 ms 14456 KB ok, correct split
33 Correct 39 ms 7800 KB ok, no valid answer
34 Correct 56 ms 8824 KB ok, no valid answer
35 Correct 85 ms 12148 KB ok, no valid answer
36 Correct 93 ms 11896 KB ok, no valid answer
37 Correct 72 ms 12016 KB ok, no valid answer
38 Correct 8 ms 5760 KB ok, correct split
39 Correct 8 ms 5760 KB ok, no valid answer
40 Correct 7 ms 5888 KB ok, correct split
41 Correct 7 ms 5888 KB ok, correct split
42 Correct 8 ms 5760 KB ok, correct split
43 Correct 7 ms 5760 KB ok, correct split
44 Correct 7 ms 5760 KB ok, correct split
45 Correct 7 ms 5760 KB ok, correct split
46 Correct 10 ms 6016 KB ok, correct split
47 Correct 11 ms 6016 KB ok, correct split
48 Correct 8 ms 5760 KB ok, correct split
49 Correct 11 ms 6016 KB ok, correct split
50 Correct 8 ms 5760 KB ok, correct split
51 Correct 8 ms 5760 KB ok, correct split
52 Correct 8 ms 5760 KB ok, correct split
53 Correct 7 ms 5760 KB ok, correct split
54 Correct 8 ms 5760 KB ok, correct split
55 Correct 8 ms 5888 KB ok, correct split
56 Correct 8 ms 5888 KB ok, correct split
57 Correct 8 ms 5888 KB ok, correct split
58 Correct 10 ms 6016 KB ok, correct split
59 Correct 9 ms 6016 KB ok, correct split
60 Correct 9 ms 6016 KB ok, correct split
61 Correct 9 ms 6016 KB ok, correct split
62 Correct 10 ms 6016 KB ok, correct split
63 Correct 10 ms 6016 KB ok, correct split
64 Correct 10 ms 6016 KB ok, correct split
65 Correct 10 ms 6016 KB ok, correct split
66 Correct 8 ms 5760 KB ok, correct split
67 Correct 10 ms 6016 KB ok, correct split
68 Correct 8 ms 5888 KB ok, correct split
69 Correct 8 ms 5888 KB ok, correct split
70 Correct 8 ms 5888 KB ok, correct split
71 Correct 10 ms 6016 KB ok, correct split
72 Correct 10 ms 6016 KB ok, correct split
73 Correct 9 ms 6016 KB ok, correct split
74 Correct 10 ms 6016 KB ok, correct split
75 Correct 10 ms 6144 KB ok, correct split
76 Correct 10 ms 6016 KB ok, correct split
77 Correct 10 ms 6016 KB ok, correct split
78 Correct 9 ms 5888 KB ok, correct split
79 Correct 12 ms 5888 KB ok, correct split
80 Correct 11 ms 6144 KB ok, correct split
81 Correct 10 ms 6016 KB ok, correct split
82 Correct 10 ms 6016 KB ok, correct split
83 Correct 9 ms 6016 KB ok, correct split
84 Correct 9 ms 6016 KB ok, no valid answer
85 Correct 10 ms 6016 KB ok, correct split
86 Correct 10 ms 6272 KB ok, correct split
87 Correct 8 ms 5760 KB ok, no valid answer
88 Correct 8 ms 5760 KB ok, no valid answer
89 Correct 10 ms 6016 KB ok, no valid answer
90 Correct 11 ms 6016 KB ok, no valid answer
91 Correct 9 ms 6016 KB ok, no valid answer
92 Correct 9 ms 6016 KB ok, no valid answer
93 Correct 10 ms 6016 KB ok, no valid answer
94 Correct 110 ms 13560 KB ok, correct split
95 Correct 162 ms 15608 KB ok, correct split
96 Correct 137 ms 14840 KB ok, correct split
97 Correct 43 ms 8704 KB ok, correct split
98 Correct 49 ms 8828 KB ok, correct split
99 Correct 55 ms 9824 KB ok, correct split
100 Correct 135 ms 15608 KB ok, correct split
101 Correct 145 ms 15096 KB ok, correct split
102 Correct 142 ms 14964 KB ok, correct split
103 Correct 114 ms 14708 KB ok, correct split
104 Correct 135 ms 16376 KB ok, correct split
105 Correct 68 ms 10232 KB ok, correct split
106 Correct 113 ms 16112 KB ok, correct split
107 Correct 110 ms 13048 KB ok, correct split
108 Correct 101 ms 12920 KB ok, correct split
109 Correct 143 ms 15352 KB ok, correct split
110 Correct 164 ms 15860 KB ok, correct split
111 Correct 167 ms 15860 KB ok, correct split
112 Correct 167 ms 16116 KB ok, correct split
113 Correct 159 ms 16116 KB ok, correct split
114 Correct 20 ms 6912 KB ok, correct split
115 Correct 19 ms 6912 KB ok, correct split
116 Correct 143 ms 15732 KB ok, correct split
117 Correct 136 ms 15604 KB ok, correct split
118 Correct 106 ms 12920 KB ok, correct split
119 Correct 103 ms 12920 KB ok, correct split
120 Correct 122 ms 15992 KB ok, correct split
121 Correct 97 ms 12920 KB ok, no valid answer
122 Correct 94 ms 13048 KB ok, no valid answer
123 Correct 140 ms 15608 KB ok, no valid answer
124 Correct 136 ms 15608 KB ok, no valid answer
125 Correct 92 ms 14064 KB ok, no valid answer
126 Correct 65 ms 12848 KB ok, no valid answer
127 Correct 105 ms 14428 KB ok, no valid answer