oj.uz

답안 #872625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872625 2023-11-13T13:09:26 Z lighton 열쇠 (IOI21_keys) C++17
37 / 100
 3000 ms 646260 KB 
#include<bits/stdc++.h>
#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];
    int toward[300001];
    set<int> components[300001];
    set<int> colors[300001];
    map<int, queue<int> > remainedge[300001];
    vector<pi> remainedge2[300001];
    queue<int> remaincolor[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);
                remaincolor[y].push(i);
            }
        }
        for(auto &i : remainedge[x]){
            if(i.second.size() && colors[y].find(i.first) != colors[y].end()) remaincolor[y].push(i.first);
            while(i.second.size()){
                remainedge[y][i.first].push(i.second.front());
                i.second.pop();
            }
        }
        for(auto &i : remainedge2[x]){
            remainedge2[y].push_back(i);
        }
        grp[x] = y;
        toward[y] = -1;
    }
    void findedge(int x){
        x=fi(x);
        toward[x] = -1;
        /*while(remaincolor[x].size()){
            int i = remaincolor[x].front();
            while(remainedge[x][i].size()){
                int j = remainedge[x][i].front();
                remainedge[x][i].pop();
                if(components[x].find(j) == components[x].end()) toward[x] = j;
                if(toward[x] != -1) break;
            }
            if(toward[x] != -1) break;
            remaincolor[x].pop();
        }*/
        for(auto i : remainedge2[x]){
            if(colors[x].find(i.first) != colors[x].end() && components[x].find(i.second) == components[x].end()){
                toward[x] = i.second;
                break;
            }
        }
    }
} 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.toward[i] = -1;
        cycles.components[i].insert(i);
        cycles.colors[i].insert(R[i]);
        cycles.remaincolor[i].push(R[i]);
        for(auto &j : adj[i]){
            cycles.remainedge[i][j.second].push(j.first);
            cycles.remainedge2[i].push_back({j.second,j.first});
            cycles.siz[i]++;
        }
        cycles.findedge(i);

        while(cycles.toward[cycles.fi(i)] != -1 && cc.fi(cycles.toward[cycles.fi(i)]) == cc.fi(i)){
            cycles.un(i,cycles.toward[cycles.fi(i)]);
            cycles.findedge(i);
        }
        if(cycles.toward[cycles.fi(i)] == -1){
            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.toward[cycles.fi(i)],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

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 263252 KB Output is correct
2 Correct 105 ms 263252 KB Output is correct
3 Correct 105 ms 263052 KB Output is correct
4 Correct 104 ms 263328 KB Output is correct
5 Correct 105 ms 263252 KB Output is correct
6 Correct 105 ms 263124 KB Output is correct
7 Correct 105 ms 263288 KB Output is correct
8 Correct 103 ms 263252 KB Output is correct
9 Correct 108 ms 263764 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 263252 KB Output is correct
2 Correct 105 ms 263252 KB Output is correct
3 Correct 105 ms 263052 KB Output is correct
4 Correct 104 ms 263328 KB Output is correct
5 Correct 105 ms 263252 KB Output is correct
6 Correct 105 ms 263124 KB Output is correct
7 Correct 105 ms 263288 KB Output is correct
8 Correct 103 ms 263252 KB Output is correct
9 Correct 108 ms 263764 KB Output is correct
10 Correct 105 ms 263604 KB Output is correct
11 Correct 106 ms 263608 KB Output is correct
12 Correct 107 ms 263508 KB Output is correct
13 Correct 108 ms 263112 KB Output is correct
14 Correct 104 ms 263056 KB Output is correct
15 Correct 107 ms 263508 KB Output is correct
16 Correct 106 ms 263216 KB Output is correct
17 Correct 105 ms 263260 KB Output is correct
18 Correct 108 ms 263468 KB Output is correct
19 Correct 105 ms 263240 KB Output is correct
20 Correct 105 ms 263248 KB Output is correct
21 Correct 106 ms 263508 KB Output is correct
22 Correct 113 ms 263692 KB Output is correct
23 Correct 105 ms 263588 KB Output is correct
24 Correct 106 ms 263508 KB Output is correct
25 Correct 106 ms 263508 KB Output is correct
26 Correct 106 ms 263764 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 263252 KB Output is correct
2 Correct 105 ms 263252 KB Output is correct
3 Correct 105 ms 263052 KB Output is correct
4 Correct 104 ms 263328 KB Output is correct
5 Correct 105 ms 263252 KB Output is correct
6 Correct 105 ms 263124 KB Output is correct
7 Correct 105 ms 263288 KB Output is correct
8 Correct 103 ms 263252 KB Output is correct
9 Correct 108 ms 263764 KB Output is correct
10 Correct 105 ms 263604 KB Output is correct
11 Correct 106 ms 263608 KB Output is correct
12 Correct 107 ms 263508 KB Output is correct
13 Correct 108 ms 263112 KB Output is correct
14 Correct 104 ms 263056 KB Output is correct
15 Correct 107 ms 263508 KB Output is correct
16 Correct 106 ms 263216 KB Output is correct
17 Correct 105 ms 263260 KB Output is correct
18 Correct 108 ms 263468 KB Output is correct
19 Correct 105 ms 263240 KB Output is correct
20 Correct 105 ms 263248 KB Output is correct
21 Correct 106 ms 263508 KB Output is correct
22 Correct 113 ms 263692 KB Output is correct
23 Correct 105 ms 263588 KB Output is correct
24 Correct 106 ms 263508 KB Output is correct
25 Correct 106 ms 263508 KB Output is correct
26 Correct 106 ms 263764 KB Output is correct
27 Correct 124 ms 266648 KB Output is correct
28 Correct 124 ms 266648 KB Output is correct
29 Correct 110 ms 266580 KB Output is correct
30 Correct 133 ms 265592 KB Output is correct
31 Correct 114 ms 264332 KB Output is correct
32 Correct 107 ms 263900 KB Output is correct
33 Correct 119 ms 265180 KB Output is correct
34 Correct 135 ms 264904 KB Output is correct
35 Correct 110 ms 264784 KB Output is correct
36 Correct 109 ms 266108 KB Output is correct
37 Correct 357 ms 267648 KB Output is correct
38 Correct 111 ms 266580 KB Output is correct
39 Correct 520 ms 268112 KB Output is correct
40 Correct 107 ms 265808 KB Output is correct
41 Correct 110 ms 267052 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 263252 KB Output is correct
2 Correct 105 ms 263252 KB Output is correct
3 Correct 105 ms 263052 KB Output is correct
4 Correct 104 ms 263328 KB Output is correct
5 Correct 105 ms 263252 KB Output is correct
6 Correct 105 ms 263124 KB Output is correct
7 Correct 105 ms 263288 KB Output is correct
8 Correct 103 ms 263252 KB Output is correct
9 Correct 108 ms 263764 KB Output is correct
10 Execution timed out 3085 ms 646260 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 263252 KB Output is correct
2 Correct 105 ms 263252 KB Output is correct
3 Correct 105 ms 263052 KB Output is correct
4 Correct 104 ms 263328 KB Output is correct
5 Correct 105 ms 263252 KB Output is correct
6 Correct 105 ms 263124 KB Output is correct
7 Correct 105 ms 263288 KB Output is correct
8 Correct 103 ms 263252 KB Output is correct
9 Correct 108 ms 263764 KB Output is correct
10 Correct 105 ms 263604 KB Output is correct
11 Correct 106 ms 263608 KB Output is correct
12 Correct 107 ms 263508 KB Output is correct
13 Correct 108 ms 263112 KB Output is correct
14 Correct 104 ms 263056 KB Output is correct
15 Correct 107 ms 263508 KB Output is correct
16 Correct 106 ms 263216 KB Output is correct
17 Correct 105 ms 263260 KB Output is correct
18 Correct 108 ms 263468 KB Output is correct
19 Correct 105 ms 263240 KB Output is correct
20 Correct 105 ms 263248 KB Output is correct
21 Correct 106 ms 263508 KB Output is correct
22 Correct 113 ms 263692 KB Output is correct
23 Correct 105 ms 263588 KB Output is correct
24 Correct 106 ms 263508 KB Output is correct
25 Correct 106 ms 263508 KB Output is correct
26 Correct 106 ms 263764 KB Output is correct
27 Correct 124 ms 266648 KB Output is correct
28 Correct 124 ms 266648 KB Output is correct
29 Correct 110 ms 266580 KB Output is correct
30 Correct 133 ms 265592 KB Output is correct
31 Correct 114 ms 264332 KB Output is correct
32 Correct 107 ms 263900 KB Output is correct
33 Correct 119 ms 265180 KB Output is correct
34 Correct 135 ms 264904 KB Output is correct
35 Correct 110 ms 264784 KB Output is correct
36 Correct 109 ms 266108 KB Output is correct
37 Correct 357 ms 267648 KB Output is correct
38 Correct 111 ms 266580 KB Output is correct
39 Correct 520 ms 268112 KB Output is correct
40 Correct 107 ms 265808 KB Output is correct
41 Correct 110 ms 267052 KB Output is correct
42 Execution timed out 3085 ms 646260 KB Time limit exceeded
43 Halted 0 ms 0 KB -