Submission #477000

# Submission time Handle Problem Language Result Execution time Memory
477000 2021-09-29T17:27:15 Z JvThunder Keys (IOI21_keys) C++17
100 / 100
858 ms 59564 KB
#include <bits/stdc++.h>
#include "keys.h"
using namespace std;

const int maxn = 3e5 + 5;
int n,m,p[maxn],r[maxn],fa[maxn];
int sz[maxn];

int find(int x) 
{ 
	if (fa[x]==x) return x; 
	return fa[x]=find(fa[x]); 
}

bool have[maxn],vis[maxn],mk[maxn];
int hd,tl,q[maxn];
vector<pair<int,int>> g[maxn];
vector<int> vec[maxn];
vector<int> ans;

int bfs(int s,bool flag=0) 
{
	hd=1,tl=0; int res=0;
	q[++tl]=s,vis[s]=1;
	while (hd<=tl) 
	{
		int x=q[hd]; hd++;
		if (!have[r[x]]) 
		{
			while (!vec[r[x]].empty()) 
			{
				int y=vec[r[x]].back();
				if (find(y)!=s) res = find(y);
				if (!vis[y]) q[++tl] = y, vis[y] = 1;
				vec[r[x]].pop_back();
			}
			have[r[x]]=1;
		}
		for (pair<int,int> A : g[x]) 
		{
			int y=A.first;
			if (have[A.second]) 
			{
				if (find(y)!=s) res = find(y);
				if (!vis[y]) q[++tl] = y , vis[y] = 1;
			} 
			else vec[A.second].push_back(y);
		}
		if (res) break;
	}
	for (int i=1;i<=tl;i++) vis[q[i]] = 0;
	for (int i=1;i<hd;i++) 
	{
		int x = q[i];
		have[r[x]] = 0;
		for (pair<int,int> A : g[x]) 
			vec[A.second].clear();
	}
	if (flag)
	{
		for (int i=1;i<=tl;i++) 
			ans[q[i]-1] = tl;
	}
	return res;
}
 
vector<int> find_reachable(vector<int> R,vector<int> U,vector<int> V, vector<int> C) 
{
	n = R.size(); m = U.size();
	for (int i=0;i<n;i++) r[i+1] = R[i] + 1;
	int x,y,z; 
	ans = vector<int> (n,n+1);
	for (int i=0;i<m;i++) 
	{
		x=U[i]+1,y=V[i]+1,z=C[i]+1;
		g[x].push_back({y,z}),g[y].push_back({x,z});
	}
	for (int i=1;i<=n;i++) fa[i] = i, sz[i] = 1;
	
	while (true) 
	{
		bool flag = false;
		for (int i=1;i<=n;i++) mk[i] = 0;
		for (int i=1;i<=n;i++) 
		{
			if (find(i)==i && !mk[i]) 
			{
				int t=bfs(i);
				if (t) fa[i]=t,mk[t]=1,flag=1;
				else mk[i]=1;
			}
		}
		if (!flag) break;
	}
	int mn = n+1;
	for (int i=1;i<=n;i++) 
		if (find(i)==i) bfs(i,1);
	for (int i=1;i<=n;i++) mn = min(mn,ans[i-1]);
	for (int i=1;i<=n;i++) 
	{
		if (mn==ans[i-1]) ans[i-1] = 1; 
		else ans[i-1] = 0;
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14344 KB Output is correct
5 Correct 11 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 8 ms 14464 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14344 KB Output is correct
5 Correct 11 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 8 ms 14464 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14400 KB Output is correct
12 Correct 8 ms 14412 KB Output is correct
13 Correct 8 ms 14400 KB Output is correct
14 Correct 9 ms 14400 KB Output is correct
15 Correct 9 ms 14340 KB Output is correct
16 Correct 8 ms 14412 KB Output is correct
17 Correct 8 ms 14412 KB Output is correct
18 Correct 9 ms 14412 KB Output is correct
19 Correct 9 ms 14396 KB Output is correct
20 Correct 9 ms 14364 KB Output is correct
21 Correct 9 ms 14412 KB Output is correct
22 Correct 10 ms 14396 KB Output is correct
23 Correct 9 ms 14392 KB Output is correct
24 Correct 9 ms 14356 KB Output is correct
25 Correct 9 ms 14396 KB Output is correct
26 Correct 8 ms 14412 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14344 KB Output is correct
5 Correct 11 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 8 ms 14464 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14400 KB Output is correct
12 Correct 8 ms 14412 KB Output is correct
13 Correct 8 ms 14400 KB Output is correct
14 Correct 9 ms 14400 KB Output is correct
15 Correct 9 ms 14340 KB Output is correct
16 Correct 8 ms 14412 KB Output is correct
17 Correct 8 ms 14412 KB Output is correct
18 Correct 9 ms 14412 KB Output is correct
19 Correct 9 ms 14396 KB Output is correct
20 Correct 9 ms 14364 KB Output is correct
21 Correct 9 ms 14412 KB Output is correct
22 Correct 10 ms 14396 KB Output is correct
23 Correct 9 ms 14392 KB Output is correct
24 Correct 9 ms 14356 KB Output is correct
25 Correct 9 ms 14396 KB Output is correct
26 Correct 8 ms 14412 KB Output is correct
27 Correct 9 ms 14664 KB Output is correct
28 Correct 9 ms 14708 KB Output is correct
29 Correct 9 ms 14660 KB Output is correct
30 Correct 10 ms 14532 KB Output is correct
31 Correct 10 ms 14520 KB Output is correct
32 Correct 9 ms 14540 KB Output is correct
33 Correct 9 ms 14412 KB Output is correct
34 Correct 9 ms 14584 KB Output is correct
35 Correct 9 ms 14540 KB Output is correct
36 Correct 9 ms 14640 KB Output is correct
37 Correct 10 ms 14540 KB Output is correct
38 Correct 9 ms 14660 KB Output is correct
39 Correct 11 ms 14668 KB Output is correct
40 Correct 10 ms 14540 KB Output is correct
41 Correct 9 ms 14604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14344 KB Output is correct
5 Correct 11 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 8 ms 14464 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 315 ms 39144 KB Output is correct
11 Correct 329 ms 48484 KB Output is correct
12 Correct 82 ms 20408 KB Output is correct
13 Correct 458 ms 43272 KB Output is correct
14 Correct 207 ms 46220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 8 ms 14344 KB Output is correct
5 Correct 11 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 8 ms 14464 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14400 KB Output is correct
12 Correct 8 ms 14412 KB Output is correct
13 Correct 8 ms 14400 KB Output is correct
14 Correct 9 ms 14400 KB Output is correct
15 Correct 9 ms 14340 KB Output is correct
16 Correct 8 ms 14412 KB Output is correct
17 Correct 8 ms 14412 KB Output is correct
18 Correct 9 ms 14412 KB Output is correct
19 Correct 9 ms 14396 KB Output is correct
20 Correct 9 ms 14364 KB Output is correct
21 Correct 9 ms 14412 KB Output is correct
22 Correct 10 ms 14396 KB Output is correct
23 Correct 9 ms 14392 KB Output is correct
24 Correct 9 ms 14356 KB Output is correct
25 Correct 9 ms 14396 KB Output is correct
26 Correct 8 ms 14412 KB Output is correct
27 Correct 9 ms 14664 KB Output is correct
28 Correct 9 ms 14708 KB Output is correct
29 Correct 9 ms 14660 KB Output is correct
30 Correct 10 ms 14532 KB Output is correct
31 Correct 10 ms 14520 KB Output is correct
32 Correct 9 ms 14540 KB Output is correct
33 Correct 9 ms 14412 KB Output is correct
34 Correct 9 ms 14584 KB Output is correct
35 Correct 9 ms 14540 KB Output is correct
36 Correct 9 ms 14640 KB Output is correct
37 Correct 10 ms 14540 KB Output is correct
38 Correct 9 ms 14660 KB Output is correct
39 Correct 11 ms 14668 KB Output is correct
40 Correct 10 ms 14540 KB Output is correct
41 Correct 9 ms 14604 KB Output is correct
42 Correct 315 ms 39144 KB Output is correct
43 Correct 329 ms 48484 KB Output is correct
44 Correct 82 ms 20408 KB Output is correct
45 Correct 458 ms 43272 KB Output is correct
46 Correct 207 ms 46220 KB Output is correct
47 Correct 8 ms 14380 KB Output is correct
48 Correct 7 ms 14396 KB Output is correct
49 Correct 8 ms 14412 KB Output is correct
50 Correct 213 ms 46328 KB Output is correct
51 Correct 220 ms 49012 KB Output is correct
52 Correct 304 ms 44408 KB Output is correct
53 Correct 290 ms 44404 KB Output is correct
54 Correct 307 ms 44356 KB Output is correct
55 Correct 522 ms 41104 KB Output is correct
56 Correct 695 ms 53452 KB Output is correct
57 Correct 358 ms 51436 KB Output is correct
58 Correct 355 ms 59564 KB Output is correct
59 Correct 553 ms 51520 KB Output is correct
60 Correct 348 ms 49424 KB Output is correct
61 Correct 497 ms 51528 KB Output is correct
62 Correct 847 ms 46396 KB Output is correct
63 Correct 194 ms 46124 KB Output is correct
64 Correct 11 ms 15080 KB Output is correct
65 Correct 10 ms 14924 KB Output is correct
66 Correct 853 ms 46396 KB Output is correct
67 Correct 29 ms 17608 KB Output is correct
68 Correct 40 ms 19644 KB Output is correct
69 Correct 539 ms 51456 KB Output is correct
70 Correct 73 ms 25156 KB Output is correct
71 Correct 199 ms 46736 KB Output is correct
72 Correct 561 ms 51464 KB Output is correct
73 Correct 858 ms 46412 KB Output is correct