Submission #742924

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
742924	2023-05-17T06:10:49 Z	Mauve	Keys (IOI21_keys)	C++17	37 / 100	254 ms	20804 KB

keys

#include<bits/stdc++.h>
using namespace std; 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
const int maxn = 2010; vector <pii> edge[maxn];int cnt[maxn];int mn = mod;vector <int> ans;
int f[maxn];int R[maxn];
vector <int> v[maxn];
bool vis[maxn];int n,m; 
int getf(int x) {
	if (f[x]==x) return x;	
	else return f[x] = getf(f[x]);
} 
int solve(int node) {
		memset(vis,false,sizeof(vis));
			rep(i,0,n) {
				f[i] = i;		
				while (!v[i].empty()) v[i].pop_back();
				v[i].pb(i);
			}	
			vector <int> tmp;	
			tmp.pb(R[node]);	
			vis[R[node]]=true;	
			while (!tmp.empty()) {
				int cur = tmp.back();	
					tmp.pop_back();	
						for (auto it:edge[cur]) {	
							int uu = getf(it.fi),vv=getf(it.se);	
							if (uu==vv) continue;		
							if (vv==getf(node)) swap(uu,vv);	
							if (uu==getf(node)) {		
							for (int x:v[vv]) {	
							if (!vis[R[x]]) vis[R[x]]=true,tmp.pb(R[x]);
							}
							}		
							if (SZ(v[uu])<SZ(v[vv])) swap(uu,vv);		
							while (!v[vv].empty()) v[uu].pb(v[vv].back()),v[vv].pop_back();	
							f[vv]=uu;	
						}
			}
	return SZ(v[getf(node)]);
}
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
		n = SZ(r);
		rep(i,0,SZ(r)) R[i]= r[i];	
		rep(i,0,SZ(u)) edge[c[i]].pb({u[i],v[i]});	
		rep(i,0,SZ(r)) cnt[i] = solve(i),mn = min(mn,cnt[i]);	
		rep(i,0,SZ(r)) {		
			if (cnt[i]==mn) ans.pb(1);
			else ans.pb(0);	
		}
		return ans;
	}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	408 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	380 KB	Output is correct
8	Correct	1 ms	404 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	408 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	380 KB	Output is correct
8	Correct	1 ms	404 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	2 ms	468 KB	Output is correct
12	Correct	2 ms	404 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	2 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	408 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	404 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	468 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 ms	596 KB	Output is correct

Subtask #3
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	408 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	380 KB	Output is correct
8	Correct	1 ms	404 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	2 ms	468 KB	Output is correct
12	Correct	2 ms	404 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	2 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	408 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	404 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	468 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 ms	596 KB	Output is correct
27	Correct	87 ms	5960 KB	Output is correct
28	Correct	86 ms	5876 KB	Output is correct
29	Correct	83 ms	5884 KB	Output is correct
30	Correct	25 ms	2124 KB	Output is correct
31	Correct	7 ms	468 KB	Output is correct
32	Correct	2 ms	468 KB	Output is correct
33	Correct	6 ms	468 KB	Output is correct
34	Correct	32 ms	4380 KB	Output is correct
35	Correct	39 ms	3424 KB	Output is correct
36	Correct	149 ms	12572 KB	Output is correct
37	Correct	143 ms	12584 KB	Output is correct
38	Correct	246 ms	15788 KB	Output is correct
39	Correct	254 ms	15820 KB	Output is correct
40	Correct	22 ms	1028 KB	Output is correct
41	Correct	53 ms	2168 KB	Output is correct

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	408 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	380 KB	Output is correct
8	Correct	1 ms	404 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Runtime error	95 ms	20804 KB	Execution killed with signal 11
11	Halted	0 ms	0 KB	-

Subtask #5
0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	408 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	380 KB	Output is correct
8	Correct	1 ms	404 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	2 ms	468 KB	Output is correct
12	Correct	2 ms	404 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	2 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	408 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	404 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	468 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 ms	596 KB	Output is correct
27	Correct	87 ms	5960 KB	Output is correct
28	Correct	86 ms	5876 KB	Output is correct
29	Correct	83 ms	5884 KB	Output is correct
30	Correct	25 ms	2124 KB	Output is correct
31	Correct	7 ms	468 KB	Output is correct
32	Correct	2 ms	468 KB	Output is correct
33	Correct	6 ms	468 KB	Output is correct
34	Correct	32 ms	4380 KB	Output is correct
35	Correct	39 ms	3424 KB	Output is correct
36	Correct	149 ms	12572 KB	Output is correct
37	Correct	143 ms	12584 KB	Output is correct
38	Correct	246 ms	15788 KB	Output is correct
39	Correct	254 ms	15820 KB	Output is correct
40	Correct	22 ms	1028 KB	Output is correct
41	Correct	53 ms	2168 KB	Output is correct
42	Runtime error	95 ms	20804 KB	Execution killed with signal 11
43	Halted	0 ms	0 KB	-

Submission #742924

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 11.0 / 11.0

Subtask #3 17.0 / 17.0

Subtask #4 0 / 30.0

Subtask #5 0 / 33.0

Subtask #1
9.0 / 9.0

Subtask #2
11.0 / 11.0

Subtask #3
17.0 / 17.0

Subtask #4
0 / 30.0

Subtask #5
0 / 33.0