oj.uz

Submission #791886

# Submission time Handle Problem Language Result Execution time Memory
791886 2023-07-24T12:11:12 Z IvanJ Keys (IOI21_keys) C++17
100 / 100
 560 ms 61120 KB 
#include "keys.h"
#include<bits/stdc++.h>

#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 3e5 + 5;

int n, m;
int r[maxn];
int par[maxn];
int dead[maxn];
int vis[maxn];
int lst[maxn];
int has[maxn];
vector<int> todo[maxn];
vector<ii> adj[maxn];
int sz;
vector<int> ans;

int find(int x) {return (x == par[x]) ? x : par[x] = find(par[x]);}
void merge(int x, int y) {par[find(x)] = find(y);}

vector<int> seen, sol;
void reset() {
	for(int i : sol) has[r[i]] = 0;
	for(int i : seen) todo[i].clear();
	seen.clear(), sol.clear();
}

void bfs(int X, int num) {
	lst[X] = num;
	queue<int> q;
	q.push(X);
	
	while(q.size()) {
		int x = q.front();q.pop();
		if(find(x) != X) {
			merge(X, x);
			lst[find(x)] = num;
			reset();
			return;
		}
		if(vis[x]) continue;
		vis[x] = 1, sol.pb(x);
		
		int key = r[x];
		if(has[key] == 0) {
			has[key] = 1;
			for(int i : todo[key]) q.push(i);
			todo[key].clear();
		}
		
		for(ii p : adj[x]) {
			if(has[p.y]) q.push(p.x);
			else todo[p.y].pb(p.x), seen.pb(p.y);
		}
	}
	
	dead[X] = 1;
	if((int)sol.size() < sz)
		sz = (int)sol.size(), ans.clear();
	if((int)sol.size() == sz) 
		for(int i : sol) ans.pb(i);
	reset();
}


vector<int> find_reachable(vector<int> _r, vector<int> u, vector<int> v, vector<int> c) {
	n = (int)_r.size();
	m = (int)u.size();
	for(int i = 0;i < n;i++) r[i] = _r[i];
	
	for(int i = 0;i < m;i++) 
		adj[u[i]].pb({v[i], c[i]}), adj[v[i]].pb({u[i], c[i]});
	
	for(int i = 0;i < n;i++) par[i] = i;
	
	sz = n + 1;
	int cnt = 1;
	while(1) {
		int flag = 0;
		memset(vis, 0, sizeof vis);
		for(int i = 0;i < n;i++) 
			if(find(i) == i && dead[i] == 0 && lst[i] < cnt)
				bfs(i, cnt), flag = 1;
		cnt++;
		if(flag == 0) break;
	}
	
	vector<int> ret(n, 0);
	for(int i : ans) ret[i] = 1;
	return ret;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15512 KB Output is correct
2 Correct 7 ms 15496 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15548 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 8 ms 15572 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15512 KB Output is correct
2 Correct 7 ms 15496 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15548 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 8 ms 15572 KB Output is correct
10 Correct 7 ms 15572 KB Output is correct
11 Correct 7 ms 15572 KB Output is correct
12 Correct 9 ms 15544 KB Output is correct
13 Correct 8 ms 15572 KB Output is correct
14 Correct 8 ms 15572 KB Output is correct
15 Correct 8 ms 15572 KB Output is correct
16 Correct 9 ms 15572 KB Output is correct
17 Correct 7 ms 15572 KB Output is correct
18 Correct 8 ms 15572 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Correct 8 ms 15572 KB Output is correct
21 Correct 7 ms 15632 KB Output is correct
22 Correct 7 ms 15572 KB Output is correct
23 Correct 8 ms 15572 KB Output is correct
24 Correct 7 ms 15616 KB Output is correct
25 Correct 7 ms 15572 KB Output is correct
26 Correct 7 ms 15572 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15512 KB Output is correct
2 Correct 7 ms 15496 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15548 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 8 ms 15572 KB Output is correct
10 Correct 7 ms 15572 KB Output is correct
11 Correct 7 ms 15572 KB Output is correct
12 Correct 9 ms 15544 KB Output is correct
13 Correct 8 ms 15572 KB Output is correct
14 Correct 8 ms 15572 KB Output is correct
15 Correct 8 ms 15572 KB Output is correct
16 Correct 9 ms 15572 KB Output is correct
17 Correct 7 ms 15572 KB Output is correct
18 Correct 8 ms 15572 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Correct 8 ms 15572 KB Output is correct
21 Correct 7 ms 15632 KB Output is correct
22 Correct 7 ms 15572 KB Output is correct
23 Correct 8 ms 15572 KB Output is correct
24 Correct 7 ms 15616 KB Output is correct
25 Correct 7 ms 15572 KB Output is correct
26 Correct 7 ms 15572 KB Output is correct
27 Correct 8 ms 15828 KB Output is correct
28 Correct 8 ms 15828 KB Output is correct
29 Correct 8 ms 15828 KB Output is correct
30 Correct 8 ms 15700 KB Output is correct
31 Correct 9 ms 15656 KB Output is correct
32 Correct 7 ms 15572 KB Output is correct
33 Correct 8 ms 15668 KB Output is correct
34 Correct 8 ms 15700 KB Output is correct
35 Correct 8 ms 15700 KB Output is correct
36 Correct 9 ms 15700 KB Output is correct
37 Correct 9 ms 15700 KB Output is correct
38 Correct 9 ms 15700 KB Output is correct
39 Correct 8 ms 15828 KB Output is correct
40 Correct 8 ms 15700 KB Output is correct
41 Correct 8 ms 15712 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15512 KB Output is correct
2 Correct 7 ms 15496 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15548 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 8 ms 15572 KB Output is correct
10 Correct 145 ms 36600 KB Output is correct
11 Correct 197 ms 47948 KB Output is correct
12 Correct 36 ms 21648 KB Output is correct
13 Correct 192 ms 44968 KB Output is correct
14 Correct 137 ms 47480 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15512 KB Output is correct
2 Correct 7 ms 15496 KB Output is correct
3 Correct 7 ms 15572 KB Output is correct
4 Correct 7 ms 15572 KB Output is correct
5 Correct 7 ms 15548 KB Output is correct
6 Correct 7 ms 15572 KB Output is correct
7 Correct 7 ms 15572 KB Output is correct
8 Correct 7 ms 15572 KB Output is correct
9 Correct 8 ms 15572 KB Output is correct
10 Correct 7 ms 15572 KB Output is correct
11 Correct 7 ms 15572 KB Output is correct
12 Correct 9 ms 15544 KB Output is correct
13 Correct 8 ms 15572 KB Output is correct
14 Correct 8 ms 15572 KB Output is correct
15 Correct 8 ms 15572 KB Output is correct
16 Correct 9 ms 15572 KB Output is correct
17 Correct 7 ms 15572 KB Output is correct
18 Correct 8 ms 15572 KB Output is correct
19 Correct 7 ms 15572 KB Output is correct
20 Correct 8 ms 15572 KB Output is correct
21 Correct 7 ms 15632 KB Output is correct
22 Correct 7 ms 15572 KB Output is correct
23 Correct 8 ms 15572 KB Output is correct
24 Correct 7 ms 15616 KB Output is correct
25 Correct 7 ms 15572 KB Output is correct
26 Correct 7 ms 15572 KB Output is correct
27 Correct 8 ms 15828 KB Output is correct
28 Correct 8 ms 15828 KB Output is correct
29 Correct 8 ms 15828 KB Output is correct
30 Correct 8 ms 15700 KB Output is correct
31 Correct 9 ms 15656 KB Output is correct
32 Correct 7 ms 15572 KB Output is correct
33 Correct 8 ms 15668 KB Output is correct
34 Correct 8 ms 15700 KB Output is correct
35 Correct 8 ms 15700 KB Output is correct
36 Correct 9 ms 15700 KB Output is correct
37 Correct 9 ms 15700 KB Output is correct
38 Correct 9 ms 15700 KB Output is correct
39 Correct 8 ms 15828 KB Output is correct
40 Correct 8 ms 15700 KB Output is correct
41 Correct 8 ms 15712 KB Output is correct
42 Correct 145 ms 36600 KB Output is correct
43 Correct 197 ms 47948 KB Output is correct
44 Correct 36 ms 21648 KB Output is correct
45 Correct 192 ms 44968 KB Output is correct
46 Correct 137 ms 47480 KB Output is correct
47 Correct 8 ms 15572 KB Output is correct
48 Correct 8 ms 15520 KB Output is correct
49 Correct 7 ms 15572 KB Output is correct
50 Correct 123 ms 47900 KB Output is correct
51 Correct 155 ms 48904 KB Output is correct
52 Correct 194 ms 46148 KB Output is correct
53 Correct 186 ms 46068 KB Output is correct
54 Correct 170 ms 46148 KB Output is correct
55 Correct 233 ms 43456 KB Output is correct
56 Correct 258 ms 55692 KB Output is correct
57 Correct 199 ms 53736 KB Output is correct
58 Correct 262 ms 61120 KB Output is correct
59 Correct 286 ms 54000 KB Output is correct
60 Correct 244 ms 50184 KB Output is correct
61 Correct 297 ms 53116 KB Output is correct
62 Correct 497 ms 49144 KB Output is correct
63 Correct 142 ms 48212 KB Output is correct
64 Correct 9 ms 16084 KB Output is correct
65 Correct 9 ms 16124 KB Output is correct
66 Correct 496 ms 49124 KB Output is correct
67 Correct 25 ms 18728 KB Output is correct
68 Correct 29 ms 20944 KB Output is correct
69 Correct 319 ms 54012 KB Output is correct
70 Correct 50 ms 26184 KB Output is correct
71 Correct 141 ms 48112 KB Output is correct
72 Correct 272 ms 54028 KB Output is correct
73 Correct 560 ms 49200 KB Output is correct