oj.uz

Submission #435860

# Submission time Handle Problem Language Result Execution time Memory
435860 2021-06-23T19:55:07 Z Noam527 Keys (IOI21_keys) C++17
100 / 100
 2078 ms 130260 KB 
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 3e18;
const int OO = 0;
using namespace std;

const int N = 3e5 + 5;

struct group {
	int root;
	int state; // 0,1,2
	int cursed; // 0,1
	set<pair<int, int>> e;
	set<int> k;
	vector<int> q;
	group() {}
	int work() {
		while (q.size()) {
			int ke = q.back();
			auto it = e.lower_bound(make_pair(ke, -1));
			if (it != e.end() && it->first == ke) {
				int res = it->second;
				e.erase(it);
				return res;
			}
			q.pop_back();
		}
		return -1;
	}
};

int par[N];
group groups[N];

int root(int x) {
	if (x == par[x]) return x;
	return par[x] = root(par[x]);
}

void merge(group &G, group &H) {
	par[H.root] = G.root;
	if (G.q.size() < H.q.size()) {
		swap(G.q, H.q);
	}
	if (G.e.size() < H.e.size()) {
		swap(G.e, H.e);
	}
	if (G.k.size() < H.k.size()) {
		swap(G.k, H.k);
	}

	G.cursed = max(G.cursed, H.cursed);
	for (const auto &i : H.q)
		G.q.push_back(i);
	H.q.clear();
	for (const auto &i : H.e) {
		if (G.k.count(i.first) || H.k.count(i.first)) {
			G.q.push_back(i.first);
		}
		G.e.insert(i);
	}
	H.e.clear();
	for (const auto &i : H.k) {
		auto it = G.e.lower_bound(make_pair(i, -1));
		auto it2 = H.e.lower_bound(make_pair(i, -1));
		if ((it != G.e.end() && it->first == i) || (it2 != H.e.end() && it2->first == i)) {
			G.q.push_back(i);
		}
		G.k.insert(i);
	}
	H.k.clear();
}



vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	int n = r.size(), m = u.size();
	for (int i = 0; i <= n; i++)
		par[i] = i;
	for (int i = 0; i < n; i++) {
		groups[i].root = i;
		groups[i].state = 0;
		groups[i].cursed = 0;
		groups[i].k.insert(r[i]);
		groups[i].q.push_back(r[i]);
	}
	for (int i = 0; i < m; i++) {
		groups[u[i]].e.insert(make_pair(c[i], v[i]));
		groups[v[i]].e.insert(make_pair(c[i], u[i]));
	}
	groups[n].root = n;
	groups[n].state = 1;
	groups[n].cursed = 1;
	groups[n].k.insert(0);
	groups[n].q.push_back(0);
	for (int i = 0; i < n; i++)
		groups[n].e.insert(groups[n].e.end(), make_pair(0, i));
	
	vector<int> stack = { n };
	while (stack.size()) {
		if (OO) {
			cout << "stack: ";
			for (const auto &i : stack) cout << i << " "; cout << '\n';
		}
		int r = stack.back();
		int v = groups[r].work();
		if (OO) {
			cout << "r, v: " << r << " " << v << '\n';
		}
		if (v == -1) {
			groups[r].state = 2;
			stack.pop_back();
			if (stack.size())
				groups[stack.back()].cursed = 1;
			continue;
		}
		v = root(v);
		if (OO) {
			cout << "root of v: " << v << '\n';
		}
		if (groups[v].state == 2) {
			if (OO) cout << "visited already :(\n";
			groups[r].cursed = 1;
			continue;
		}
		if (groups[v].state == 0) {
			if (OO) cout << "new!\n";
			groups[v].state = 1;
			stack.push_back(v);
			continue;
		}
		// cycle :)
		if (v == r) {
			if (OO) cout << "dumb cycle :(\n";
			// stupid cycle :(
			continue;
		}
		if (OO) cout << "good cycle\n";
		while (groups[stack.back()].root != v) {
			int x = stack.back();
			stack.pop_back();
			merge(groups[stack.back()], groups[x]);
		}
		if (OO) cout << '\n';
	}

	vector<vector<int>> clusters(n);
	for (int i = 0; i < n; i++) {
		int r = root(i);
		if (groups[r].cursed == 0)
			clusters[r].push_back(i);
	}
	int mnsize = md;
	for (int i = 0; i < n; i++)
		if (clusters[i].size()) mnsize = min(mnsize, (int)clusters[i].size());
	vector<int> result(n, 0);
	for (int i = 0; i < n; i++) {
		if (clusters[i].size() == mnsize) {
			for (const auto &j : clusters[i])
				result[j] = 1;
		}
	}
	return result;
}

/*
void solve() {
	int n, m;
	cin >> n >> m;
	vector<int> r(n), u(m), v(m), c(m);
	for (auto &i : r) cin >> i;
	for (auto &i : u) cin >> i;
	for (auto &i : v) cin >> i;
	for (auto &i : c) cin >> i;
	for (const auto &i : find_reachable(r, u, v, c))
		cout << i << " "; cout << '\n';
}

int main() {
	//ios::sync_with_stdio(0), cin.tie(0);
	int tst = 1;
	//cin >> tst;
	while (tst--) solve();
}
*/

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:105:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  105 |    for (const auto &i : stack) cout << i << " "; cout << '\n';
      |    ^~~
keys.cpp:105:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  105 |    for (const auto &i : stack) cout << i << " "; cout << '\n';
      |                                                  ^~~~
keys.cpp:160:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  160 |   if (clusters[i].size() == mnsize) {
      |       ~~~~~~~~~~~~~~~~~~~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40152 KB Output is correct
2 Correct 22 ms 40144 KB Output is correct
3 Correct 21 ms 40140 KB Output is correct
4 Correct 24 ms 40260 KB Output is correct
5 Correct 25 ms 40220 KB Output is correct
6 Correct 24 ms 40132 KB Output is correct
7 Correct 24 ms 40164 KB Output is correct
8 Correct 25 ms 40140 KB Output is correct
9 Correct 24 ms 40140 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40152 KB Output is correct
2 Correct 22 ms 40144 KB Output is correct
3 Correct 21 ms 40140 KB Output is correct
4 Correct 24 ms 40260 KB Output is correct
5 Correct 25 ms 40220 KB Output is correct
6 Correct 24 ms 40132 KB Output is correct
7 Correct 24 ms 40164 KB Output is correct
8 Correct 25 ms 40140 KB Output is correct
9 Correct 24 ms 40140 KB Output is correct
10 Correct 22 ms 40156 KB Output is correct
11 Correct 21 ms 40260 KB Output is correct
12 Correct 23 ms 40196 KB Output is correct
13 Correct 22 ms 40140 KB Output is correct
14 Correct 20 ms 40132 KB Output is correct
15 Correct 24 ms 40232 KB Output is correct
16 Correct 21 ms 40108 KB Output is correct
17 Correct 27 ms 40140 KB Output is correct
18 Correct 25 ms 40200 KB Output is correct
19 Correct 20 ms 40220 KB Output is correct
20 Correct 24 ms 40128 KB Output is correct
21 Correct 23 ms 40244 KB Output is correct
22 Correct 22 ms 40192 KB Output is correct
23 Correct 22 ms 40212 KB Output is correct
24 Correct 22 ms 40140 KB Output is correct
25 Correct 23 ms 40132 KB Output is correct
26 Correct 24 ms 40196 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40152 KB Output is correct
2 Correct 22 ms 40144 KB Output is correct
3 Correct 21 ms 40140 KB Output is correct
4 Correct 24 ms 40260 KB Output is correct
5 Correct 25 ms 40220 KB Output is correct
6 Correct 24 ms 40132 KB Output is correct
7 Correct 24 ms 40164 KB Output is correct
8 Correct 25 ms 40140 KB Output is correct
9 Correct 24 ms 40140 KB Output is correct
10 Correct 22 ms 40156 KB Output is correct
11 Correct 21 ms 40260 KB Output is correct
12 Correct 23 ms 40196 KB Output is correct
13 Correct 22 ms 40140 KB Output is correct
14 Correct 20 ms 40132 KB Output is correct
15 Correct 24 ms 40232 KB Output is correct
16 Correct 21 ms 40108 KB Output is correct
17 Correct 27 ms 40140 KB Output is correct
18 Correct 25 ms 40200 KB Output is correct
19 Correct 20 ms 40220 KB Output is correct
20 Correct 24 ms 40128 KB Output is correct
21 Correct 23 ms 40244 KB Output is correct
22 Correct 22 ms 40192 KB Output is correct
23 Correct 22 ms 40212 KB Output is correct
24 Correct 22 ms 40140 KB Output is correct
25 Correct 23 ms 40132 KB Output is correct
26 Correct 24 ms 40196 KB Output is correct
27 Correct 27 ms 40780 KB Output is correct
28 Correct 25 ms 40676 KB Output is correct
29 Correct 24 ms 40720 KB Output is correct
30 Correct 23 ms 40456 KB Output is correct
31 Correct 27 ms 40456 KB Output is correct
32 Correct 26 ms 40268 KB Output is correct
33 Correct 23 ms 40396 KB Output is correct
34 Correct 23 ms 40416 KB Output is correct
35 Correct 26 ms 40396 KB Output is correct
36 Correct 26 ms 40612 KB Output is correct
37 Correct 26 ms 40608 KB Output is correct
38 Correct 26 ms 40708 KB Output is correct
39 Correct 26 ms 40652 KB Output is correct
40 Correct 23 ms 40464 KB Output is correct
41 Correct 25 ms 40560 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40152 KB Output is correct
2 Correct 22 ms 40144 KB Output is correct
3 Correct 21 ms 40140 KB Output is correct
4 Correct 24 ms 40260 KB Output is correct
5 Correct 25 ms 40220 KB Output is correct
6 Correct 24 ms 40132 KB Output is correct
7 Correct 24 ms 40164 KB Output is correct
8 Correct 25 ms 40140 KB Output is correct
9 Correct 24 ms 40140 KB Output is correct
10 Correct 931 ms 92736 KB Output is correct
11 Correct 916 ms 125364 KB Output is correct
12 Correct 160 ms 55252 KB Output is correct
13 Correct 775 ms 116440 KB Output is correct
14 Correct 357 ms 120636 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40152 KB Output is correct
2 Correct 22 ms 40144 KB Output is correct
3 Correct 21 ms 40140 KB Output is correct
4 Correct 24 ms 40260 KB Output is correct
5 Correct 25 ms 40220 KB Output is correct
6 Correct 24 ms 40132 KB Output is correct
7 Correct 24 ms 40164 KB Output is correct
8 Correct 25 ms 40140 KB Output is correct
9 Correct 24 ms 40140 KB Output is correct
10 Correct 22 ms 40156 KB Output is correct
11 Correct 21 ms 40260 KB Output is correct
12 Correct 23 ms 40196 KB Output is correct
13 Correct 22 ms 40140 KB Output is correct
14 Correct 20 ms 40132 KB Output is correct
15 Correct 24 ms 40232 KB Output is correct
16 Correct 21 ms 40108 KB Output is correct
17 Correct 27 ms 40140 KB Output is correct
18 Correct 25 ms 40200 KB Output is correct
19 Correct 20 ms 40220 KB Output is correct
20 Correct 24 ms 40128 KB Output is correct
21 Correct 23 ms 40244 KB Output is correct
22 Correct 22 ms 40192 KB Output is correct
23 Correct 22 ms 40212 KB Output is correct
24 Correct 22 ms 40140 KB Output is correct
25 Correct 23 ms 40132 KB Output is correct
26 Correct 24 ms 40196 KB Output is correct
27 Correct 27 ms 40780 KB Output is correct
28 Correct 25 ms 40676 KB Output is correct
29 Correct 24 ms 40720 KB Output is correct
30 Correct 23 ms 40456 KB Output is correct
31 Correct 27 ms 40456 KB Output is correct
32 Correct 26 ms 40268 KB Output is correct
33 Correct 23 ms 40396 KB Output is correct
34 Correct 23 ms 40416 KB Output is correct
35 Correct 26 ms 40396 KB Output is correct
36 Correct 26 ms 40612 KB Output is correct
37 Correct 26 ms 40608 KB Output is correct
38 Correct 26 ms 40708 KB Output is correct
39 Correct 26 ms 40652 KB Output is correct
40 Correct 23 ms 40464 KB Output is correct
41 Correct 25 ms 40560 KB Output is correct
42 Correct 931 ms 92736 KB Output is correct
43 Correct 916 ms 125364 KB Output is correct
44 Correct 160 ms 55252 KB Output is correct
45 Correct 775 ms 116440 KB Output is correct
46 Correct 357 ms 120636 KB Output is correct
47 Correct 22 ms 40140 KB Output is correct
48 Correct 24 ms 40140 KB Output is correct
49 Correct 22 ms 40144 KB Output is correct
50 Correct 390 ms 130260 KB Output is correct
51 Correct 445 ms 130004 KB Output is correct
52 Correct 514 ms 95796 KB Output is correct
53 Correct 562 ms 95804 KB Output is correct
54 Correct 575 ms 95796 KB Output is correct
55 Correct 1122 ms 92556 KB Output is correct
56 Correct 949 ms 123824 KB Output is correct
57 Correct 909 ms 123476 KB Output is correct
58 Correct 803 ms 124628 KB Output is correct
59 Correct 2078 ms 112112 KB Output is correct
60 Correct 1932 ms 113212 KB Output is correct
61 Correct 1899 ms 115108 KB Output is correct
62 Correct 1428 ms 105700 KB Output is correct
63 Correct 360 ms 103152 KB Output is correct
64 Correct 32 ms 41676 KB Output is correct
65 Correct 28 ms 41560 KB Output is correct
66 Correct 1551 ms 106476 KB Output is correct
67 Correct 56 ms 48468 KB Output is correct
68 Correct 95 ms 54072 KB Output is correct
69 Correct 1942 ms 112568 KB Output is correct
70 Correct 146 ms 67692 KB Output is correct
71 Correct 450 ms 120532 KB Output is correct
72 Correct 1949 ms 111668 KB Output is correct
73 Correct 1385 ms 106596 KB Output is correct