oj.uz

답안 #434985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434985 2021-06-22T17:22:10 Z model_code 열쇠 (IOI21_keys) C++17
100 / 100
 2327 ms 57516 KB 
#include <bits/stdc++.h>
using namespace std;
const int n_max = 300500;
const int k_max = 300500;

vector<pair<int,int>> adj[n_max];
bool visited[n_max];
int original_key[n_max];
int has_key[k_max];
int cc[n_max];
vector<int> blocked[k_max];

int ufds[n_max];
int findset(int x) {
    while(ufds[x] != x) {
        x = ufds[x] = ufds[ufds[x]];
    }
    return x;
}

void unionset(int x, int y) {
    ufds[findset(x)] = findset(y);
}

void reset() {
    for(int i=0; i<n_max; i++) {
        visited[i] = false;
    }
}

vector<int> ans2;
vector<int> keylist;
vector<int> v2;
vector<pair<int,int>> delayed_merge;

bool change = false;

void compress(int a, int b) {
    change = true;
    //unionset(a, b);
    delayed_merge.emplace_back(a,b);
    for(int k: keylist) {
        has_key[k] = false;
        blocked[k].clear();
    }
    keylist.clear();
}
int zz = 1e9;
void explore(int x) {
    keylist.clear();
    x = findset(x);
    if(visited[x]) return;
    visited[x] = true;
    queue<int> q;
    q.push(x);
    v2.push_back(x);
    int cc_count = 1;
    while(!q.empty()) {
        const int next = q.front();
        ans2.push_back(next);
        if(findset(next) != findset(x)) { // different component, merge, cleanup and bye
            compress(x, next);
            //assert(findset(x)!=x);
            return;
        }
        q.pop();
        for(pair<int,int> p: adj[next]) {
            if(has_key[p.first]) { // i have the key
                if(!visited[p.second]) { // put in the queue
                    visited[p.second] = true;
                    q.push(p.second);
                    v2.push_back(p.second);
                    cc_count++;
                } else if(findset(p.second) != findset(x)) {
                    compress(x, p.second);
                    return;
                }
            } else { // it may be unblocked later
                //assert(p.first < k_max);
                blocked[p.first].push_back(p.second);
                keylist.push_back(p.first);
            }
        }
        int new_key = original_key[next];
        has_key[new_key] = true;
        keylist.push_back(new_key);
        for(int i: blocked[new_key]) {
            if(!visited[i]) {
                visited[i] = true;
                q.push(i);
                v2.push_back(i);
                cc_count++;
            } else if(findset(i) != findset(x)) {
                compress(x, i);
                return;
            }
        }
        blocked[new_key].clear();
    }
    cc[x] = cc_count;
    zz = min(zz, cc_count);
    for(int k: keylist) {
        has_key[k] = false;
        blocked[k].clear();
    }
    keylist.clear();

    return;
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    int m = c.size();
    int n = r.size();
    for(int i=0; i<n; i++) {
        original_key[i] = r[i];
        ufds[i] = i;
    }
    for(int i=0; i<m; i++) {
        adj[u[i]].emplace_back(c[i], v[i]);
        adj[v[i]].emplace_back(c[i], u[i]);
    }


    for(int i=0; i<20; i++) {
        reset();
        change = false;
        for(int j=0; j<n; j++) {
            if(j == findset(j)) {
                explore(j);
                for(int a: v2) {
                    visited[a] = false;
                }
                v2.clear();
            }
        }
        for(pair<int,int> pp: delayed_merge) {
            unionset(pp.first, pp.second);
        }
        if(!change) break;
    }
    int a = n+1;
    for(int i=0; i<n; i++) {
        if(i==findset(i)) {
            a = min(a, cc[i]);
            assert(a>0);
        }
    }
    vector<int> ans(n);
    ans2.clear();
    reset();
    for(int i=0; i<n; i++) {
        if(i==findset(i) and cc[findset(i)] == a) {
            explore(i);
        }
    }
    for(int i: ans2) {
        ans[i] = 1;
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14796 KB Output is correct
2 Correct 15 ms 14668 KB Output is correct
3 Correct 11 ms 14668 KB Output is correct
4 Correct 12 ms 14744 KB Output is correct
5 Correct 11 ms 14668 KB Output is correct
6 Correct 12 ms 14668 KB Output is correct
7 Correct 15 ms 14648 KB Output is correct
8 Correct 11 ms 14672 KB Output is correct
9 Correct 10 ms 14672 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14796 KB Output is correct
2 Correct 15 ms 14668 KB Output is correct
3 Correct 11 ms 14668 KB Output is correct
4 Correct 12 ms 14744 KB Output is correct
5 Correct 11 ms 14668 KB Output is correct
6 Correct 12 ms 14668 KB Output is correct
7 Correct 15 ms 14648 KB Output is correct
8 Correct 11 ms 14672 KB Output is correct
9 Correct 10 ms 14672 KB Output is correct
10 Correct 10 ms 14668 KB Output is correct
11 Correct 10 ms 14668 KB Output is correct
12 Correct 10 ms 14668 KB Output is correct
13 Correct 12 ms 14732 KB Output is correct
14 Correct 11 ms 14696 KB Output is correct
15 Correct 11 ms 14672 KB Output is correct
16 Correct 10 ms 14656 KB Output is correct
17 Correct 10 ms 14668 KB Output is correct
18 Correct 10 ms 14668 KB Output is correct
19 Correct 10 ms 14668 KB Output is correct
20 Correct 10 ms 14736 KB Output is correct
21 Correct 9 ms 14668 KB Output is correct
22 Correct 9 ms 14748 KB Output is correct
23 Correct 10 ms 14700 KB Output is correct
24 Correct 11 ms 14720 KB Output is correct
25 Correct 11 ms 14700 KB Output is correct
26 Correct 9 ms 14764 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14796 KB Output is correct
2 Correct 15 ms 14668 KB Output is correct
3 Correct 11 ms 14668 KB Output is correct
4 Correct 12 ms 14744 KB Output is correct
5 Correct 11 ms 14668 KB Output is correct
6 Correct 12 ms 14668 KB Output is correct
7 Correct 15 ms 14648 KB Output is correct
8 Correct 11 ms 14672 KB Output is correct
9 Correct 10 ms 14672 KB Output is correct
10 Correct 10 ms 14668 KB Output is correct
11 Correct 10 ms 14668 KB Output is correct
12 Correct 10 ms 14668 KB Output is correct
13 Correct 12 ms 14732 KB Output is correct
14 Correct 11 ms 14696 KB Output is correct
15 Correct 11 ms 14672 KB Output is correct
16 Correct 10 ms 14656 KB Output is correct
17 Correct 10 ms 14668 KB Output is correct
18 Correct 10 ms 14668 KB Output is correct
19 Correct 10 ms 14668 KB Output is correct
20 Correct 10 ms 14736 KB Output is correct
21 Correct 9 ms 14668 KB Output is correct
22 Correct 9 ms 14748 KB Output is correct
23 Correct 10 ms 14700 KB Output is correct
24 Correct 11 ms 14720 KB Output is correct
25 Correct 11 ms 14700 KB Output is correct
26 Correct 9 ms 14764 KB Output is correct
27 Correct 11 ms 14924 KB Output is correct
28 Correct 11 ms 14960 KB Output is correct
29 Correct 12 ms 14928 KB Output is correct
30 Correct 12 ms 14800 KB Output is correct
31 Correct 10 ms 14844 KB Output is correct
32 Correct 13 ms 14776 KB Output is correct
33 Correct 13 ms 14792 KB Output is correct
34 Correct 13 ms 14780 KB Output is correct
35 Correct 10 ms 14796 KB Output is correct
36 Correct 17 ms 14900 KB Output is correct
37 Correct 12 ms 14924 KB Output is correct
38 Correct 13 ms 14924 KB Output is correct
39 Correct 11 ms 14924 KB Output is correct
40 Correct 10 ms 14824 KB Output is correct
41 Correct 11 ms 14832 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14796 KB Output is correct
2 Correct 15 ms 14668 KB Output is correct
3 Correct 11 ms 14668 KB Output is correct
4 Correct 12 ms 14744 KB Output is correct
5 Correct 11 ms 14668 KB Output is correct
6 Correct 12 ms 14668 KB Output is correct
7 Correct 15 ms 14648 KB Output is correct
8 Correct 11 ms 14672 KB Output is correct
9 Correct 10 ms 14672 KB Output is correct
10 Correct 368 ms 38804 KB Output is correct
11 Correct 652 ms 52316 KB Output is correct
12 Correct 98 ms 21072 KB Output is correct
13 Correct 723 ms 47376 KB Output is correct
14 Correct 264 ms 48900 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14796 KB Output is correct
2 Correct 15 ms 14668 KB Output is correct
3 Correct 11 ms 14668 KB Output is correct
4 Correct 12 ms 14744 KB Output is correct
5 Correct 11 ms 14668 KB Output is correct
6 Correct 12 ms 14668 KB Output is correct
7 Correct 15 ms 14648 KB Output is correct
8 Correct 11 ms 14672 KB Output is correct
9 Correct 10 ms 14672 KB Output is correct
10 Correct 10 ms 14668 KB Output is correct
11 Correct 10 ms 14668 KB Output is correct
12 Correct 10 ms 14668 KB Output is correct
13 Correct 12 ms 14732 KB Output is correct
14 Correct 11 ms 14696 KB Output is correct
15 Correct 11 ms 14672 KB Output is correct
16 Correct 10 ms 14656 KB Output is correct
17 Correct 10 ms 14668 KB Output is correct
18 Correct 10 ms 14668 KB Output is correct
19 Correct 10 ms 14668 KB Output is correct
20 Correct 10 ms 14736 KB Output is correct
21 Correct 9 ms 14668 KB Output is correct
22 Correct 9 ms 14748 KB Output is correct
23 Correct 10 ms 14700 KB Output is correct
24 Correct 11 ms 14720 KB Output is correct
25 Correct 11 ms 14700 KB Output is correct
26 Correct 9 ms 14764 KB Output is correct
27 Correct 11 ms 14924 KB Output is correct
28 Correct 11 ms 14960 KB Output is correct
29 Correct 12 ms 14928 KB Output is correct
30 Correct 12 ms 14800 KB Output is correct
31 Correct 10 ms 14844 KB Output is correct
32 Correct 13 ms 14776 KB Output is correct
33 Correct 13 ms 14792 KB Output is correct
34 Correct 13 ms 14780 KB Output is correct
35 Correct 10 ms 14796 KB Output is correct
36 Correct 17 ms 14900 KB Output is correct
37 Correct 12 ms 14924 KB Output is correct
38 Correct 13 ms 14924 KB Output is correct
39 Correct 11 ms 14924 KB Output is correct
40 Correct 10 ms 14824 KB Output is correct
41 Correct 11 ms 14832 KB Output is correct
42 Correct 368 ms 38804 KB Output is correct
43 Correct 652 ms 52316 KB Output is correct
44 Correct 98 ms 21072 KB Output is correct
45 Correct 723 ms 47376 KB Output is correct
46 Correct 264 ms 48900 KB Output is correct
47 Correct 10 ms 14728 KB Output is correct
48 Correct 10 ms 14668 KB Output is correct
49 Correct 9 ms 14668 KB Output is correct
50 Correct 236 ms 49612 KB Output is correct
51 Correct 339 ms 51200 KB Output is correct
52 Correct 562 ms 42320 KB Output is correct
53 Correct 466 ms 42220 KB Output is correct
54 Correct 546 ms 42244 KB Output is correct
55 Correct 786 ms 37752 KB Output is correct
56 Correct 689 ms 51180 KB Output is correct
57 Correct 631 ms 51672 KB Output is correct
58 Correct 535 ms 57516 KB Output is correct
59 Correct 790 ms 49292 KB Output is correct
60 Correct 675 ms 51084 KB Output is correct
61 Correct 760 ms 51888 KB Output is correct
62 Correct 2025 ms 57144 KB Output is correct
63 Correct 299 ms 47852 KB Output is correct
64 Correct 15 ms 15240 KB Output is correct
65 Correct 15 ms 15236 KB Output is correct
66 Correct 2327 ms 57232 KB Output is correct
67 Correct 40 ms 17936 KB Output is correct
68 Correct 54 ms 20144 KB Output is correct
69 Correct 828 ms 49232 KB Output is correct
70 Correct 106 ms 25696 KB Output is correct
71 Correct 288 ms 48620 KB Output is correct
72 Correct 911 ms 49292 KB Output is correct
73 Correct 2167 ms 57264 KB Output is correct