Submission #435137

# Submission time Handle Problem Language Result Execution time Memory
435137 2021-06-23T03:51:51 Z Elegia Keys (IOI21_keys) C++17
100 / 100
2171 ms 135484 KB
#include <bits/stdc++.h>

using namespace std;

void merge(set<int>& x, set<int>& y) {
	if (x.size() < y.size()) swap(x, y);
	for (int i : y) x.insert(i);
	y.clear();
}
void merge(map<int, list<int>>& x, map<int, list<int>>& y) {
	if (x.size() < y.size()) swap(x, y);
	for (auto it = y.begin(); it != y.end(); ++it) {
		list<int>& l = x[it->first];
		l.splice(l.begin(), it->second);
	}
	y.clear();
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	int n = r.size(), m = u.size();
	vector<int> ans(n), dsu(n), sz(n, 1), vis(n);
	vector<set<int>> key(n);
	vector<map<int, list<int>>> candidate(n);
	vector<list<int>> edge(n);
	iota(dsu.begin(), dsu.end(), 0);
	function<int(int)> find = [&](int x) { return dsu[x] == x ? x : dsu[x] = find(dsu[x]); };
	auto activate = [&](const set<int>& kk, map<int, list<int>>& cc, list<int>& ed) {
		if (kk.size() < cc.size()) {
			for (int i : kk) {
				auto it = cc.find(i);
				if (it != cc.end()) {
					ed.splice(ed.begin(), it->second);
					cc.erase(it);
				}
			}
		} else {
			for (auto it = cc.begin(); it != cc.end();) if (kk.count(it->first)) {
				ed.splice(ed.begin(), it->second);
				cc.erase(it++);
			} else ++it;
		}
	};
	auto mer = [&](int x, int y) {
		x = find(x); y = find(y);
		if (x == y) return;
		activate(key[x], candidate[y], edge[x]);
		activate(key[y], candidate[x], edge[x]);
		edge[x].splice(edge[x].begin(), edge[y]);
		merge(key[x], key[y]);
		merge(candidate[x], candidate[y]);
		sz[x] += sz[y];
		dsu[y] = x;
	};

	for (int i = 0; i != m; ++i) {
		candidate[u[i]][c[i]].push_back(v[i]);
		candidate[v[i]][c[i]].push_back(u[i]);
	}
	for (int i = 0; i != n; ++i) {
		key[i].insert(r[i]);
		activate(key[i], candidate[i], edge[i]);
	}
	stack<int> stk;
	function<void(int)> dfs = [&](int x) {
		stk.push(x);
		vis[x] = -2;
		while (!edge[x].empty()) {
			int y = find(edge[x].back()); edge[x].pop_back();
			if (y == x) continue;
			if (vis[y] > 0 || vis[y] == -1) {
				vis[x] = -1;
				stk.pop();
				return;
			}
			if (vis[y] == -2) {
				while (stk.top() != y) {
					stk.pop();
					mer(stk.top(), x);
				}
				return;
			}
			dfs(y);
			if (stk.top() != x) return;
			y = find(y);
			if (vis[y] > 0 || vis[y] == -1) {
				vis[x] = -1;
				stk.pop();
				return;
			}
		}
		vis[x] = sz[x];
		stk.pop();
		return;
	};
	for (int i = 0; i != n; ++i) if (dsu[i] == i && vis[i] == 0)
		dfs(i);
	int minv = n + 1;
	for (int i = 0; i != n; ++i) if (vis[i] > 0) minv = min(minv, vis[i]);
	for (int i = 0; i != n; ++i) ans[i] = vis[find(i)] == minv;

	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 972 KB Output is correct
28 Correct 3 ms 1100 KB Output is correct
29 Correct 3 ms 1100 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 2 ms 716 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 4 ms 1228 KB Output is correct
37 Correct 4 ms 1228 KB Output is correct
38 Correct 4 ms 1356 KB Output is correct
39 Correct 4 ms 1356 KB Output is correct
40 Correct 2 ms 716 KB Output is correct
41 Correct 3 ms 844 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 968 ms 83680 KB Output is correct
11 Correct 844 ms 91868 KB Output is correct
12 Correct 162 ms 21652 KB Output is correct
13 Correct 912 ms 105680 KB Output is correct
14 Correct 374 ms 135484 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 972 KB Output is correct
28 Correct 3 ms 1100 KB Output is correct
29 Correct 3 ms 1100 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 2 ms 716 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 4 ms 1228 KB Output is correct
37 Correct 4 ms 1228 KB Output is correct
38 Correct 4 ms 1356 KB Output is correct
39 Correct 4 ms 1356 KB Output is correct
40 Correct 2 ms 716 KB Output is correct
41 Correct 3 ms 844 KB Output is correct
42 Correct 968 ms 83680 KB Output is correct
43 Correct 844 ms 91868 KB Output is correct
44 Correct 162 ms 21652 KB Output is correct
45 Correct 912 ms 105680 KB Output is correct
46 Correct 374 ms 135484 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 323 ms 113764 KB Output is correct
51 Correct 440 ms 113620 KB Output is correct
52 Correct 671 ms 81732 KB Output is correct
53 Correct 629 ms 81752 KB Output is correct
54 Correct 639 ms 81680 KB Output is correct
55 Correct 1316 ms 92956 KB Output is correct
56 Correct 892 ms 116308 KB Output is correct
57 Correct 563 ms 106052 KB Output is correct
58 Correct 1161 ms 115380 KB Output is correct
59 Correct 2171 ms 113752 KB Output is correct
60 Correct 1014 ms 106604 KB Output is correct
61 Correct 1494 ms 124696 KB Output is correct
62 Correct 1445 ms 85268 KB Output is correct
63 Correct 390 ms 89820 KB Output is correct
64 Correct 8 ms 2508 KB Output is correct
65 Correct 7 ms 2636 KB Output is correct
66 Correct 1444 ms 85268 KB Output is correct
67 Correct 45 ms 14152 KB Output is correct
68 Correct 68 ms 22708 KB Output is correct
69 Correct 2126 ms 115964 KB Output is correct
70 Correct 121 ms 45384 KB Output is correct
71 Correct 367 ms 135464 KB Output is correct
72 Correct 2112 ms 115832 KB Output is correct
73 Correct 1329 ms 85272 KB Output is correct