oj.uz

답안 #435156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435156 2021-06-23T04:27:20 Z Elegia 열쇠 (IOI21_keys) C++17
100 / 100
 2228 ms 115388 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, stky;
	auto push = [&](int x) {
		stk.push(x);
		stky.push(-1);
		vis[x] = -2;
	};
	auto simul = [&]() {
		while (!stk.empty()) {
			int x = stk.top(), &y = stky.top();
			if (y == -1) {
				if (edge[x].empty()) {
					vis[x] = sz[x];
					stk.pop();
					stky.pop();
					continue;
				}
				y = find(edge[x].back());
				edge[x].pop_back();
			} else {
				y = find(y);
				if (vis[y] > 0 || vis[y] == -1) {
					vis[x] = -1;
					stk.pop();
					stky.pop();
					continue;
				}
				y = -1; continue;
			}
			if (y == x) { y = -1; continue; }
			if (vis[y] > 0 || vis[y] == -1) {
				vis[x] = -1;
				stk.pop();
				stky.pop();
				continue;
			}
			if (vis[y] == -2) {
				while (stk.top() != y) {
					stk.pop();
					stky.pop();
					mer(stk.top(), x);
				}
				continue;
			}
			push(y);
		}
	};
	for (int i = 0; i != n; ++i) if (dsu[i] == i && vis[i] == 0) {
		push(i);
		simul();
	}
	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;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 280 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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 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 280 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 0 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 280 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

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 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 280 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 0 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 280 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 4 ms 1100 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 588 KB Output is correct
31 Correct 1 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 588 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 5 ms 972 KB Output is correct
37 Correct 3 ms 972 KB Output is correct
38 Correct 4 ms 972 KB Output is correct
39 Correct 4 ms 1100 KB Output is correct
40 Correct 3 ms 716 KB Output is correct
41 Correct 3 ms 844 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 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 280 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 954 ms 78664 KB Output is correct
11 Correct 809 ms 91784 KB Output is correct
12 Correct 197 ms 21664 KB Output is correct
13 Correct 879 ms 105632 KB Output is correct
14 Correct 318 ms 94332 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 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 280 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 0 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 280 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 4 ms 1100 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 588 KB Output is correct
31 Correct 1 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 588 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 5 ms 972 KB Output is correct
37 Correct 3 ms 972 KB Output is correct
38 Correct 4 ms 972 KB Output is correct
39 Correct 4 ms 1100 KB Output is correct
40 Correct 3 ms 716 KB Output is correct
41 Correct 3 ms 844 KB Output is correct
42 Correct 954 ms 78664 KB Output is correct
43 Correct 809 ms 91784 KB Output is correct
44 Correct 197 ms 21664 KB Output is correct
45 Correct 879 ms 105632 KB Output is correct
46 Correct 318 ms 94332 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 349 ms 93240 KB Output is correct
51 Correct 356 ms 93124 KB Output is correct
52 Correct 616 ms 81784 KB Output is correct
53 Correct 687 ms 81716 KB Output is correct
54 Correct 651 ms 81736 KB Output is correct
55 Correct 1329 ms 85188 KB Output is correct
56 Correct 886 ms 109712 KB Output is correct
57 Correct 586 ms 105960 KB Output is correct
58 Correct 1119 ms 115388 KB Output is correct
59 Correct 2097 ms 105028 KB Output is correct
60 Correct 991 ms 96220 KB Output is correct
61 Correct 1536 ms 97276 KB Output is correct
62 Correct 1469 ms 85268 KB Output is correct
63 Correct 424 ms 90052 KB Output is correct
64 Correct 8 ms 1868 KB Output is correct
65 Correct 7 ms 1868 KB Output is correct
66 Correct 1497 ms 85356 KB Output is correct
67 Correct 46 ms 9796 KB Output is correct
68 Correct 65 ms 15928 KB Output is correct
69 Correct 2175 ms 103556 KB Output is correct
70 Correct 115 ms 31772 KB Output is correct
71 Correct 338 ms 94452 KB Output is correct
72 Correct 2228 ms 104716 KB Output is correct
73 Correct 1454 ms 85272 KB Output is correct