oj.uz

Submission #439985

# Submission time Handle Problem Language Result Execution time Memory
439985 2021-07-01T10:38:42 Z haojiandan Keys (IOI21_keys) C++17
100 / 100
 1222 ms 51568 KB 
#include <bits/stdc++.h>
#include "keys.h"
using namespace std;
#define MP make_pair
const int maxn=(3e5)+10;
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=(int)R.size();
	for (int i=0;i<n;i++) r[i+1]=R[i]+1;
	m=(int)U.size(); 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(MP(y,z)),g[y].push_back(MP(x,z));
	}
	for (int i=1;i<=n;i++) fa[i]=i,sz[i]=1;
	
	while (1) {
		bool flag=0;
		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=0;i<n;i++) printf("%d ",ans[i]); puts("");
	for (int i=1;i<=n;i++) if (mn==ans[i-1]) ans[i-1]=1; else ans[i-1]=0;
	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14428 KB Output is correct
2 Correct 11 ms 14340 KB Output is correct
3 Correct 10 ms 14428 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 11 ms 14412 KB Output is correct
7 Correct 10 ms 14412 KB Output is correct
8 Correct 11 ms 14412 KB Output is correct
9 Correct 10 ms 14372 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14428 KB Output is correct
2 Correct 11 ms 14340 KB Output is correct
3 Correct 10 ms 14428 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 11 ms 14412 KB Output is correct
7 Correct 10 ms 14412 KB Output is correct
8 Correct 11 ms 14412 KB Output is correct
9 Correct 10 ms 14372 KB Output is correct
10 Correct 11 ms 14348 KB Output is correct
11 Correct 9 ms 14412 KB Output is correct
12 Correct 11 ms 14412 KB Output is correct
13 Correct 10 ms 14412 KB Output is correct
14 Correct 11 ms 14412 KB Output is correct
15 Correct 11 ms 14412 KB Output is correct
16 Correct 10 ms 14412 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 10 ms 14312 KB Output is correct
19 Correct 11 ms 14412 KB Output is correct
20 Correct 11 ms 14348 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 11 ms 14356 KB Output is correct
23 Correct 11 ms 14356 KB Output is correct
24 Correct 11 ms 14448 KB Output is correct
25 Correct 11 ms 14340 KB Output is correct
26 Correct 10 ms 14456 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14428 KB Output is correct
2 Correct 11 ms 14340 KB Output is correct
3 Correct 10 ms 14428 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 11 ms 14412 KB Output is correct
7 Correct 10 ms 14412 KB Output is correct
8 Correct 11 ms 14412 KB Output is correct
9 Correct 10 ms 14372 KB Output is correct
10 Correct 11 ms 14348 KB Output is correct
11 Correct 9 ms 14412 KB Output is correct
12 Correct 11 ms 14412 KB Output is correct
13 Correct 10 ms 14412 KB Output is correct
14 Correct 11 ms 14412 KB Output is correct
15 Correct 11 ms 14412 KB Output is correct
16 Correct 10 ms 14412 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 10 ms 14312 KB Output is correct
19 Correct 11 ms 14412 KB Output is correct
20 Correct 11 ms 14348 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 11 ms 14356 KB Output is correct
23 Correct 11 ms 14356 KB Output is correct
24 Correct 11 ms 14448 KB Output is correct
25 Correct 11 ms 14340 KB Output is correct
26 Correct 10 ms 14456 KB Output is correct
27 Correct 12 ms 14668 KB Output is correct
28 Correct 11 ms 14540 KB Output is correct
29 Correct 11 ms 14672 KB Output is correct
30 Correct 11 ms 14480 KB Output is correct
31 Correct 12 ms 14472 KB Output is correct
32 Correct 11 ms 14412 KB Output is correct
33 Correct 10 ms 14412 KB Output is correct
34 Correct 10 ms 14412 KB Output is correct
35 Correct 12 ms 14516 KB Output is correct
36 Correct 11 ms 14556 KB Output is correct
37 Correct 11 ms 14540 KB Output is correct
38 Correct 12 ms 14540 KB Output is correct
39 Correct 12 ms 14568 KB Output is correct
40 Correct 12 ms 14412 KB Output is correct
41 Correct 13 ms 14540 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14428 KB Output is correct
2 Correct 11 ms 14340 KB Output is correct
3 Correct 10 ms 14428 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 11 ms 14412 KB Output is correct
7 Correct 10 ms 14412 KB Output is correct
8 Correct 11 ms 14412 KB Output is correct
9 Correct 10 ms 14372 KB Output is correct
10 Correct 427 ms 34672 KB Output is correct
11 Correct 404 ms 44588 KB Output is correct
12 Correct 74 ms 19400 KB Output is correct
13 Correct 513 ms 38204 KB Output is correct
14 Correct 208 ms 40728 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14428 KB Output is correct
2 Correct 11 ms 14340 KB Output is correct
3 Correct 10 ms 14428 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 11 ms 14412 KB Output is correct
7 Correct 10 ms 14412 KB Output is correct
8 Correct 11 ms 14412 KB Output is correct
9 Correct 10 ms 14372 KB Output is correct
10 Correct 11 ms 14348 KB Output is correct
11 Correct 9 ms 14412 KB Output is correct
12 Correct 11 ms 14412 KB Output is correct
13 Correct 10 ms 14412 KB Output is correct
14 Correct 11 ms 14412 KB Output is correct
15 Correct 11 ms 14412 KB Output is correct
16 Correct 10 ms 14412 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 10 ms 14312 KB Output is correct
19 Correct 11 ms 14412 KB Output is correct
20 Correct 11 ms 14348 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 11 ms 14356 KB Output is correct
23 Correct 11 ms 14356 KB Output is correct
24 Correct 11 ms 14448 KB Output is correct
25 Correct 11 ms 14340 KB Output is correct
26 Correct 10 ms 14456 KB Output is correct
27 Correct 12 ms 14668 KB Output is correct
28 Correct 11 ms 14540 KB Output is correct
29 Correct 11 ms 14672 KB Output is correct
30 Correct 11 ms 14480 KB Output is correct
31 Correct 12 ms 14472 KB Output is correct
32 Correct 11 ms 14412 KB Output is correct
33 Correct 10 ms 14412 KB Output is correct
34 Correct 10 ms 14412 KB Output is correct
35 Correct 12 ms 14516 KB Output is correct
36 Correct 11 ms 14556 KB Output is correct
37 Correct 11 ms 14540 KB Output is correct
38 Correct 12 ms 14540 KB Output is correct
39 Correct 12 ms 14568 KB Output is correct
40 Correct 12 ms 14412 KB Output is correct
41 Correct 13 ms 14540 KB Output is correct
42 Correct 427 ms 34672 KB Output is correct
43 Correct 404 ms 44588 KB Output is correct
44 Correct 74 ms 19400 KB Output is correct
45 Correct 513 ms 38204 KB Output is correct
46 Correct 208 ms 40728 KB Output is correct
47 Correct 10 ms 14412 KB Output is correct
48 Correct 9 ms 14412 KB Output is correct
49 Correct 9 ms 14412 KB Output is correct
50 Correct 208 ms 41960 KB Output is correct
51 Correct 236 ms 41400 KB Output is correct
52 Correct 356 ms 39332 KB Output is correct
53 Correct 375 ms 39364 KB Output is correct
54 Correct 383 ms 39364 KB Output is correct
55 Correct 634 ms 35380 KB Output is correct
56 Correct 956 ms 45508 KB Output is correct
57 Correct 399 ms 43476 KB Output is correct
58 Correct 400 ms 51568 KB Output is correct
59 Correct 675 ms 44392 KB Output is correct
60 Correct 396 ms 42888 KB Output is correct
61 Correct 674 ms 44516 KB Output is correct
62 Correct 1174 ms 40100 KB Output is correct
63 Correct 221 ms 39560 KB Output is correct
64 Correct 14 ms 14876 KB Output is correct
65 Correct 14 ms 14872 KB Output is correct
66 Correct 1163 ms 40344 KB Output is correct
67 Correct 30 ms 17092 KB Output is correct
68 Correct 42 ms 18764 KB Output is correct
69 Correct 784 ms 44460 KB Output is correct
70 Correct 81 ms 23124 KB Output is correct
71 Correct 217 ms 40744 KB Output is correct
72 Correct 640 ms 44624 KB Output is correct
73 Correct 1222 ms 40192 KB Output is correct