Submission #1022171

# Submission time Handle Problem Language Result Execution time Memory
1022171 2024-07-13T10:44:32 Z HappyCapybara Keys (IOI21_keys) C++17
37 / 100
3000 ms 23212 KB
#include <bits/stdc++.h>
using namespace std;

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c){
	int n = r.size(), m = u.size();
	vector<vector<int>> g(n);
	unordered_map<int,vector<int>> k;
	for (int i=0; i<m; i++){
		g[u[i]].push_back(i);
		g[v[i]].push_back(i);
		k[c[i]].push_back(i);
	}
	vector<int> res(n, 0);
	for (int i=0; i<n; i++){
		vector<bool> reach(m), seen(n), kf(n);
		queue<int> q;
		q.push(i);
		while (!q.empty()){
			int cur = q.front();
			q.pop();
			if (seen[cur]) continue;
			seen[cur] = true;
			res[i]++;
			for (int next : g[cur]){
				if (!reach[next] && kf[c[next]]){
					if (u[next] != cur) q.push(u[next]);
					else q.push(v[next]);
				}
				reach[next] = true;
			}
			if (!kf[r[cur]]){
				for (int next : k[r[cur]]){
					if (reach[next]){
						q.push(u[next]);
						q.push(v[next]);
					}
				}
			}
			kf[r[cur]] = true;
		}
	}
	int mnm = n;
	for (int x : res) mnm = min(mnm, x);
	vector<int> ans(n, 0);
	for (int i=0; i<n; i++){
		if (res[i] == mnm) ans[i] = 1;
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 39 ms 604 KB Output is correct
28 Correct 45 ms 604 KB Output is correct
29 Correct 41 ms 600 KB Output is correct
30 Correct 24 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 19 ms 584 KB Output is correct
35 Correct 26 ms 600 KB Output is correct
36 Correct 127 ms 728 KB Output is correct
37 Correct 101 ms 600 KB Output is correct
38 Correct 153 ms 788 KB Output is correct
39 Correct 167 ms 600 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 50 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Execution timed out 3018 ms 23212 KB Time limit exceeded
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 39 ms 604 KB Output is correct
28 Correct 45 ms 604 KB Output is correct
29 Correct 41 ms 600 KB Output is correct
30 Correct 24 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 19 ms 584 KB Output is correct
35 Correct 26 ms 600 KB Output is correct
36 Correct 127 ms 728 KB Output is correct
37 Correct 101 ms 600 KB Output is correct
38 Correct 153 ms 788 KB Output is correct
39 Correct 167 ms 600 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 50 ms 348 KB Output is correct
42 Execution timed out 3018 ms 23212 KB Time limit exceeded
43 Halted 0 ms 0 KB -