oj.uz

Submission #465992

# Submission time Handle Problem Language Result Execution time Memory
465992 2021-08-17T13:14:58 Z alexxela12345 Keys (IOI21_keys) C++17
100 / 100
 1324 ms 81320 KB 
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,inline,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,avx2,abm,mmx,popcnt")
#include <bits/stdc++.h>
using namespace std;

vector<int> pa;

void initDSU(int n) {
    pa.clear();
    pa.resize(n);
    iota(pa.begin(), pa.end(), 0);
}

int get(int v) {
    if (pa[v] == v)
        return v;
    return pa[v] = get(pa[v]);
}

void merge(int a, int b) {
    a = get(a);
    b = get(b);
    if (a == b)
        return;
    pa[a] = pa[b];
}

int n;
vector<vector<pair<int, int>>> g;
vector<int> r;

vector<int> find_reachable(vector<int> r_, vector<int> u, vector<int> v,
        vector<int> c) {
    r = r_;
    n = r.size();
    g.clear();
    g.resize(n);
    int m = u.size();
    for (int i = 0; i < m; i++) {
        g[u[i]].push_back({v[i], c[i]});
        g[v[i]].push_back({u[i], c[i]});
    }

    vector<int> used(n);
    vector<int> keys(n);
    vector<vector<int>> need(n);

    auto bfs = [&](int start) {
        vector<int> vs;
        deque<int> q;
        vector<int> needs;
        q.push_back(start);
        used[start] = 1;
        keys[r[start]] = 1;
        vs.push_back(start);
        while (!q.empty()) {
            int v = q.front();
            q.pop_front();
            for (auto [u, c] : g[v]) {
                if (!used[u]) {
                    if (keys[c]) {
                        used[u] = 1;
                        keys[r[u]] = 1;
                        q.push_back(u);
                        vs.push_back(u);
                        if (get(u) != get(start)) {
                            for (int v : vs) {
                                used[v] = 0;
                                keys[r[v]] = 0;
                                need[r[v]].clear();
                            }
                            for (int c : needs) {
                                need[c].clear();
                            }
                            return vs;
                        }
                        for (int z : need[r[u]]) {
                            if (!used[z]) {
                                used[z] = 1;
                                keys[r[z]] = 1;
                                q.push_back(z);
                                vs.push_back(z);
                                if (get(z) != get(start)) {
                                    for (int v : vs) {
                                        used[v] = 0;
                                        keys[r[v]] = 0;
                                        need[r[v]].clear();
                                    }
                                    for (int c : needs) {
                                        need[c].clear();
                                    }
                                    return vs;
                                }
                            }
                        }
                        need[r[u]].clear();
                    } else {
                        need[c].push_back(u);
                        needs.push_back(c);
                    }
                }
            }
        }
        for (int v : vs) {
            used[v] = 0;
            keys[r[v]] = 0;
            need[r[v]].clear();
        }
        for (int c : needs) {
            need[c].clear();
        }
        return vs;
    };
    initDSU(n);
    vector<vector<int>> ans;
    while (true) {
        vector<pair<int, int>> toMerge;
        for (int i = 0; i < n; i++) {
            if (get(i) != i)
                continue;
            vector<int> comp = bfs(i);
            if (get(comp.back()) != get(i)) {
                toMerge.push_back({i, comp.back()});
            } else {
                ans.push_back(comp);
            }
        }
        if (toMerge.empty())
            break;
        for (auto pp : toMerge) {
            merge(pp.first, pp.second);
        }
    }
    int minLen = n;
    for (auto &el : ans) {
        minLen = min(minLen, (int) el.size());
    }
    vector<int> ans2(n);
    for (auto &el : ans) {
        if ((int) el.size() == minLen) {
            for (int el2 : el) {
                ans2[el2] = 1;
            }
        }
    }
    return ans2;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 3 ms 716 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 472 KB Output is correct
37 Correct 3 ms 460 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 4 ms 460 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 329 ms 29452 KB Output is correct
11 Correct 355 ms 47576 KB Output is correct
12 Correct 82 ms 9692 KB Output is correct
13 Correct 596 ms 55192 KB Output is correct
14 Correct 243 ms 42036 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 3 ms 716 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 472 KB Output is correct
37 Correct 3 ms 460 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 4 ms 460 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 329 ms 29452 KB Output is correct
43 Correct 355 ms 47576 KB Output is correct
44 Correct 82 ms 9692 KB Output is correct
45 Correct 596 ms 55192 KB Output is correct
46 Correct 243 ms 42036 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 233 ms 43232 KB Output is correct
51 Correct 266 ms 42676 KB Output is correct
52 Correct 409 ms 43888 KB Output is correct
53 Correct 415 ms 43936 KB Output is correct
54 Correct 403 ms 43864 KB Output is correct
55 Correct 369 ms 29668 KB Output is correct
56 Correct 524 ms 64208 KB Output is correct
57 Correct 546 ms 81320 KB Output is correct
58 Correct 473 ms 53068 KB Output is correct
59 Correct 508 ms 38596 KB Output is correct
60 Correct 470 ms 36168 KB Output is correct
61 Correct 508 ms 36420 KB Output is correct
62 Correct 1324 ms 29868 KB Output is correct
63 Correct 288 ms 32932 KB Output is correct
64 Correct 4 ms 972 KB Output is correct
65 Correct 4 ms 972 KB Output is correct
66 Correct 1255 ms 30056 KB Output is correct
67 Correct 24 ms 4428 KB Output is correct
68 Correct 49 ms 7224 KB Output is correct
69 Correct 464 ms 38596 KB Output is correct
70 Correct 83 ms 13888 KB Output is correct
71 Correct 259 ms 42084 KB Output is correct
72 Correct 496 ms 38716 KB Output is correct
73 Correct 1288 ms 29836 KB Output is correct