oj.uz

Submission #434987

# Submission time Handle Problem Language Result Execution time Memory
434987 2021-06-22T17:22:24 Z model_code Keys (IOI21_keys) C++17
100 / 100
 1584 ms 52776 KB 
#include <bits/stdc++.h>
using namespace std;

// randomized solution
// terminate early if visited
const int n_max = 300500;

vector<int> keylist;
vector<int> visited_list;
vector<int> blocked_list;
bool has_key[n_max];
bool visited[n_max];
int homekey[n_max];
int a[n_max];
vector<pair<int,int>> adj[n_max];
bool finished[n_max];

vector<int> blocked[n_max];

void cleanup() {

    for(int i: blocked_list) {
        blocked[i].clear();
    }
    blocked_list.clear();

    for(int i: visited_list) {
        visited[i] = false;
        has_key[homekey[i]] = false;
    }
    visited_list.clear();
    keylist.clear();
}

int explore(int x) {
    queue<int> bfs;
    bfs.push(x);
    int counter = 1;

    visited[x] = true;
    while(!bfs.empty()) {
        int next = bfs.front();
        bfs.pop();
        if(!has_key[homekey[next]]) {
            has_key[homekey[next]] = true;
            for(int i: blocked[homekey[next]]) {
                if(!visited[i]) {
                    visited_list.push_back(i);
                    visited[i] = true;
                    if(finished[i]) {
                        return 1e6;
                    }
                    counter++;
                    bfs.push(i);
                }
            }
            blocked[homekey[next]].clear();
        }
        for(pair<int,int> p: adj[next]) {
            if(visited[p.second]) continue;
            if(has_key[p.first]) {
                visited_list.push_back(p.second);
                visited[p.second] = true;
                if(finished[p.second]) {
                    return 1e6;
                }
                counter++;
                bfs.push(p.second);
            } else {
                blocked_list.push_back(p.first);
                blocked[p.first].push_back(p.second);
            }
        }
    }
    for(int i: visited_list) {
        a[i] = min(a[i], counter);
    }
    return counter;
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    int m = c.size();
    int n = r.size();
    for(int i=0; i<n; i++) {
        a[i] = 1e6;
    }
    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<n; i++) {
        homekey[i] = r[i];
    }
    int s = n+1;
    vector<int> p(2*m);
    for(int i=0; i<m; i++) {
        p[2*i] = u[i];
        p[2*i+1] = v[i];
    }
    shuffle(p.begin(), p.end(), rng);
    for(int i: p) {
        if(!finished[i]) {
            a[i] = min(a[i], explore(i));
            finished[i] = true;
            visited[i] = false;
            has_key[homekey[i]] = false;
            cleanup();
            s = min(s, a[i]);
        }
    }
    for(int i=0; i<n; i++) {
        if(!finished[i]) {
            a[i] = min(a[i], explore(i));
            finished[i] = true;
            visited[i] = false;
            has_key[homekey[i]] = false;
            cleanup();
            s = min(s, a[i]);
        }
    }

    vector<int> ans(n);

    for(int i=0; i<n; i++) {
        if(a[i]==s) {
            ans[i] = 1;
        }
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14412 KB Output is correct
2 Correct 17 ms 14440 KB Output is correct
3 Correct 13 ms 14440 KB Output is correct
4 Correct 36 ms 14344 KB Output is correct
5 Correct 11 ms 14420 KB Output is correct
6 Correct 14 ms 14424 KB Output is correct
7 Correct 10 ms 14416 KB Output is correct
8 Correct 13 ms 14412 KB Output is correct
9 Correct 12 ms 14392 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14412 KB Output is correct
2 Correct 17 ms 14440 KB Output is correct
3 Correct 13 ms 14440 KB Output is correct
4 Correct 36 ms 14344 KB Output is correct
5 Correct 11 ms 14420 KB Output is correct
6 Correct 14 ms 14424 KB Output is correct
7 Correct 10 ms 14416 KB Output is correct
8 Correct 13 ms 14412 KB Output is correct
9 Correct 12 ms 14392 KB Output is correct
10 Correct 11 ms 14460 KB Output is correct
11 Correct 10 ms 14360 KB Output is correct
12 Correct 12 ms 14360 KB Output is correct
13 Correct 14 ms 14444 KB Output is correct
14 Correct 12 ms 14420 KB Output is correct
15 Correct 12 ms 14464 KB Output is correct
16 Correct 11 ms 14356 KB Output is correct
17 Correct 11 ms 14340 KB Output is correct
18 Correct 12 ms 14412 KB Output is correct
19 Correct 12 ms 14436 KB Output is correct
20 Correct 11 ms 14412 KB Output is correct
21 Correct 11 ms 14360 KB Output is correct
22 Correct 12 ms 14452 KB Output is correct
23 Correct 11 ms 14412 KB Output is correct
24 Correct 13 ms 14452 KB Output is correct
25 Correct 11 ms 14380 KB Output is correct
26 Correct 10 ms 14412 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14412 KB Output is correct
2 Correct 17 ms 14440 KB Output is correct
3 Correct 13 ms 14440 KB Output is correct
4 Correct 36 ms 14344 KB Output is correct
5 Correct 11 ms 14420 KB Output is correct
6 Correct 14 ms 14424 KB Output is correct
7 Correct 10 ms 14416 KB Output is correct
8 Correct 13 ms 14412 KB Output is correct
9 Correct 12 ms 14392 KB Output is correct
10 Correct 11 ms 14460 KB Output is correct
11 Correct 10 ms 14360 KB Output is correct
12 Correct 12 ms 14360 KB Output is correct
13 Correct 14 ms 14444 KB Output is correct
14 Correct 12 ms 14420 KB Output is correct
15 Correct 12 ms 14464 KB Output is correct
16 Correct 11 ms 14356 KB Output is correct
17 Correct 11 ms 14340 KB Output is correct
18 Correct 12 ms 14412 KB Output is correct
19 Correct 12 ms 14436 KB Output is correct
20 Correct 11 ms 14412 KB Output is correct
21 Correct 11 ms 14360 KB Output is correct
22 Correct 12 ms 14452 KB Output is correct
23 Correct 11 ms 14412 KB Output is correct
24 Correct 13 ms 14452 KB Output is correct
25 Correct 11 ms 14380 KB Output is correct
26 Correct 10 ms 14412 KB Output is correct
27 Correct 12 ms 14668 KB Output is correct
28 Correct 19 ms 14668 KB Output is correct
29 Correct 16 ms 14628 KB Output is correct
30 Correct 13 ms 14540 KB Output is correct
31 Correct 13 ms 14512 KB Output is correct
32 Correct 11 ms 14412 KB Output is correct
33 Correct 14 ms 14412 KB Output is correct
34 Correct 13 ms 14412 KB Output is correct
35 Correct 13 ms 14488 KB Output is correct
36 Correct 11 ms 14576 KB Output is correct
37 Correct 24 ms 14604 KB Output is correct
38 Correct 12 ms 14540 KB Output is correct
39 Correct 15 ms 14540 KB Output is correct
40 Correct 12 ms 14540 KB Output is correct
41 Correct 12 ms 14540 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14412 KB Output is correct
2 Correct 17 ms 14440 KB Output is correct
3 Correct 13 ms 14440 KB Output is correct
4 Correct 36 ms 14344 KB Output is correct
5 Correct 11 ms 14420 KB Output is correct
6 Correct 14 ms 14424 KB Output is correct
7 Correct 10 ms 14416 KB Output is correct
8 Correct 13 ms 14412 KB Output is correct
9 Correct 12 ms 14392 KB Output is correct
10 Correct 546 ms 36508 KB Output is correct
11 Correct 503 ms 46992 KB Output is correct
12 Correct 69 ms 19516 KB Output is correct
13 Correct 502 ms 38292 KB Output is correct
14 Correct 459 ms 40868 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14412 KB Output is correct
2 Correct 17 ms 14440 KB Output is correct
3 Correct 13 ms 14440 KB Output is correct
4 Correct 36 ms 14344 KB Output is correct
5 Correct 11 ms 14420 KB Output is correct
6 Correct 14 ms 14424 KB Output is correct
7 Correct 10 ms 14416 KB Output is correct
8 Correct 13 ms 14412 KB Output is correct
9 Correct 12 ms 14392 KB Output is correct
10 Correct 11 ms 14460 KB Output is correct
11 Correct 10 ms 14360 KB Output is correct
12 Correct 12 ms 14360 KB Output is correct
13 Correct 14 ms 14444 KB Output is correct
14 Correct 12 ms 14420 KB Output is correct
15 Correct 12 ms 14464 KB Output is correct
16 Correct 11 ms 14356 KB Output is correct
17 Correct 11 ms 14340 KB Output is correct
18 Correct 12 ms 14412 KB Output is correct
19 Correct 12 ms 14436 KB Output is correct
20 Correct 11 ms 14412 KB Output is correct
21 Correct 11 ms 14360 KB Output is correct
22 Correct 12 ms 14452 KB Output is correct
23 Correct 11 ms 14412 KB Output is correct
24 Correct 13 ms 14452 KB Output is correct
25 Correct 11 ms 14380 KB Output is correct
26 Correct 10 ms 14412 KB Output is correct
27 Correct 12 ms 14668 KB Output is correct
28 Correct 19 ms 14668 KB Output is correct
29 Correct 16 ms 14628 KB Output is correct
30 Correct 13 ms 14540 KB Output is correct
31 Correct 13 ms 14512 KB Output is correct
32 Correct 11 ms 14412 KB Output is correct
33 Correct 14 ms 14412 KB Output is correct
34 Correct 13 ms 14412 KB Output is correct
35 Correct 13 ms 14488 KB Output is correct
36 Correct 11 ms 14576 KB Output is correct
37 Correct 24 ms 14604 KB Output is correct
38 Correct 12 ms 14540 KB Output is correct
39 Correct 15 ms 14540 KB Output is correct
40 Correct 12 ms 14540 KB Output is correct
41 Correct 12 ms 14540 KB Output is correct
42 Correct 546 ms 36508 KB Output is correct
43 Correct 503 ms 46992 KB Output is correct
44 Correct 69 ms 19516 KB Output is correct
45 Correct 502 ms 38292 KB Output is correct
46 Correct 459 ms 40868 KB Output is correct
47 Correct 12 ms 14444 KB Output is correct
48 Correct 12 ms 14412 KB Output is correct
49 Correct 11 ms 14440 KB Output is correct
50 Correct 407 ms 42552 KB Output is correct
51 Correct 462 ms 42452 KB Output is correct
52 Correct 992 ms 40480 KB Output is correct
53 Correct 984 ms 39996 KB Output is correct
54 Correct 829 ms 39848 KB Output is correct
55 Correct 686 ms 36904 KB Output is correct
56 Correct 1027 ms 45136 KB Output is correct
57 Correct 475 ms 44440 KB Output is correct
58 Correct 642 ms 52776 KB Output is correct
59 Correct 1584 ms 45352 KB Output is correct
60 Correct 1233 ms 43648 KB Output is correct
61 Correct 1221 ms 43528 KB Output is correct
62 Correct 999 ms 39336 KB Output is correct
63 Correct 313 ms 38884 KB Output is correct
64 Correct 15 ms 14880 KB Output is correct
65 Correct 15 ms 14872 KB Output is correct
66 Correct 953 ms 39388 KB Output is correct
67 Correct 39 ms 16972 KB Output is correct
68 Correct 62 ms 18920 KB Output is correct
69 Correct 1337 ms 45288 KB Output is correct
70 Correct 121 ms 23368 KB Output is correct
71 Correct 494 ms 40936 KB Output is correct
72 Correct 1419 ms 45284 KB Output is correct
73 Correct 1008 ms 39328 KB Output is correct