oj.uz

Submission #558978

# Submission time Handle Problem Language Result Execution time Memory
558978 2022-05-09T05:53:08 Z nghiass001 Keys (IOI21_keys) C++17
100 / 100
 1128 ms 63328 KB 
#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i=(l); i<=(r); ++i)
#define REP(i,l,r) for(int i=(l); i<(r); ++i)
#define FORD(i,r,l) for(int i=(r); i>=(l); --i)
#define REPD(i,r,l) for(int i=(r)-1; i>=(l); --i)
#define pii pair<int, int>
using namespace std;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 3e5 + 5;
int n, m, key_in[N], is_key[N], avail[N];
int finished[N], sol[N];
vector<pii> S[N];
vector<int> list_node[N], list_key, Q;

void solve(int u) {
    for(int v : list_key) {
        list_node[v].clear();
    }
    for(int v : Q) {
        is_key[key_in[v]] = 0;
        avail[v] = 0;
    }
    list_key.clear();
    Q.clear();

    int cnt = 1;
    avail[u] = 1;
    Q.push_back(u);
    REP(i, 0, (int)Q.size()) {
        u = Q[i];
        if (!is_key[key_in[u]]) {
            is_key[key_in[u]] = 1;
            for(int v : list_node[key_in[u]]) if (!avail[v]) {
                if (finished[v]) return;
                ++cnt;
                avail[v] = 1;
                Q.push_back(v);
            }
            list_node[key_in[u]].clear();
        }
        for(auto [v, type] : S[u]) if (!avail[v]) {
            if (is_key[type]) {
                if (finished[v]) return;
                ++cnt;
                avail[v] = 1;
                Q.push_back(v);
            }
            else {
                list_key.push_back(type);
                list_node[type].push_back(v);
            }
        }
    }

    for(int v : Q) sol[v] = min(sol[v], cnt);
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    n = r.size();
    m = u.size();
    REP(i, 0, n) key_in[i] = r[i];
    REP(i, 0, m) {
        S[u[i]].emplace_back(v[i], c[i]);
        S[v[i]].emplace_back(u[i], c[i]);
    }

    vector<int> tmp;
    REP(i, 0, n) REP(j, 0, (int)S[i].size()) tmp.push_back(i);
    shuffle(tmp.begin(), tmp.end(), rd);

    int mini = 1e6;
    REP(i, 0, n) sol[i] = 1e6;
    for(int i : tmp) if (!finished[i]) {
        solve(i);
        finished[i] = true;
        mini = min(mini, sol[i]);
    }
    REP(i, 0, n) if (!finished[i]) {
        solve(i);
        finished[i] = true;
        mini = min(mini, sol[i]);
    }

    vector<int> ans(n, 0);
    REP(i, 0, n) ans[i] = (mini == sol[i]);
	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14376 KB Output is correct
2 Correct 8 ms 14332 KB Output is correct
3 Correct 8 ms 14332 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 10 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14376 KB Output is correct
2 Correct 8 ms 14332 KB Output is correct
3 Correct 8 ms 14332 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 10 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 16 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14364 KB Output is correct
14 Correct 8 ms 14404 KB Output is correct
15 Correct 9 ms 14400 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 11 ms 14392 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14376 KB Output is correct
22 Correct 8 ms 14404 KB Output is correct
23 Correct 8 ms 14412 KB Output is correct
24 Correct 9 ms 14404 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 8 ms 14392 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14376 KB Output is correct
2 Correct 8 ms 14332 KB Output is correct
3 Correct 8 ms 14332 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 10 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 16 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14364 KB Output is correct
14 Correct 8 ms 14404 KB Output is correct
15 Correct 9 ms 14400 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 11 ms 14392 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14376 KB Output is correct
22 Correct 8 ms 14404 KB Output is correct
23 Correct 8 ms 14412 KB Output is correct
24 Correct 9 ms 14404 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 8 ms 14392 KB Output is correct
27 Correct 11 ms 14676 KB Output is correct
28 Correct 9 ms 14676 KB Output is correct
29 Correct 10 ms 14676 KB Output is correct
30 Correct 9 ms 14548 KB Output is correct
31 Correct 10 ms 14548 KB Output is correct
32 Correct 10 ms 14420 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 10 ms 14548 KB Output is correct
35 Correct 9 ms 14548 KB Output is correct
36 Correct 10 ms 14672 KB Output is correct
37 Correct 10 ms 14676 KB Output is correct
38 Correct 11 ms 14676 KB Output is correct
39 Correct 10 ms 14676 KB Output is correct
40 Correct 9 ms 14468 KB Output is correct
41 Correct 9 ms 14552 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14376 KB Output is correct
2 Correct 8 ms 14332 KB Output is correct
3 Correct 8 ms 14332 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 10 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 428 ms 38648 KB Output is correct
11 Correct 278 ms 52784 KB Output is correct
12 Correct 47 ms 20808 KB Output is correct
13 Correct 277 ms 44832 KB Output is correct
14 Correct 330 ms 48880 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14376 KB Output is correct
2 Correct 8 ms 14332 KB Output is correct
3 Correct 8 ms 14332 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 10 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 16 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14364 KB Output is correct
14 Correct 8 ms 14404 KB Output is correct
15 Correct 9 ms 14400 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 11 ms 14392 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14376 KB Output is correct
22 Correct 8 ms 14404 KB Output is correct
23 Correct 8 ms 14412 KB Output is correct
24 Correct 9 ms 14404 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 8 ms 14392 KB Output is correct
27 Correct 11 ms 14676 KB Output is correct
28 Correct 9 ms 14676 KB Output is correct
29 Correct 10 ms 14676 KB Output is correct
30 Correct 9 ms 14548 KB Output is correct
31 Correct 10 ms 14548 KB Output is correct
32 Correct 10 ms 14420 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 10 ms 14548 KB Output is correct
35 Correct 9 ms 14548 KB Output is correct
36 Correct 10 ms 14672 KB Output is correct
37 Correct 10 ms 14676 KB Output is correct
38 Correct 11 ms 14676 KB Output is correct
39 Correct 10 ms 14676 KB Output is correct
40 Correct 9 ms 14468 KB Output is correct
41 Correct 9 ms 14552 KB Output is correct
42 Correct 428 ms 38648 KB Output is correct
43 Correct 278 ms 52784 KB Output is correct
44 Correct 47 ms 20808 KB Output is correct
45 Correct 277 ms 44832 KB Output is correct
46 Correct 330 ms 48880 KB Output is correct
47 Correct 7 ms 14408 KB Output is correct
48 Correct 8 ms 14368 KB Output is correct
49 Correct 7 ms 14404 KB Output is correct
50 Correct 235 ms 49004 KB Output is correct
51 Correct 296 ms 51636 KB Output is correct
52 Correct 604 ms 47076 KB Output is correct
53 Correct 597 ms 47256 KB Output is correct
54 Correct 606 ms 46456 KB Output is correct
55 Correct 484 ms 43652 KB Output is correct
56 Correct 663 ms 56440 KB Output is correct
57 Correct 337 ms 54960 KB Output is correct
58 Correct 323 ms 63328 KB Output is correct
59 Correct 1128 ms 53972 KB Output is correct
60 Correct 959 ms 52404 KB Output is correct
61 Correct 896 ms 52432 KB Output is correct
62 Correct 730 ms 46812 KB Output is correct
63 Correct 232 ms 46936 KB Output is correct
64 Correct 12 ms 15020 KB Output is correct
65 Correct 11 ms 14932 KB Output is correct
66 Correct 703 ms 46756 KB Output is correct
67 Correct 28 ms 17800 KB Output is correct
68 Correct 42 ms 20020 KB Output is correct
69 Correct 1094 ms 53972 KB Output is correct
70 Correct 109 ms 25688 KB Output is correct
71 Correct 287 ms 49400 KB Output is correct
72 Correct 1061 ms 53948 KB Output is correct
73 Correct 711 ms 46832 KB Output is correct