oj.uz

Submission #823236

# Submission time Handle Problem Language Result Execution time Memory
823236 2023-08-12T09:47:46 Z Blagoj Keys (IOI21_keys) C++17
100 / 100
 560 ms 59148 KB 
#include <bits/stdc++.h>
#include "keys.h"

using namespace std;

#define all(x) x.begin(), x.end()

int ldr[300005];
bool dead[300005];

int Find(int x) {
	if (x != ldr[x]) ldr[x] = Find(ldr[x]);
	return ldr[x]; 
}

void Merge(int x, int y) {
	ldr[Find(x)] = ldr[Find(y)];
}

vector<int> keys(300005), reach, locked[300005], hasLock, mn;
vector<pair<int, int>> g[300005];

int last[300005], ans;
bool visited[300005], has[300005];

void clear() {
	for (auto x : reach) has[keys[x]] = 0;
	for (auto x : hasLock) locked[x].clear();
	reach.clear();
	hasLock.clear();
}

void Bfs(int cur, int it) {
	last[cur] = it;
	queue<int> q;
	q.push(cur);
	while (q.size()) {
		int fr = q.front();
		q.pop();
		if (Find(fr) != cur) {
			Merge(cur, Find(fr));
			last[Find(fr)] = it;
			clear();
			return;
		}
		if (visited[fr]) continue;
		visited[fr] = 1;
		reach.push_back(fr);
		int type = keys[fr];
		if (has[type] == 0) {
			for (auto x : locked[type]) q.push(x);
			locked[type].clear();
			has[type] = 1;
		}
		for (auto x : g[fr]) {
			if (has[x.second]) q.push(x.first);
			else {
				locked[x.second].push_back(x.first);
				hasLock.push_back(x.second);
			}
		}
	}
	dead[cur] = 1;
	if (reach.size() < ans) {
		ans = reach.size();
		mn.clear();
	}
	if (reach.size() == ans) for (auto x : reach) mn.push_back(x);
	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++) keys[i] = r[i], ldr[i] = i;
	for (int i = 0; i < m; i++) {
		g[u[i]].push_back({v[i], c[i]});
		g[v[i]].push_back({u[i], c[i]});
	}
	ans = n + 1;
	for (int it = 1; ; it++) {
		memset(visited, 0, sizeof(visited));
		bool flag = 0;
		for (int i = 0; i < n; i++) {
			if (Find(i) == i && !dead[i] && last[i] != it) {
				Bfs(i, it);
				flag = 1;
			}
		}
		if (!flag) break;
	}
	vector<int> ret(n);
	for (auto x : mn) ret[x] = 1;
	return ret;
}

Compilation message

keys.cpp: In function 'void Bfs(int, int)':
keys.cpp:64:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |  if (reach.size() < ans) {
      |      ~~~~~~~~~~~~~^~~~~
keys.cpp:68:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   68 |  if (reach.size() == ans) for (auto x : reach) mn.push_back(x);
      |      ~~~~~~~~~~~~~^~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15852 KB Output is correct
2 Correct 7 ms 15828 KB Output is correct
3 Correct 7 ms 15860 KB Output is correct
4 Correct 7 ms 15828 KB Output is correct
5 Correct 8 ms 15864 KB Output is correct
6 Correct 7 ms 15856 KB Output is correct
7 Correct 7 ms 15828 KB Output is correct
8 Correct 8 ms 15852 KB Output is correct
9 Correct 8 ms 15828 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15852 KB Output is correct
2 Correct 7 ms 15828 KB Output is correct
3 Correct 7 ms 15860 KB Output is correct
4 Correct 7 ms 15828 KB Output is correct
5 Correct 8 ms 15864 KB Output is correct
6 Correct 7 ms 15856 KB Output is correct
7 Correct 7 ms 15828 KB Output is correct
8 Correct 8 ms 15852 KB Output is correct
9 Correct 8 ms 15828 KB Output is correct
10 Correct 7 ms 15828 KB Output is correct
11 Correct 7 ms 15828 KB Output is correct
12 Correct 7 ms 15852 KB Output is correct
13 Correct 7 ms 15780 KB Output is correct
14 Correct 6 ms 15828 KB Output is correct
15 Correct 7 ms 15828 KB Output is correct
16 Correct 7 ms 15828 KB Output is correct
17 Correct 7 ms 15828 KB Output is correct
18 Correct 7 ms 15864 KB Output is correct
19 Correct 8 ms 15828 KB Output is correct
20 Correct 8 ms 15828 KB Output is correct
21 Correct 9 ms 15856 KB Output is correct
22 Correct 7 ms 15828 KB Output is correct
23 Correct 7 ms 15848 KB Output is correct
24 Correct 7 ms 15828 KB Output is correct
25 Correct 7 ms 15848 KB Output is correct
26 Correct 7 ms 15852 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15852 KB Output is correct
2 Correct 7 ms 15828 KB Output is correct
3 Correct 7 ms 15860 KB Output is correct
4 Correct 7 ms 15828 KB Output is correct
5 Correct 8 ms 15864 KB Output is correct
6 Correct 7 ms 15856 KB Output is correct
7 Correct 7 ms 15828 KB Output is correct
8 Correct 8 ms 15852 KB Output is correct
9 Correct 8 ms 15828 KB Output is correct
10 Correct 7 ms 15828 KB Output is correct
11 Correct 7 ms 15828 KB Output is correct
12 Correct 7 ms 15852 KB Output is correct
13 Correct 7 ms 15780 KB Output is correct
14 Correct 6 ms 15828 KB Output is correct
15 Correct 7 ms 15828 KB Output is correct
16 Correct 7 ms 15828 KB Output is correct
17 Correct 7 ms 15828 KB Output is correct
18 Correct 7 ms 15864 KB Output is correct
19 Correct 8 ms 15828 KB Output is correct
20 Correct 8 ms 15828 KB Output is correct
21 Correct 9 ms 15856 KB Output is correct
22 Correct 7 ms 15828 KB Output is correct
23 Correct 7 ms 15848 KB Output is correct
24 Correct 7 ms 15828 KB Output is correct
25 Correct 7 ms 15848 KB Output is correct
26 Correct 7 ms 15852 KB Output is correct
27 Correct 8 ms 16084 KB Output is correct
28 Correct 9 ms 16120 KB Output is correct
29 Correct 9 ms 16084 KB Output is correct
30 Correct 8 ms 15992 KB Output is correct
31 Correct 8 ms 15884 KB Output is correct
32 Correct 7 ms 15828 KB Output is correct
33 Correct 8 ms 15956 KB Output is correct
34 Correct 8 ms 15996 KB Output is correct
35 Correct 8 ms 15996 KB Output is correct
36 Correct 8 ms 15992 KB Output is correct
37 Correct 9 ms 16084 KB Output is correct
38 Correct 11 ms 16116 KB Output is correct
39 Correct 9 ms 16048 KB Output is correct
40 Correct 10 ms 15988 KB Output is correct
41 Correct 8 ms 15992 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15852 KB Output is correct
2 Correct 7 ms 15828 KB Output is correct
3 Correct 7 ms 15860 KB Output is correct
4 Correct 7 ms 15828 KB Output is correct
5 Correct 8 ms 15864 KB Output is correct
6 Correct 7 ms 15856 KB Output is correct
7 Correct 7 ms 15828 KB Output is correct
8 Correct 8 ms 15852 KB Output is correct
9 Correct 8 ms 15828 KB Output is correct
10 Correct 154 ms 40812 KB Output is correct
11 Correct 176 ms 51080 KB Output is correct
12 Correct 36 ms 21592 KB Output is correct
13 Correct 193 ms 43452 KB Output is correct
14 Correct 136 ms 46672 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15852 KB Output is correct
2 Correct 7 ms 15828 KB Output is correct
3 Correct 7 ms 15860 KB Output is correct
4 Correct 7 ms 15828 KB Output is correct
5 Correct 8 ms 15864 KB Output is correct
6 Correct 7 ms 15856 KB Output is correct
7 Correct 7 ms 15828 KB Output is correct
8 Correct 8 ms 15852 KB Output is correct
9 Correct 8 ms 15828 KB Output is correct
10 Correct 7 ms 15828 KB Output is correct
11 Correct 7 ms 15828 KB Output is correct
12 Correct 7 ms 15852 KB Output is correct
13 Correct 7 ms 15780 KB Output is correct
14 Correct 6 ms 15828 KB Output is correct
15 Correct 7 ms 15828 KB Output is correct
16 Correct 7 ms 15828 KB Output is correct
17 Correct 7 ms 15828 KB Output is correct
18 Correct 7 ms 15864 KB Output is correct
19 Correct 8 ms 15828 KB Output is correct
20 Correct 8 ms 15828 KB Output is correct
21 Correct 9 ms 15856 KB Output is correct
22 Correct 7 ms 15828 KB Output is correct
23 Correct 7 ms 15848 KB Output is correct
24 Correct 7 ms 15828 KB Output is correct
25 Correct 7 ms 15848 KB Output is correct
26 Correct 7 ms 15852 KB Output is correct
27 Correct 8 ms 16084 KB Output is correct
28 Correct 9 ms 16120 KB Output is correct
29 Correct 9 ms 16084 KB Output is correct
30 Correct 8 ms 15992 KB Output is correct
31 Correct 8 ms 15884 KB Output is correct
32 Correct 7 ms 15828 KB Output is correct
33 Correct 8 ms 15956 KB Output is correct
34 Correct 8 ms 15996 KB Output is correct
35 Correct 8 ms 15996 KB Output is correct
36 Correct 8 ms 15992 KB Output is correct
37 Correct 9 ms 16084 KB Output is correct
38 Correct 11 ms 16116 KB Output is correct
39 Correct 9 ms 16048 KB Output is correct
40 Correct 10 ms 15988 KB Output is correct
41 Correct 8 ms 15992 KB Output is correct
42 Correct 154 ms 40812 KB Output is correct
43 Correct 176 ms 51080 KB Output is correct
44 Correct 36 ms 21592 KB Output is correct
45 Correct 193 ms 43452 KB Output is correct
46 Correct 136 ms 46672 KB Output is correct
47 Correct 8 ms 15816 KB Output is correct
48 Correct 7 ms 15876 KB Output is correct
49 Correct 6 ms 15896 KB Output is correct
50 Correct 128 ms 47124 KB Output is correct
51 Correct 142 ms 48084 KB Output is correct
52 Correct 169 ms 44436 KB Output is correct
53 Correct 170 ms 44484 KB Output is correct
54 Correct 175 ms 44532 KB Output is correct
55 Correct 195 ms 42792 KB Output is correct
56 Correct 266 ms 52940 KB Output is correct
57 Correct 214 ms 51284 KB Output is correct
58 Correct 256 ms 59148 KB Output is correct
59 Correct 325 ms 52964 KB Output is correct
60 Correct 231 ms 49060 KB Output is correct
61 Correct 333 ms 51884 KB Output is correct
62 Correct 560 ms 48564 KB Output is correct
63 Correct 130 ms 46732 KB Output is correct
64 Correct 10 ms 16384 KB Output is correct
65 Correct 10 ms 16376 KB Output is correct
66 Correct 527 ms 48524 KB Output is correct
67 Correct 21 ms 18900 KB Output is correct
68 Correct 29 ms 21008 KB Output is correct
69 Correct 364 ms 52932 KB Output is correct
70 Correct 52 ms 26060 KB Output is correct
71 Correct 143 ms 47264 KB Output is correct
72 Correct 292 ms 52964 KB Output is correct
73 Correct 525 ms 48544 KB Output is correct