Submission #521604

# Submission time Handle Problem Language Result Execution time Memory
521604 2022-02-02T14:26:36 Z eecs Keys (IOI21_keys) C++17
100 / 100
1644 ms 53292 KB
#include "keys.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_reachable(vector<int> r, vector<int> U, vector<int> V, vector<int> C) {
	int n = r.size(), mn = INT_MAX;
	vector<vector<array<int, 2>>> G(n);
	for (int i = 0; i < U.size(); i++) {
		G[U[i]].push_back({V[i], C[i]});
		G[V[i]].push_back({U[i], C[i]});
	}
	vector<int> ans, perm(n), pos(n), cnt(n), vis(n, -1), visc(n, -1);
	vector<vector<int>> cand(n);
	vector<bool> solved(n);
	iota(perm.begin(), perm.end(), 0);
	for (int i = 0; i < n; i++) {
		for (auto &e : G[i]) cnt[i] += e[1] == r[i];
	}
	sort(perm.begin(), perm.end(), [&](int u, int v) { return cnt[u] < cnt[v]; });
	for (int i = 0; i < n; i++) {
		pos[perm[i]] = i;
	}
	for (int i = 0; i < n; i++) {
		sort(G[i].begin(), G[i].end(), [&](array<int, 2> p, array<int, 2> q) { return pos[p[0]] < pos[q[0]]; });
	}
	queue<int> Q;
	vector<int> ver, col;
	for (int x : perm) {
		ver = {x}, col.clear();
		while (!Q.empty()) Q.pop();
		Q.push(x), vis[x] = x, solved[x] = 1;
		while (!Q.empty()) {
			int u = Q.front(); Q.pop();
			if (visc[r[u]] ^ x) {
				for (int v : cand[r[u]]) if (vis[v] ^ x) {
					ver.push_back(v), Q.push(v), vis[v] = x;
					if (solved[v] || ver.size() > mn) goto nxt;
				}
				visc[r[u]] = x;
			}
			for (auto &e : G[u]) if (vis[e[0]] ^ x) {
				if (visc[e[1]] == x) {
					ver.push_back(e[0]), Q.push(e[0]), vis[e[0]] = x;
					if (solved[e[0]] || ver.size() > mn) goto nxt;
				} else {
					col.push_back(e[1]);
					if (solved[e[0]]) cand[e[1]].clear();
					cand[e[1]].push_back(e[0]);
				}
			}
		}
		if (ver.size() < mn) mn = ver.size(), ans = ver;
		else copy(ver.begin(), ver.end(), back_inserter(ans));
	nxt:
		for (int c : col) cand[c].clear();
	}
	vector<int> res(n);
	for (int x : ans) res[x] = 1;
	return res;
}

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:8:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |  for (int i = 0; i < U.size(); i++) {
      |                  ~~^~~~~~~~~~
keys.cpp:37:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |      if (solved[v] || ver.size() > mn) goto nxt;
      |                       ~~~~~~~~~~~^~~~
keys.cpp:44:37: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |      if (solved[e[0]] || ver.size() > mn) goto nxt;
      |                          ~~~~~~~~~~~^~~~
keys.cpp:52:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |   if (ver.size() < mn) mn = ver.size(), ans = ver;
      |       ~~~~~~~~~~~^~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 2 ms 588 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 210 ms 24064 KB Output is correct
11 Correct 385 ms 48356 KB Output is correct
12 Correct 35 ms 7996 KB Output is correct
13 Correct 266 ms 38512 KB Output is correct
14 Correct 191 ms 42700 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 2 ms 588 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 210 ms 24064 KB Output is correct
43 Correct 385 ms 48356 KB Output is correct
44 Correct 35 ms 7996 KB Output is correct
45 Correct 266 ms 38512 KB Output is correct
46 Correct 191 ms 42700 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 193 ms 44724 KB Output is correct
51 Correct 168 ms 40816 KB Output is correct
52 Correct 211 ms 32112 KB Output is correct
53 Correct 218 ms 32228 KB Output is correct
54 Correct 208 ms 32128 KB Output is correct
55 Correct 202 ms 25024 KB Output is correct
56 Correct 307 ms 45024 KB Output is correct
57 Correct 269 ms 44560 KB Output is correct
58 Correct 357 ms 53292 KB Output is correct
59 Correct 1446 ms 40472 KB Output is correct
60 Correct 294 ms 35240 KB Output is correct
61 Correct 277 ms 35180 KB Output is correct
62 Correct 224 ms 29020 KB Output is correct
63 Correct 149 ms 32480 KB Output is correct
64 Correct 4 ms 972 KB Output is correct
65 Correct 3 ms 972 KB Output is correct
66 Correct 234 ms 29000 KB Output is correct
67 Correct 18 ms 4428 KB Output is correct
68 Correct 33 ms 7416 KB Output is correct
69 Correct 1410 ms 40480 KB Output is correct
70 Correct 66 ms 14524 KB Output is correct
71 Correct 198 ms 42604 KB Output is correct
72 Correct 1644 ms 40480 KB Output is correct
73 Correct 249 ms 29164 KB Output is correct