oj.uz

Submission #603171

# Submission time Handle Problem Language Result Execution time Memory
603171 2022-07-23T16:27:58 Z FatihSolak Keys (IOI21_keys) C++17
100 / 100
 712 ms 112608 KB 
#include <bits/stdc++.h>
#define N 300005
using namespace std;
int group[N];
int find(int a){
	if(a == group[a])return a;
	return group[a] = find(group[a]);
}
bool merge(int a,int b){
	a = find(a);
	b = find(b);
	if(a == b)
		return 0;
	group[a] = b;
	return 1;
}
int low[N];
int tin[N];
bool is_bridge[2*N];
int vis[N];
bool vis2[N];
bool nowkeys[N];
vector<int> key[N];
vector<int> edges[N];
vector<pair<int,int>> adj[N];
vector<int> adj0[N];
int timer;
int tmp = -1;
void dfs(int v,int par){
	tin[v] = timer++;
	low[v] = tin[v];
	vis[v] = tmp;
	for(auto u:adj[v]){
		if(u.first == par){
			continue;
		}
		if(vis[u.second] != -1){
			is_bridge[u.first] = 1;
			if(vis[u.second] != vis[v]){
				is_bridge[u.first] = 1;
			}
			else low[v] = min(low[v],tin[u.second]);
			continue;
		}
		dfs(u.second,u.first);
		if(low[u.second] > tin[v]){
			is_bridge[u.first] = 1;
		}
		low[v] = min(low[v],low[u.second]);
	}
}
void dfs2(int v){
	vis2[v] = 1;
	for(auto u:adj[v]){
		if(is_bridge[u.first])continue;
		merge(v,u.second);
		if(vis2[u.second])continue;
		dfs2(u.second);
	}
}
int sz[N];
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	int n = r.size();
	int m = u.size();
	vector<int> p(n,0);
	for(int i = 0;i<m;i++){
		adj0[u[i]].push_back(i);
		adj0[v[i]].push_back(i);
	}
	for(int i = 0;i<n;i++){
		group[i] = i;
	}
	for(int x = 0;x<5;x++){
		for(int i = 0;i<n;i++){
			key[i].clear();
			edges[i].clear();
			adj[i].clear();
			vis[i] = -1;
			vis2[i] = 0;
			sz[i] = 0;
			nowkeys[i] = 0;
		}
		for(int i = 0;i<2*m;i++){
			is_bridge[i] = 0;	
		}
		for(int i = 0;i<n;i++){
			key[find(i)].push_back(r[i]);
			for(auto x:adj0[i]){
				edges[find(i)].push_back(x);
			}
		}
		for(int i = 0;i<n;i++){
			if(i != find(i))continue;
			for(auto x:key[i]){
				nowkeys[x] = 1;
			}
			for(auto x:edges[i]){
				if(nowkeys[c[x]]){
					if(find(u[x]) != i)
						adj[i].push_back({x,find(u[x])});
					if(find(v[x]) != i)
						adj[i].push_back({x+m,find(v[x])});
				}
			}
			for(auto x:key[i]){
				nowkeys[x] = 0;
			}
		}
		timer = 0;
		for(int i = 0;i<n;i++){
			if(vis[i] == -1 && i == find(i)){
				tmp = i;
				dfs(i,-1);
			}
		}
		for(int i = 0;i<n;i++){
			if(i == find(i) && !vis2[i]){
				dfs2(i);
			}
		}
		for(int i = 0;i<n;i++){
			sz[find(i)]++;
		}
		int mini = 1e9;
		for(int i = 0;i<n;i++){
			if(sz[i] && adj[i].empty())
				mini = min(mini,sz[i]);
		}
		for(int i = 0;i<n;i++){
			if(sz[find(i)] == mini && adj[find(i)].empty()){
				p[i] = 1;
			}
			else p[i] = 0;
		}
	}

	return p;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28476 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 17 ms 28500 KB Output is correct
5 Correct 15 ms 28504 KB Output is correct
6 Correct 16 ms 28500 KB Output is correct
7 Correct 16 ms 28428 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 18 ms 28536 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28476 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 17 ms 28500 KB Output is correct
5 Correct 15 ms 28504 KB Output is correct
6 Correct 16 ms 28500 KB Output is correct
7 Correct 16 ms 28428 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 18 ms 28536 KB Output is correct
10 Correct 13 ms 28536 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 17 ms 28556 KB Output is correct
13 Correct 17 ms 28528 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 13 ms 28500 KB Output is correct
16 Correct 14 ms 28408 KB Output is correct
17 Correct 14 ms 28532 KB Output is correct
18 Correct 15 ms 28488 KB Output is correct
19 Correct 14 ms 28460 KB Output is correct
20 Correct 14 ms 28452 KB Output is correct
21 Correct 15 ms 28576 KB Output is correct
22 Correct 16 ms 28500 KB Output is correct
23 Correct 15 ms 28500 KB Output is correct
24 Correct 16 ms 28500 KB Output is correct
25 Correct 15 ms 28572 KB Output is correct
26 Correct 17 ms 28500 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28476 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 17 ms 28500 KB Output is correct
5 Correct 15 ms 28504 KB Output is correct
6 Correct 16 ms 28500 KB Output is correct
7 Correct 16 ms 28428 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 18 ms 28536 KB Output is correct
10 Correct 13 ms 28536 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 17 ms 28556 KB Output is correct
13 Correct 17 ms 28528 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 13 ms 28500 KB Output is correct
16 Correct 14 ms 28408 KB Output is correct
17 Correct 14 ms 28532 KB Output is correct
18 Correct 15 ms 28488 KB Output is correct
19 Correct 14 ms 28460 KB Output is correct
20 Correct 14 ms 28452 KB Output is correct
21 Correct 15 ms 28576 KB Output is correct
22 Correct 16 ms 28500 KB Output is correct
23 Correct 15 ms 28500 KB Output is correct
24 Correct 16 ms 28500 KB Output is correct
25 Correct 15 ms 28572 KB Output is correct
26 Correct 17 ms 28500 KB Output is correct
27 Correct 19 ms 28756 KB Output is correct
28 Correct 17 ms 28756 KB Output is correct
29 Correct 17 ms 28756 KB Output is correct
30 Correct 16 ms 28732 KB Output is correct
31 Correct 20 ms 28656 KB Output is correct
32 Correct 17 ms 28580 KB Output is correct
33 Correct 19 ms 28616 KB Output is correct
34 Correct 17 ms 28732 KB Output is correct
35 Correct 17 ms 28668 KB Output is correct
36 Correct 17 ms 28884 KB Output is correct
37 Correct 17 ms 28876 KB Output is correct
38 Correct 18 ms 28976 KB Output is correct
39 Correct 19 ms 29020 KB Output is correct
40 Correct 16 ms 28692 KB Output is correct
41 Correct 16 ms 28756 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28476 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 17 ms 28500 KB Output is correct
5 Correct 15 ms 28504 KB Output is correct
6 Correct 16 ms 28500 KB Output is correct
7 Correct 16 ms 28428 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 18 ms 28536 KB Output is correct
10 Correct 330 ms 58004 KB Output is correct
11 Correct 530 ms 93440 KB Output is correct
12 Correct 100 ms 38860 KB Output is correct
13 Correct 712 ms 82652 KB Output is correct
14 Correct 299 ms 112608 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28476 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 17 ms 28500 KB Output is correct
5 Correct 15 ms 28504 KB Output is correct
6 Correct 16 ms 28500 KB Output is correct
7 Correct 16 ms 28428 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 18 ms 28536 KB Output is correct
10 Correct 13 ms 28536 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 17 ms 28556 KB Output is correct
13 Correct 17 ms 28528 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 13 ms 28500 KB Output is correct
16 Correct 14 ms 28408 KB Output is correct
17 Correct 14 ms 28532 KB Output is correct
18 Correct 15 ms 28488 KB Output is correct
19 Correct 14 ms 28460 KB Output is correct
20 Correct 14 ms 28452 KB Output is correct
21 Correct 15 ms 28576 KB Output is correct
22 Correct 16 ms 28500 KB Output is correct
23 Correct 15 ms 28500 KB Output is correct
24 Correct 16 ms 28500 KB Output is correct
25 Correct 15 ms 28572 KB Output is correct
26 Correct 17 ms 28500 KB Output is correct
27 Correct 19 ms 28756 KB Output is correct
28 Correct 17 ms 28756 KB Output is correct
29 Correct 17 ms 28756 KB Output is correct
30 Correct 16 ms 28732 KB Output is correct
31 Correct 20 ms 28656 KB Output is correct
32 Correct 17 ms 28580 KB Output is correct
33 Correct 19 ms 28616 KB Output is correct
34 Correct 17 ms 28732 KB Output is correct
35 Correct 17 ms 28668 KB Output is correct
36 Correct 17 ms 28884 KB Output is correct
37 Correct 17 ms 28876 KB Output is correct
38 Correct 18 ms 28976 KB Output is correct
39 Correct 19 ms 29020 KB Output is correct
40 Correct 16 ms 28692 KB Output is correct
41 Correct 16 ms 28756 KB Output is correct
42 Correct 330 ms 58004 KB Output is correct
43 Correct 530 ms 93440 KB Output is correct
44 Correct 100 ms 38860 KB Output is correct
45 Correct 712 ms 82652 KB Output is correct
46 Correct 299 ms 112608 KB Output is correct
47 Correct 16 ms 28644 KB Output is correct
48 Correct 18 ms 28488 KB Output is correct
49 Correct 15 ms 28512 KB Output is correct
50 Correct 300 ms 103316 KB Output is correct
51 Correct 319 ms 102932 KB Output is correct
52 Correct 347 ms 62456 KB Output is correct
53 Correct 314 ms 62384 KB Output is correct
54 Correct 367 ms 62480 KB Output is correct
55 Correct 294 ms 58656 KB Output is correct
56 Correct 675 ms 86432 KB Output is correct
57 Correct 406 ms 79540 KB Output is correct
58 Correct 406 ms 86268 KB Output is correct
59 Correct 567 ms 80872 KB Output is correct
60 Correct 533 ms 89992 KB Output is correct
61 Correct 548 ms 89984 KB Output is correct
62 Correct 487 ms 71620 KB Output is correct
63 Correct 255 ms 72580 KB Output is correct
64 Correct 20 ms 30036 KB Output is correct
65 Correct 21 ms 29940 KB Output is correct
66 Correct 468 ms 71644 KB Output is correct
67 Correct 45 ms 37068 KB Output is correct
68 Correct 64 ms 42704 KB Output is correct
69 Correct 550 ms 78632 KB Output is correct
70 Correct 136 ms 56420 KB Output is correct
71 Correct 309 ms 112608 KB Output is correct
72 Correct 546 ms 80864 KB Output is correct
73 Correct 459 ms 71508 KB Output is correct