Submission #894390

# Submission time Handle Problem Language Result Execution time Memory
894390 2023-12-28T08:26:24 Z Trisanu_Das Keys (IOI21_keys) C++17
100 / 100
579 ms 60104 KB
#include <bits/stdc++.h>
using namespace std;
struct dsu {
	int n;
	vector<int> p;
	dsu(int _n): n(_n), p(_n) {
		iota(begin(p), end(p), 0);
	}
	int leader(int x) {
		return p[x] == x ? x : p[x] = leader(p[x]);
	}
};
vector<int> find_reachable(vector<int> r, vector<int> U, vector<int> V, vector<int> C) {
	const auto n = int(r.size()), m = int(U.size());
	vector<vector<pair<int, int>>> e(n);
	for (int i = 0; i < m; ++i) {
		e[U[i]].emplace_back(V[i], C[i]);
		e[V[i]].emplace_back(U[i], C[i]);
	}
	dsu d(n);
	auto num = numeric_limits<size_t>::max();
	vector<int> ans, solved(n);
	while (true) {
		vector nodes(n, vector<int>());
		vector<int> vis(n), changed, appear(n), res;
		auto BFS = [&] (int S) {
			for (int x: res)
				appear[r[x]] = 0;
			for (int x: changed)
				nodes[x].clear();
			res.clear(), changed.clear();
			queue<int> Q;
			Q.push(S);
			while (!empty(Q)) {
				const auto u = Q.front();
				Q.pop();
				if (S != d.leader(u)) {
					vis[d.leader(u)] = 1;
					d.p[S] = d.leader(u);
					return;
				}
				if (vis[u]) continue;
				vis[u] = 1, res.push_back(u);
				if (!appear[r[u]]) {
					appear[r[u]] = 1;
					for (int v: nodes[r[u]]) Q.push(v);
				}
				for (auto [v, c]: e[u])
					if (appear[c]) Q.push(v);
					else nodes[c].push_back(v), changed.push_back(c);
			}
			solved[S] = 1;
			if (size(res) < num) num = size(ans = res);
			else if (size(res) == num)
				for (int x: res) ans.push_back(x);
		};
		bool hav = 0;
		for (int i = 0; i < n; ++i)
			if (d.leader(i) == i && !vis[i] && !solved[i])
				hav = 1, BFS(i);
		if (!hav) break;
	}
	vector<int> ret(n);
	for (int x: ans) ret[x] = 1;
	return ret;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 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 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 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 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 156 ms 26288 KB Output is correct
11 Correct 186 ms 50712 KB Output is correct
12 Correct 31 ms 8512 KB Output is correct
13 Correct 196 ms 42828 KB Output is correct
14 Correct 149 ms 46680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 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 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 156 ms 26288 KB Output is correct
43 Correct 186 ms 50712 KB Output is correct
44 Correct 31 ms 8512 KB Output is correct
45 Correct 196 ms 42828 KB Output is correct
46 Correct 149 ms 46680 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 436 KB Output is correct
50 Correct 132 ms 47308 KB Output is correct
51 Correct 145 ms 49744 KB Output is correct
52 Correct 195 ms 36892 KB Output is correct
53 Correct 171 ms 36964 KB Output is correct
54 Correct 176 ms 36832 KB Output is correct
55 Correct 200 ms 31640 KB Output is correct
56 Correct 286 ms 50884 KB Output is correct
57 Correct 188 ms 52436 KB Output is correct
58 Correct 211 ms 60104 KB Output is correct
59 Correct 295 ms 46300 KB Output is correct
60 Correct 251 ms 41216 KB Output is correct
61 Correct 286 ms 42712 KB Output is correct
62 Correct 579 ms 37280 KB Output is correct
63 Correct 139 ms 37208 KB Output is correct
64 Correct 3 ms 1624 KB Output is correct
65 Correct 3 ms 1116 KB Output is correct
66 Correct 572 ms 37768 KB Output is correct
67 Correct 15 ms 4760 KB Output is correct
68 Correct 26 ms 8000 KB Output is correct
69 Correct 292 ms 45532 KB Output is correct
70 Correct 50 ms 15644 KB Output is correct
71 Correct 158 ms 47184 KB Output is correct
72 Correct 301 ms 45528 KB Output is correct
73 Correct 542 ms 38152 KB Output is correct