oj.uz

답안 #434984

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

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

int n;
int explore(int x) {
    for(int i=0; i<n; i++) {
        visited[i] = false;
        has_key[i] = false;
        blocked[i].clear();
    }
    visited[x] = true;
    queue<int> q;
    q.push(x);
    int ans = 0;
    while(!q.empty()) {
        const int next = q.front();
        q.pop();
        ans++;

        int new_key = original_key[next];
        if(!has_key[new_key]) {
            has_key[new_key] = true;
            for(int i: blocked[new_key]) {
                if(!visited[i]) {
                    visited[i] = true;
                    q.push(i);
                }
            }
        }
        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);
                }
            } else { // it may be unblocked later
                //assert(p.first < k_max);
                blocked[p.first].push_back(p.second);
            }
        }
    }
    return ans;
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    int m = c.size();
    n = r.size();
    for(int i=0; i<n; i++) {
        original_key[i] = r[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]);
    }
    int a[n];
    int s = n+1;
    for(int i=0; i<n; i++) {
        a[i] = explore(i);
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14408 KB Output is correct
2 Correct 13 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 13 ms 14412 KB Output is correct
5 Correct 10 ms 14348 KB Output is correct
6 Correct 8 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 10 ms 14412 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14408 KB Output is correct
2 Correct 13 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 13 ms 14412 KB Output is correct
5 Correct 10 ms 14348 KB Output is correct
6 Correct 8 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 10 ms 14412 KB Output is correct
10 Correct 12 ms 14472 KB Output is correct
11 Correct 10 ms 14472 KB Output is correct
12 Correct 11 ms 14476 KB Output is correct
13 Correct 10 ms 14416 KB Output is correct
14 Correct 9 ms 14416 KB Output is correct
15 Correct 10 ms 14460 KB Output is correct
16 Correct 9 ms 14416 KB Output is correct
17 Correct 10 ms 14444 KB Output is correct
18 Correct 11 ms 14460 KB Output is correct
19 Correct 11 ms 14424 KB Output is correct
20 Correct 10 ms 14412 KB Output is correct
21 Correct 13 ms 14464 KB Output is correct
22 Correct 10 ms 14356 KB Output is correct
23 Correct 12 ms 14476 KB Output is correct
24 Correct 12 ms 14412 KB Output is correct
25 Correct 11 ms 14468 KB Output is correct
26 Correct 12 ms 14472 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14408 KB Output is correct
2 Correct 13 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 13 ms 14412 KB Output is correct
5 Correct 10 ms 14348 KB Output is correct
6 Correct 8 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 10 ms 14412 KB Output is correct
10 Correct 12 ms 14472 KB Output is correct
11 Correct 10 ms 14472 KB Output is correct
12 Correct 11 ms 14476 KB Output is correct
13 Correct 10 ms 14416 KB Output is correct
14 Correct 9 ms 14416 KB Output is correct
15 Correct 10 ms 14460 KB Output is correct
16 Correct 9 ms 14416 KB Output is correct
17 Correct 10 ms 14444 KB Output is correct
18 Correct 11 ms 14460 KB Output is correct
19 Correct 11 ms 14424 KB Output is correct
20 Correct 10 ms 14412 KB Output is correct
21 Correct 13 ms 14464 KB Output is correct
22 Correct 10 ms 14356 KB Output is correct
23 Correct 12 ms 14476 KB Output is correct
24 Correct 12 ms 14412 KB Output is correct
25 Correct 11 ms 14468 KB Output is correct
26 Correct 12 ms 14472 KB Output is correct
27 Correct 55 ms 14640 KB Output is correct
28 Correct 53 ms 14640 KB Output is correct
29 Correct 60 ms 14644 KB Output is correct
30 Correct 41 ms 14504 KB Output is correct
31 Correct 17 ms 14480 KB Output is correct
32 Correct 13 ms 14484 KB Output is correct
33 Correct 14 ms 14412 KB Output is correct
34 Correct 39 ms 14508 KB Output is correct
35 Correct 37 ms 14500 KB Output is correct
36 Correct 114 ms 14604 KB Output is correct
37 Correct 106 ms 14612 KB Output is correct
38 Correct 151 ms 14632 KB Output is correct
39 Correct 135 ms 14608 KB Output is correct
40 Correct 22 ms 14508 KB Output is correct
41 Correct 47 ms 14484 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14408 KB Output is correct
2 Correct 13 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 13 ms 14412 KB Output is correct
5 Correct 10 ms 14348 KB Output is correct
6 Correct 8 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 10 ms 14412 KB Output is correct
10 Execution timed out 3079 ms 33656 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14408 KB Output is correct
2 Correct 13 ms 14408 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 13 ms 14412 KB Output is correct
5 Correct 10 ms 14348 KB Output is correct
6 Correct 8 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 10 ms 14412 KB Output is correct
10 Correct 12 ms 14472 KB Output is correct
11 Correct 10 ms 14472 KB Output is correct
12 Correct 11 ms 14476 KB Output is correct
13 Correct 10 ms 14416 KB Output is correct
14 Correct 9 ms 14416 KB Output is correct
15 Correct 10 ms 14460 KB Output is correct
16 Correct 9 ms 14416 KB Output is correct
17 Correct 10 ms 14444 KB Output is correct
18 Correct 11 ms 14460 KB Output is correct
19 Correct 11 ms 14424 KB Output is correct
20 Correct 10 ms 14412 KB Output is correct
21 Correct 13 ms 14464 KB Output is correct
22 Correct 10 ms 14356 KB Output is correct
23 Correct 12 ms 14476 KB Output is correct
24 Correct 12 ms 14412 KB Output is correct
25 Correct 11 ms 14468 KB Output is correct
26 Correct 12 ms 14472 KB Output is correct
27 Correct 55 ms 14640 KB Output is correct
28 Correct 53 ms 14640 KB Output is correct
29 Correct 60 ms 14644 KB Output is correct
30 Correct 41 ms 14504 KB Output is correct
31 Correct 17 ms 14480 KB Output is correct
32 Correct 13 ms 14484 KB Output is correct
33 Correct 14 ms 14412 KB Output is correct
34 Correct 39 ms 14508 KB Output is correct
35 Correct 37 ms 14500 KB Output is correct
36 Correct 114 ms 14604 KB Output is correct
37 Correct 106 ms 14612 KB Output is correct
38 Correct 151 ms 14632 KB Output is correct
39 Correct 135 ms 14608 KB Output is correct
40 Correct 22 ms 14508 KB Output is correct
41 Correct 47 ms 14484 KB Output is correct
42 Execution timed out 3079 ms 33656 KB Time limit exceeded
43 Halted 0 ms 0 KB -