oj.uz

Submission #434986

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

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();
}

stack<int> st;
void reverse_search(int x) {
    st.push(x);
    while(!st.empty()) {
        x = st.top();
        st.pop();
        for(auto p: adj[x]) {
            if(homekey[p.second] == p.first and !finished[p.second]) {
                finished[p.second] = true;
                st.push(p.second);
            }
        }
    }
}

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);
    }
    reverse_search(x);
    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;

    // bug: instead of distributing them according to their degrees
    // make a uniformly random permutation instead
    vector<int> p(n);
    for(int i=0; i<n; i++) {
        p[i] = 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]);
        }
    }

    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 9 ms 14416 KB Output is correct
2 Correct 15 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 33 ms 14328 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14416 KB Output is correct
2 Correct 15 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 33 ms 14328 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct
10 Correct 13 ms 14412 KB Output is correct
11 Correct 12 ms 14412 KB Output is correct
12 Correct 14 ms 14384 KB Output is correct
13 Correct 12 ms 14412 KB Output is correct
14 Correct 10 ms 14336 KB Output is correct
15 Correct 11 ms 14412 KB Output is correct
16 Correct 10 ms 14328 KB Output is correct
17 Correct 11 ms 14444 KB Output is correct
18 Correct 17 ms 14404 KB Output is correct
19 Correct 18 ms 14412 KB Output is correct
20 Correct 13 ms 14444 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 12 ms 14464 KB Output is correct
23 Correct 11 ms 14416 KB Output is correct
24 Correct 13 ms 14364 KB Output is correct
25 Correct 12 ms 14348 KB Output is correct
26 Correct 12 ms 14376 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14416 KB Output is correct
2 Correct 15 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 33 ms 14328 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct
10 Correct 13 ms 14412 KB Output is correct
11 Correct 12 ms 14412 KB Output is correct
12 Correct 14 ms 14384 KB Output is correct
13 Correct 12 ms 14412 KB Output is correct
14 Correct 10 ms 14336 KB Output is correct
15 Correct 11 ms 14412 KB Output is correct
16 Correct 10 ms 14328 KB Output is correct
17 Correct 11 ms 14444 KB Output is correct
18 Correct 17 ms 14404 KB Output is correct
19 Correct 18 ms 14412 KB Output is correct
20 Correct 13 ms 14444 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 12 ms 14464 KB Output is correct
23 Correct 11 ms 14416 KB Output is correct
24 Correct 13 ms 14364 KB Output is correct
25 Correct 12 ms 14348 KB Output is correct
26 Correct 12 ms 14376 KB Output is correct
27 Correct 14 ms 14668 KB Output is correct
28 Correct 12 ms 14668 KB Output is correct
29 Correct 13 ms 14668 KB Output is correct
30 Correct 13 ms 14536 KB Output is correct
31 Correct 12 ms 14412 KB Output is correct
32 Correct 11 ms 14464 KB Output is correct
33 Correct 14 ms 14412 KB Output is correct
34 Correct 18 ms 14412 KB Output is correct
35 Correct 11 ms 14412 KB Output is correct
36 Correct 13 ms 14544 KB Output is correct
37 Correct 13 ms 14540 KB Output is correct
38 Correct 13 ms 14540 KB Output is correct
39 Correct 12 ms 14612 KB Output is correct
40 Correct 11 ms 14416 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 9 ms 14416 KB Output is correct
2 Correct 15 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 33 ms 14328 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct
10 Correct 347 ms 34524 KB Output is correct
11 Correct 1609 ms 45704 KB Output is correct
12 Correct 104 ms 19256 KB Output is correct
13 Correct 380 ms 37136 KB Output is correct
14 Correct 200 ms 39704 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14416 KB Output is correct
2 Correct 15 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 33 ms 14328 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct
10 Correct 13 ms 14412 KB Output is correct
11 Correct 12 ms 14412 KB Output is correct
12 Correct 14 ms 14384 KB Output is correct
13 Correct 12 ms 14412 KB Output is correct
14 Correct 10 ms 14336 KB Output is correct
15 Correct 11 ms 14412 KB Output is correct
16 Correct 10 ms 14328 KB Output is correct
17 Correct 11 ms 14444 KB Output is correct
18 Correct 17 ms 14404 KB Output is correct
19 Correct 18 ms 14412 KB Output is correct
20 Correct 13 ms 14444 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 12 ms 14464 KB Output is correct
23 Correct 11 ms 14416 KB Output is correct
24 Correct 13 ms 14364 KB Output is correct
25 Correct 12 ms 14348 KB Output is correct
26 Correct 12 ms 14376 KB Output is correct
27 Correct 14 ms 14668 KB Output is correct
28 Correct 12 ms 14668 KB Output is correct
29 Correct 13 ms 14668 KB Output is correct
30 Correct 13 ms 14536 KB Output is correct
31 Correct 12 ms 14412 KB Output is correct
32 Correct 11 ms 14464 KB Output is correct
33 Correct 14 ms 14412 KB Output is correct
34 Correct 18 ms 14412 KB Output is correct
35 Correct 11 ms 14412 KB Output is correct
36 Correct 13 ms 14544 KB Output is correct
37 Correct 13 ms 14540 KB Output is correct
38 Correct 13 ms 14540 KB Output is correct
39 Correct 12 ms 14612 KB Output is correct
40 Correct 11 ms 14416 KB Output is correct
41 Correct 12 ms 14540 KB Output is correct
42 Correct 347 ms 34524 KB Output is correct
43 Correct 1609 ms 45704 KB Output is correct
44 Correct 104 ms 19256 KB Output is correct
45 Correct 380 ms 37136 KB Output is correct
46 Correct 200 ms 39704 KB Output is correct
47 Correct 10 ms 14412 KB Output is correct
48 Correct 10 ms 14412 KB Output is correct
49 Correct 10 ms 14412 KB Output is correct
50 Correct 183 ms 41748 KB Output is correct
51 Correct 204 ms 41276 KB Output is correct
52 Correct 714 ms 38968 KB Output is correct
53 Correct 765 ms 39148 KB Output is correct
54 Correct 738 ms 38852 KB Output is correct
55 Correct 624 ms 34956 KB Output is correct
56 Correct 484 ms 41544 KB Output is correct
57 Correct 457 ms 41100 KB Output is correct
58 Execution timed out 3085 ms 50220 KB Time limit exceeded
59 Halted 0 ms 0 KB -