Submission #805124

# Submission time Handle Problem Language Result Execution time Memory
805124 2023-08-03T13:12:36 Z eltu0815 Keys (IOI21_keys) C++17
100 / 100
1165 ms 62192 KB
#include "keys.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

int n, m, cnt;
int p[300005], vis[300005], used[300005], key[300005];
int parent[300005];
vector<int> vec[300005];
vector<pii> graph[300005];

int Find(int x) {
    if(parent[x] == x) return x;
    return parent[x] = Find(parent[x]);
}

int bfs(int i) {
    queue<int> q;
    vector<int> st1, st2;
    q.push(i);
    while(!q.empty()) {
        int cur = q.front();
        q.pop();
        if(Find(i) != Find(cur)) {
            for(auto v : st1) used[key[v]] = 0;
            for(auto v : st2) vec[v].clear();
            return cur;
        }
        
        if(vis[cur]) continue;
        vis[cur] = 1;
        
        st1.push_back(cur);
        if(!used[key[cur]]) {
            used[key[cur]] = 1;
            for(auto v : vec[key[cur]]) q.push(v);
        }
        for(auto v : graph[cur]) {
            if(used[v.second]) q.push(v.first);
            else st2.push_back(v.second), vec[v.second].push_back(v.first);
        }
    }
    for(auto v : st1) p[v] = st1.size(), used[key[v]] = 0;
    for(auto v : st2) vec[v].clear();
    return -1;
}

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	n = r.size(), m = u.size();	
	for(int i = 0; i < n; ++i) key[i] = r[i], parent[i] = i, p[i] = (int)(1e9);
	for(int i = 0; i < m; ++i) {
        graph[u[i]].push_back({v[i], c[i]});
        graph[v[i]].push_back({u[i], c[i]});
	}
	
	int flag = 1;
	while(flag) {
        flag = 0; ++cnt;
        vector<pii> lst;
        for(int i = 0; i < n; ++i) vis[i] = 0;
        for(int i = 0; i < n; ++i) {
            if(Find(i) != i) continue;
            int ret = bfs(i);
            if(ret != -1) lst.push_back({ret, i}), flag = 1;
        }
        for(auto v : lst) parent[Find(v.second)] = Find(v.first);
	}
    
    vector<int> ans;
    int mn = *min_element(p, p + n);
    for(int i = 0; i < n; ++i) ans.push_back(p[i] == mn);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14400 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14328 KB Output is correct
8 Correct 7 ms 14452 KB Output is correct
9 Correct 8 ms 14388 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14400 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14328 KB Output is correct
8 Correct 7 ms 14452 KB Output is correct
9 Correct 8 ms 14388 KB Output is correct
10 Correct 9 ms 14456 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 7 ms 14392 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14396 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 8 ms 14444 KB Output is correct
25 Correct 7 ms 14360 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14400 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14328 KB Output is correct
8 Correct 7 ms 14452 KB Output is correct
9 Correct 8 ms 14388 KB Output is correct
10 Correct 9 ms 14456 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 7 ms 14392 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14396 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 8 ms 14444 KB Output is correct
25 Correct 7 ms 14360 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
27 Correct 8 ms 14668 KB Output is correct
28 Correct 10 ms 14548 KB Output is correct
29 Correct 9 ms 14656 KB Output is correct
30 Correct 8 ms 14420 KB Output is correct
31 Correct 8 ms 14512 KB Output is correct
32 Correct 8 ms 14408 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 8 ms 14416 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 9 ms 14548 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 10 ms 14548 KB Output is correct
39 Correct 10 ms 14604 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 8 ms 14548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14400 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14328 KB Output is correct
8 Correct 7 ms 14452 KB Output is correct
9 Correct 8 ms 14388 KB Output is correct
10 Correct 204 ms 35960 KB Output is correct
11 Correct 204 ms 48564 KB Output is correct
12 Correct 49 ms 20672 KB Output is correct
13 Correct 327 ms 45848 KB Output is correct
14 Correct 173 ms 47508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14400 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14328 KB Output is correct
8 Correct 7 ms 14452 KB Output is correct
9 Correct 8 ms 14388 KB Output is correct
10 Correct 9 ms 14456 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 7 ms 14392 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14396 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 8 ms 14444 KB Output is correct
25 Correct 7 ms 14360 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
27 Correct 8 ms 14668 KB Output is correct
28 Correct 10 ms 14548 KB Output is correct
29 Correct 9 ms 14656 KB Output is correct
30 Correct 8 ms 14420 KB Output is correct
31 Correct 8 ms 14512 KB Output is correct
32 Correct 8 ms 14408 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 8 ms 14416 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 9 ms 14548 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 10 ms 14548 KB Output is correct
39 Correct 10 ms 14604 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 8 ms 14548 KB Output is correct
42 Correct 204 ms 35960 KB Output is correct
43 Correct 204 ms 48564 KB Output is correct
44 Correct 49 ms 20672 KB Output is correct
45 Correct 327 ms 45848 KB Output is correct
46 Correct 173 ms 47508 KB Output is correct
47 Correct 8 ms 14420 KB Output is correct
48 Correct 8 ms 14404 KB Output is correct
49 Correct 8 ms 14384 KB Output is correct
50 Correct 134 ms 47740 KB Output is correct
51 Correct 162 ms 50424 KB Output is correct
52 Correct 238 ms 45600 KB Output is correct
53 Correct 227 ms 45596 KB Output is correct
54 Correct 284 ms 45576 KB Output is correct
55 Correct 287 ms 41640 KB Output is correct
56 Correct 348 ms 55588 KB Output is correct
57 Correct 298 ms 52540 KB Output is correct
58 Correct 296 ms 62192 KB Output is correct
59 Correct 306 ms 53068 KB Output is correct
60 Correct 355 ms 52368 KB Output is correct
61 Correct 400 ms 53532 KB Output is correct
62 Correct 1165 ms 49000 KB Output is correct
63 Correct 189 ms 47912 KB Output is correct
64 Correct 10 ms 14932 KB Output is correct
65 Correct 10 ms 14932 KB Output is correct
66 Correct 1006 ms 49068 KB Output is correct
67 Correct 22 ms 17636 KB Output is correct
68 Correct 32 ms 19792 KB Output is correct
69 Correct 329 ms 53128 KB Output is correct
70 Correct 60 ms 25180 KB Output is correct
71 Correct 149 ms 48052 KB Output is correct
72 Correct 372 ms 53136 KB Output is correct
73 Correct 898 ms 49032 KB Output is correct