oj.uz

Submission #872885

# Submission time Handle Problem Language Result Execution time Memory
872885 2023-11-14T03:30:32 Z lighton Keys (IOI21_keys) C++17
100 / 100
 949 ms 259760 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define all(v) (v).begin(), (v).end()
using namespace std;
using pi = pair<int,int>;
struct CC{
    int grp[300001];
    int fi(int x){
        if(grp[x] == x) return x;
        else return grp[x] = fi(grp[x]);
    }
    void un(int x, int y){
        x = fi(x);
        y = fi(y);
        assert(x!=y);
        grp[x] = y;
    }
} cc;
vector<int> R,U,V,C;
struct CYCLES{
    int grp[300001];
    int siz[300001];
    set<int> components[300001];
    set<int> colors[300001];
    set<pi> edges[300001];
    vector<int> reach[300001];
    int fi(int x){
        if(grp[x] == x) return x;
        else return grp[x] = fi(grp[x]);
    }
    void un(int x, int y){
        x = fi(x);
        y = fi(y);
        assert(x!=y);
        if(siz[x] > siz[y]) swap(x,y);
        siz[y] += siz[x];
        for(auto &i :components[x]){
            components[y].insert(i);
        }
        
        for(auto &i :colors[x]){
            if(colors[y].find(i) == colors[y].end()) {
                colors[y].insert(i);
                auto it = edges[y].lower_bound({i,-1});
                while(it != edges[y].end() && it->first == i){
                    reach[y].push_back(it->second);
                    it = edges[y].erase(it);
                }
            }
        }
        
        for(auto &[i,j] : edges[x]){
            if(colors[y].find(i) != colors[y].end()){
                reach[y].push_back(j);
            }
            else edges[y].insert({i,j});
        }

        for(auto &i : reach[x]) reach[y].push_back(i);
        
        while(reach[y].size() && components[y].find(reach[y].back()) != components[y].end()){
            reach[y].pop_back();
        }
        grp[x] = y;
    }
} cycles;
int N,M;
vector<pi> adj[300001];
int chk[300001];
vector<pi> candidate;
int ans = 1e9;
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
    N = r.size();
    M = u.size();
    R=r;U=u;V=v;C=c;

    for(int i = 0; i<M; i++){
        adj[U[i]].push_back({V[i],C[i]});
        adj[V[i]].push_back({U[i],C[i]});
    }
    //init
    for(int i = 0; i<N; i++){
        cc.grp[i] = i;
        cycles.grp[i] = i;
    }

    for(int i = 0; i<N; i++){
        cycles.components[i].insert(i);
        cycles.colors[i].insert(R[i]);
        for(auto &j : adj[i]){
            if(j.second == R[i]) cycles.reach[i].push_back(j.first);
            else cycles.edges[i].insert({j.second,j.first});
            cycles.siz[i]++;
        }
        while(cycles.reach[cycles.fi(i)].size() && cc.fi(cycles.reach[cycles.fi(i)].back()) == cc.fi(i)){
            cycles.un(i,cycles.reach[cycles.fi(i)].back());
        }
        if(cycles.reach[cycles.fi(i)].empty()){
            int tmp = cycles.components[cycles.fi(i)].size();
            for(int j : cycles.components[cycles.fi(i)]) candidate.push_back({j,tmp});
            ans = min(ans,tmp);
        }
        else{
            cc.un(cycles.reach[cycles.fi(i)].back(),i);
        }
    }

    std::vector<int> ret(N, 0);
    for(auto &[i,j] : candidate){
        if(j==ans) ret[i] = 1;
    }
    return ret;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 59992 KB Output is correct
2 Correct 12 ms 59996 KB Output is correct
3 Correct 12 ms 60164 KB Output is correct
4 Correct 12 ms 59996 KB Output is correct
5 Correct 12 ms 59996 KB Output is correct
6 Correct 12 ms 59996 KB Output is correct
7 Correct 12 ms 60168 KB Output is correct
8 Correct 12 ms 59992 KB Output is correct
9 Correct 12 ms 60140 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 59992 KB Output is correct
2 Correct 12 ms 59996 KB Output is correct
3 Correct 12 ms 60164 KB Output is correct
4 Correct 12 ms 59996 KB Output is correct
5 Correct 12 ms 59996 KB Output is correct
6 Correct 12 ms 59996 KB Output is correct
7 Correct 12 ms 60168 KB Output is correct
8 Correct 12 ms 59992 KB Output is correct
9 Correct 12 ms 60140 KB Output is correct
10 Correct 13 ms 59996 KB Output is correct
11 Correct 12 ms 60224 KB Output is correct
12 Correct 12 ms 59996 KB Output is correct
13 Correct 12 ms 59992 KB Output is correct
14 Correct 12 ms 59996 KB Output is correct
15 Correct 12 ms 59996 KB Output is correct
16 Correct 11 ms 59996 KB Output is correct
17 Correct 12 ms 60108 KB Output is correct
18 Correct 12 ms 59996 KB Output is correct
19 Correct 12 ms 60172 KB Output is correct
20 Correct 12 ms 60160 KB Output is correct
21 Correct 12 ms 59996 KB Output is correct
22 Correct 14 ms 60252 KB Output is correct
23 Correct 12 ms 59996 KB Output is correct
24 Correct 12 ms 59992 KB Output is correct
25 Correct 12 ms 60004 KB Output is correct
26 Correct 12 ms 60252 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 59992 KB Output is correct
2 Correct 12 ms 59996 KB Output is correct
3 Correct 12 ms 60164 KB Output is correct
4 Correct 12 ms 59996 KB Output is correct
5 Correct 12 ms 59996 KB Output is correct
6 Correct 12 ms 59996 KB Output is correct
7 Correct 12 ms 60168 KB Output is correct
8 Correct 12 ms 59992 KB Output is correct
9 Correct 12 ms 60140 KB Output is correct
10 Correct 13 ms 59996 KB Output is correct
11 Correct 12 ms 60224 KB Output is correct
12 Correct 12 ms 59996 KB Output is correct
13 Correct 12 ms 59992 KB Output is correct
14 Correct 12 ms 59996 KB Output is correct
15 Correct 12 ms 59996 KB Output is correct
16 Correct 11 ms 59996 KB Output is correct
17 Correct 12 ms 60108 KB Output is correct
18 Correct 12 ms 59996 KB Output is correct
19 Correct 12 ms 60172 KB Output is correct
20 Correct 12 ms 60160 KB Output is correct
21 Correct 12 ms 59996 KB Output is correct
22 Correct 14 ms 60252 KB Output is correct
23 Correct 12 ms 59996 KB Output is correct
24 Correct 12 ms 59992 KB Output is correct
25 Correct 12 ms 60004 KB Output is correct
26 Correct 12 ms 60252 KB Output is correct
27 Correct 14 ms 60508 KB Output is correct
28 Correct 13 ms 60512 KB Output is correct
29 Correct 14 ms 60508 KB Output is correct
30 Correct 13 ms 60396 KB Output is correct
31 Correct 12 ms 60252 KB Output is correct
32 Correct 12 ms 60248 KB Output is correct
33 Correct 12 ms 60252 KB Output is correct
34 Correct 13 ms 60508 KB Output is correct
35 Correct 13 ms 60252 KB Output is correct
36 Correct 15 ms 60628 KB Output is correct
37 Correct 14 ms 60688 KB Output is correct
38 Correct 15 ms 60744 KB Output is correct
39 Correct 15 ms 60688 KB Output is correct
40 Correct 13 ms 60504 KB Output is correct
41 Correct 14 ms 60688 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 59992 KB Output is correct
2 Correct 12 ms 59996 KB Output is correct
3 Correct 12 ms 60164 KB Output is correct
4 Correct 12 ms 59996 KB Output is correct
5 Correct 12 ms 59996 KB Output is correct
6 Correct 12 ms 59996 KB Output is correct
7 Correct 12 ms 60168 KB Output is correct
8 Correct 12 ms 59992 KB Output is correct
9 Correct 12 ms 60140 KB Output is correct
10 Correct 349 ms 131268 KB Output is correct
11 Correct 519 ms 147388 KB Output is correct
12 Correct 74 ms 78540 KB Output is correct
13 Correct 440 ms 152272 KB Output is correct
14 Correct 279 ms 151992 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 59992 KB Output is correct
2 Correct 12 ms 59996 KB Output is correct
3 Correct 12 ms 60164 KB Output is correct
4 Correct 12 ms 59996 KB Output is correct
5 Correct 12 ms 59996 KB Output is correct
6 Correct 12 ms 59996 KB Output is correct
7 Correct 12 ms 60168 KB Output is correct
8 Correct 12 ms 59992 KB Output is correct
9 Correct 12 ms 60140 KB Output is correct
10 Correct 13 ms 59996 KB Output is correct
11 Correct 12 ms 60224 KB Output is correct
12 Correct 12 ms 59996 KB Output is correct
13 Correct 12 ms 59992 KB Output is correct
14 Correct 12 ms 59996 KB Output is correct
15 Correct 12 ms 59996 KB Output is correct
16 Correct 11 ms 59996 KB Output is correct
17 Correct 12 ms 60108 KB Output is correct
18 Correct 12 ms 59996 KB Output is correct
19 Correct 12 ms 60172 KB Output is correct
20 Correct 12 ms 60160 KB Output is correct
21 Correct 12 ms 59996 KB Output is correct
22 Correct 14 ms 60252 KB Output is correct
23 Correct 12 ms 59996 KB Output is correct
24 Correct 12 ms 59992 KB Output is correct
25 Correct 12 ms 60004 KB Output is correct
26 Correct 12 ms 60252 KB Output is correct
27 Correct 14 ms 60508 KB Output is correct
28 Correct 13 ms 60512 KB Output is correct
29 Correct 14 ms 60508 KB Output is correct
30 Correct 13 ms 60396 KB Output is correct
31 Correct 12 ms 60252 KB Output is correct
32 Correct 12 ms 60248 KB Output is correct
33 Correct 12 ms 60252 KB Output is correct
34 Correct 13 ms 60508 KB Output is correct
35 Correct 13 ms 60252 KB Output is correct
36 Correct 15 ms 60628 KB Output is correct
37 Correct 14 ms 60688 KB Output is correct
38 Correct 15 ms 60744 KB Output is correct
39 Correct 15 ms 60688 KB Output is correct
40 Correct 13 ms 60504 KB Output is correct
41 Correct 14 ms 60688 KB Output is correct
42 Correct 349 ms 131268 KB Output is correct
43 Correct 519 ms 147388 KB Output is correct
44 Correct 74 ms 78540 KB Output is correct
45 Correct 440 ms 152272 KB Output is correct
46 Correct 279 ms 151992 KB Output is correct
47 Correct 12 ms 59996 KB Output is correct
48 Correct 12 ms 59992 KB Output is correct
49 Correct 12 ms 59996 KB Output is correct
50 Correct 311 ms 149184 KB Output is correct
51 Correct 335 ms 150752 KB Output is correct
52 Correct 181 ms 120776 KB Output is correct
53 Correct 176 ms 120772 KB Output is correct
54 Correct 178 ms 120728 KB Output is correct
55 Correct 372 ms 133948 KB Output is correct
56 Correct 264 ms 144396 KB Output is correct
57 Correct 218 ms 142008 KB Output is correct
58 Correct 319 ms 149588 KB Output is correct
59 Correct 802 ms 156352 KB Output is correct
60 Correct 233 ms 134072 KB Output is correct
61 Correct 949 ms 163276 KB Output is correct
62 Correct 846 ms 259492 KB Output is correct
63 Correct 277 ms 147908 KB Output is correct
64 Correct 16 ms 61528 KB Output is correct
65 Correct 16 ms 61532 KB Output is correct
66 Correct 825 ms 259688 KB Output is correct
67 Correct 39 ms 69112 KB Output is correct
68 Correct 53 ms 74988 KB Output is correct
69 Correct 755 ms 156272 KB Output is correct
70 Correct 98 ms 89800 KB Output is correct
71 Correct 283 ms 151076 KB Output is correct
72 Correct 789 ms 156320 KB Output is correct
73 Correct 837 ms 259760 KB Output is correct