oj.uz

Submission #436032

# Submission time Handle Problem Language Result Execution time Memory
436032 2021-06-24T06:11:23 Z 79brue Keys (IOI21_keys) C++17
100 / 100
 2395 ms 140736 KB 
#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ll;

struct disjointSet{
    int n;
    int par[300002];
    int sz[300002];

    void init(int _n){
        n = _n;
        for(int i=0; i<=n; i++) par[i] = i, sz[i] = 1;
    }

    int find(int x){
        if(x == par[x]) return x;
        return par[x] = find(par[x]);
    }

    void merge(int x, int y){
        x = find(x), y = find(y);
        sz[x] += sz[y];
        par[y] = x;
    }
} dsu;

struct Bitset{
    unordered_map<int, ll> mp;
    Bitset(){}
    Bitset(int x){
        mp[x>>6] = 1ULL << (x&63);
    }

    void merge(Bitset &r){
        if(mp.size() > r.mp.size()){
            for(auto p: r.mp){
                mp[p.first] |= p.second;
            }
            r.mp.clear();
        }
        else{
            for(auto p: mp){
                r.mp[p.first] |= p.second;
            }
            mp.clear();
            mp.swap(r.mp);
        }
    }

    bool chk(int x){
        return !!(mp[x>>6] & (1ULL << (x&63)));
    }
};

int n;
Bitset arr[300002];
vector<pair<int, int> > link[300002];
stack<int> stk;
bool visited[300002];
bool merged[300002];

vector<int> sccVec;

void dfs1(int x){
    visited[x] = 1;
    for(auto &y: link[x]){
        y.first = dsu.find(y.first);
        if(visited[y.first] || !arr[x].chk(y.second)) continue;
        dfs1(y.first);
    }
    stk.push(x);
}

void dfs2(int x){
    visited[x] = 0;
    sccVec.push_back(x);
    for(auto &y: link[x]){
        y.first = dsu.find(y.first);
        if(!visited[y.first] || !arr[y.first].chk(y.second)) continue;
        dfs2(y.first);
    }
}

void makeSCC(){
    for(int i=0; i<n; i++){
        if(!visited[i] && !merged[i]) dfs1(i);
    }
    while(!stk.empty()){
        int tmp = stk.top();
        stk.pop();
        if(!visited[tmp]) continue;
        sccVec.clear();
        dfs2(tmp);

        for(auto x: sccVec){
            if(x==tmp) continue;
            arr[tmp].merge(arr[x]);

            if(link[tmp].size() > link[x].size()){
                for(auto p: link[x]) link[tmp].push_back(p);
                link[x].clear();
                link[x].shrink_to_fit();
            }
            else{
                for(auto p: link[tmp]) link[x].push_back(p);
                link[tmp].clear();
                link[tmp].shrink_to_fit();
                link[x].swap(link[tmp]);
            }
            dsu.merge(tmp, x);
            merged[x] = 1;
        }
    }
}

bool toOther[300002];

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c){
    n = (int)r.size();
    for(int i=0; i<n; i++){
        arr[i] = Bitset(r[i]);
    }
    for(int i=0; i<(int)u.size(); i++){
        link[u[i]].push_back(make_pair(v[i], c[i]));
        link[v[i]].push_back(make_pair(u[i], c[i]));
    }

    dsu.init(n);
    for(int d=0; d<=5; d++){
        makeSCC();
    }

    for(int i=0; i<n; i++){
        if(merged[i]) continue;
        for(auto y: link[i]){
            if(i != dsu.find(y.first) && arr[i].chk(y.second)) toOther[i] = 1;
        }
    }

    int minSize = n+1;
    for(int i=0; i<n; i++){
        if(!toOther[dsu.find(i)]) minSize = min(minSize, dsu.sz[dsu.find(i)]);
    }

    vector<int> ans (n);
    for(int i=0; i<n; i++){
        ans[i] = (!toOther[dsu.find(i)] && dsu.sz[dsu.find(i)] == minSize);
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23884 KB Output is correct
2 Correct 18 ms 23752 KB Output is correct
3 Correct 18 ms 23804 KB Output is correct
4 Correct 18 ms 23840 KB Output is correct
5 Correct 18 ms 23724 KB Output is correct
6 Correct 18 ms 23696 KB Output is correct
7 Correct 18 ms 23744 KB Output is correct
8 Correct 20 ms 23760 KB Output is correct
9 Correct 20 ms 23732 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23884 KB Output is correct
2 Correct 18 ms 23752 KB Output is correct
3 Correct 18 ms 23804 KB Output is correct
4 Correct 18 ms 23840 KB Output is correct
5 Correct 18 ms 23724 KB Output is correct
6 Correct 18 ms 23696 KB Output is correct
7 Correct 18 ms 23744 KB Output is correct
8 Correct 20 ms 23760 KB Output is correct
9 Correct 20 ms 23732 KB Output is correct
10 Correct 19 ms 23812 KB Output is correct
11 Correct 20 ms 23812 KB Output is correct
12 Correct 19 ms 23732 KB Output is correct
13 Correct 19 ms 23756 KB Output is correct
14 Correct 18 ms 23688 KB Output is correct
15 Correct 18 ms 23824 KB Output is correct
16 Correct 19 ms 23756 KB Output is correct
17 Correct 19 ms 23700 KB Output is correct
18 Correct 21 ms 23800 KB Output is correct
19 Correct 19 ms 23756 KB Output is correct
20 Correct 18 ms 23812 KB Output is correct
21 Correct 19 ms 23848 KB Output is correct
22 Correct 18 ms 23756 KB Output is correct
23 Correct 19 ms 23756 KB Output is correct
24 Correct 19 ms 23804 KB Output is correct
25 Correct 20 ms 23756 KB Output is correct
26 Correct 18 ms 23868 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23884 KB Output is correct
2 Correct 18 ms 23752 KB Output is correct
3 Correct 18 ms 23804 KB Output is correct
4 Correct 18 ms 23840 KB Output is correct
5 Correct 18 ms 23724 KB Output is correct
6 Correct 18 ms 23696 KB Output is correct
7 Correct 18 ms 23744 KB Output is correct
8 Correct 20 ms 23760 KB Output is correct
9 Correct 20 ms 23732 KB Output is correct
10 Correct 19 ms 23812 KB Output is correct
11 Correct 20 ms 23812 KB Output is correct
12 Correct 19 ms 23732 KB Output is correct
13 Correct 19 ms 23756 KB Output is correct
14 Correct 18 ms 23688 KB Output is correct
15 Correct 18 ms 23824 KB Output is correct
16 Correct 19 ms 23756 KB Output is correct
17 Correct 19 ms 23700 KB Output is correct
18 Correct 21 ms 23800 KB Output is correct
19 Correct 19 ms 23756 KB Output is correct
20 Correct 18 ms 23812 KB Output is correct
21 Correct 19 ms 23848 KB Output is correct
22 Correct 18 ms 23756 KB Output is correct
23 Correct 19 ms 23756 KB Output is correct
24 Correct 19 ms 23804 KB Output is correct
25 Correct 20 ms 23756 KB Output is correct
26 Correct 18 ms 23868 KB Output is correct
27 Correct 23 ms 24336 KB Output is correct
28 Correct 23 ms 24324 KB Output is correct
29 Correct 22 ms 24340 KB Output is correct
30 Correct 20 ms 24096 KB Output is correct
31 Correct 19 ms 24012 KB Output is correct
32 Correct 18 ms 23916 KB Output is correct
33 Correct 19 ms 23884 KB Output is correct
34 Correct 20 ms 24188 KB Output is correct
35 Correct 19 ms 24012 KB Output is correct
36 Correct 20 ms 24440 KB Output is correct
37 Correct 21 ms 24396 KB Output is correct
38 Correct 22 ms 24440 KB Output is correct
39 Correct 20 ms 24524 KB Output is correct
40 Correct 19 ms 24012 KB Output is correct
41 Correct 21 ms 24164 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23884 KB Output is correct
2 Correct 18 ms 23752 KB Output is correct
3 Correct 18 ms 23804 KB Output is correct
4 Correct 18 ms 23840 KB Output is correct
5 Correct 18 ms 23724 KB Output is correct
6 Correct 18 ms 23696 KB Output is correct
7 Correct 18 ms 23744 KB Output is correct
8 Correct 20 ms 23760 KB Output is correct
9 Correct 20 ms 23732 KB Output is correct
10 Correct 1146 ms 61908 KB Output is correct
11 Correct 916 ms 95784 KB Output is correct
12 Correct 142 ms 35856 KB Output is correct
13 Correct 834 ms 85072 KB Output is correct
14 Correct 404 ms 140720 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23884 KB Output is correct
2 Correct 18 ms 23752 KB Output is correct
3 Correct 18 ms 23804 KB Output is correct
4 Correct 18 ms 23840 KB Output is correct
5 Correct 18 ms 23724 KB Output is correct
6 Correct 18 ms 23696 KB Output is correct
7 Correct 18 ms 23744 KB Output is correct
8 Correct 20 ms 23760 KB Output is correct
9 Correct 20 ms 23732 KB Output is correct
10 Correct 19 ms 23812 KB Output is correct
11 Correct 20 ms 23812 KB Output is correct
12 Correct 19 ms 23732 KB Output is correct
13 Correct 19 ms 23756 KB Output is correct
14 Correct 18 ms 23688 KB Output is correct
15 Correct 18 ms 23824 KB Output is correct
16 Correct 19 ms 23756 KB Output is correct
17 Correct 19 ms 23700 KB Output is correct
18 Correct 21 ms 23800 KB Output is correct
19 Correct 19 ms 23756 KB Output is correct
20 Correct 18 ms 23812 KB Output is correct
21 Correct 19 ms 23848 KB Output is correct
22 Correct 18 ms 23756 KB Output is correct
23 Correct 19 ms 23756 KB Output is correct
24 Correct 19 ms 23804 KB Output is correct
25 Correct 20 ms 23756 KB Output is correct
26 Correct 18 ms 23868 KB Output is correct
27 Correct 23 ms 24336 KB Output is correct
28 Correct 23 ms 24324 KB Output is correct
29 Correct 22 ms 24340 KB Output is correct
30 Correct 20 ms 24096 KB Output is correct
31 Correct 19 ms 24012 KB Output is correct
32 Correct 18 ms 23916 KB Output is correct
33 Correct 19 ms 23884 KB Output is correct
34 Correct 20 ms 24188 KB Output is correct
35 Correct 19 ms 24012 KB Output is correct
36 Correct 20 ms 24440 KB Output is correct
37 Correct 21 ms 24396 KB Output is correct
38 Correct 22 ms 24440 KB Output is correct
39 Correct 20 ms 24524 KB Output is correct
40 Correct 19 ms 24012 KB Output is correct
41 Correct 21 ms 24164 KB Output is correct
42 Correct 1146 ms 61908 KB Output is correct
43 Correct 916 ms 95784 KB Output is correct
44 Correct 142 ms 35856 KB Output is correct
45 Correct 834 ms 85072 KB Output is correct
46 Correct 404 ms 140720 KB Output is correct
47 Correct 19 ms 23700 KB Output is correct
48 Correct 19 ms 23796 KB Output is correct
49 Correct 19 ms 23708 KB Output is correct
50 Correct 366 ms 119588 KB Output is correct
51 Correct 406 ms 119596 KB Output is correct
52 Correct 1338 ms 78296 KB Output is correct
53 Correct 1374 ms 78216 KB Output is correct
54 Correct 1378 ms 78356 KB Output is correct
55 Correct 1404 ms 78376 KB Output is correct
56 Correct 2395 ms 107536 KB Output is correct
57 Correct 1446 ms 101612 KB Output is correct
58 Correct 875 ms 92504 KB Output is correct
59 Correct 997 ms 96892 KB Output is correct
60 Correct 961 ms 111368 KB Output is correct
61 Correct 963 ms 111528 KB Output is correct
62 Correct 1242 ms 75336 KB Output is correct
63 Correct 323 ms 66496 KB Output is correct
64 Correct 26 ms 25720 KB Output is correct
65 Correct 25 ms 25804 KB Output is correct
66 Correct 1238 ms 75032 KB Output is correct
67 Correct 59 ms 35284 KB Output is correct
68 Correct 83 ms 42944 KB Output is correct
69 Correct 959 ms 94196 KB Output is correct
70 Correct 147 ms 62132 KB Output is correct
71 Correct 421 ms 140736 KB Output is correct
72 Correct 1010 ms 96996 KB Output is correct
73 Correct 1174 ms 75100 KB Output is correct