oj.uz

Submission #591033

# Submission time Handle Problem Language Result Execution time Memory
591033 2022-07-06T18:32:07 Z Lucpp Keys (IOI21_keys) C++17
100 / 100
 691 ms 58740 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e8;

int n, maxC;
vector<int> par;
int find(int u){
	if(u == par[u]) return u;
	else return par[u] = find(par[u]);
}
void merge(int a, int b){
	a = find(a);
	b = find(b);
	if(a == b) return;
	par[b] = a;
}

vector<vector<pair<int, int>>> g;
vector<bool> vis, ok;
vector<int> ke;
vector<bool> keys;
vector<vector<int>> edges;

queue<int> q;
vector<int> visited;

int best = INF;
vector<int> good;
vector<bool> alive;

vector<int> undo_key, undo_edge;
void undo(){
	for(int i : undo_key) keys[i] = false;
	for(int i : undo_edge) edges[i].clear();
	undo_key.clear();
	undo_edge.clear();
	visited.clear();
	q = queue<int>();
}

bool visit(int u);

bool go(int u, int v){
	if(!alive[find(v)]) return true;
	if(find(v) != find(u)){
		merge(v, u);
		ok[find(v)] = true;
		return true;
	}
	if(!vis[v]){
		if(visit(v)) return true;
	}
	return false;
}

bool visit(int u){
	vis[u] = true;
	visited.push_back(u);
	q.push(u);
	if(!keys[ke[u]]){
		undo_key.push_back(ke[u]);
		keys[ke[u]] = true;
		for(int v : edges[ke[u]]){
			if(go(u, v)) return true;
		}
	}
	return false;
}

void bfs(int start){
	undo();
	q = queue<int>({start});
	keys[ke[start]] = true;
	undo_key.push_back(ke[start]);
	vis[start] = true;
	visited.push_back(start);
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(auto [v, k] : g[u]){
			if(!keys[k]){
				undo_edge.push_back(k);
				edges[k].push_back(v);
			}
			else if(go(u, v)) return;
		}
	}
	int s = (int)visited.size();
	if(s < best) best = s, good.clear();
	if(s == best){
		for(int u : visited) good.push_back(u);
	}
	alive[start] = false;
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	ke = r;
	n = (int)r.size();
	maxC = 0;
	for(int i : r) maxC = max(maxC, i);
	for(int i : c) maxC = max(maxC, i);
	maxC++;
	par.resize(n);
	for(int i = 0; i < n; i++) par[i] = i;
	g.resize(n);
	for(int i = 0; i < (int)u.size(); i++){
		g[u[i]].emplace_back(v[i], c[i]);
		g[v[i]].emplace_back(u[i], c[i]);
	}
	alive.assign(n, true);
	keys.assign(maxC, false);
	edges.resize(maxC);
	vector<int> comp(n);
	for(int i = 0; i < n; i++) comp[i] = i;
	while(!comp.empty()){
		vis.assign(n, false);
		ok.assign(n, false);
		for(int i : comp){
			if(!ok[i]) bfs(i);
		}
		comp.clear();
		for(int i = 0; i < n; i++) if(find(i) == i && ok[i]) comp.push_back(i);
	}
	vector<int> ans(n);
	for(int i : good) ans[i] = 1;
	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 2 ms 640 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 624 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 1 ms 436 KB Output is correct
35 Correct 1 ms 444 KB Output is correct
36 Correct 2 ms 436 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 488 KB Output is correct
39 Correct 3 ms 560 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 596 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 211 ms 27848 KB Output is correct
11 Correct 268 ms 42332 KB Output is correct
12 Correct 49 ms 7340 KB Output is correct
13 Correct 285 ms 35152 KB Output is correct
14 Correct 217 ms 39396 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 2 ms 640 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 624 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 1 ms 436 KB Output is correct
35 Correct 1 ms 444 KB Output is correct
36 Correct 2 ms 436 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 488 KB Output is correct
39 Correct 3 ms 560 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 211 ms 27848 KB Output is correct
43 Correct 268 ms 42332 KB Output is correct
44 Correct 49 ms 7340 KB Output is correct
45 Correct 285 ms 35152 KB Output is correct
46 Correct 217 ms 39396 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 195 ms 39760 KB Output is correct
51 Correct 211 ms 48208 KB Output is correct
52 Correct 246 ms 37840 KB Output is correct
53 Correct 233 ms 37716 KB Output is correct
54 Correct 239 ms 37700 KB Output is correct
55 Correct 248 ms 31772 KB Output is correct
56 Correct 340 ms 50520 KB Output is correct
57 Correct 255 ms 50396 KB Output is correct
58 Correct 312 ms 58740 KB Output is correct
59 Correct 382 ms 46712 KB Output is correct
60 Correct 308 ms 40428 KB Output is correct
61 Correct 388 ms 44092 KB Output is correct
62 Correct 680 ms 37376 KB Output is correct
63 Correct 182 ms 37816 KB Output is correct
64 Correct 5 ms 952 KB Output is correct
65 Correct 4 ms 972 KB Output is correct
66 Correct 665 ms 37328 KB Output is correct
67 Correct 23 ms 4196 KB Output is correct
68 Correct 37 ms 6808 KB Output is correct
69 Correct 404 ms 46608 KB Output is correct
70 Correct 88 ms 13264 KB Output is correct
71 Correct 231 ms 40028 KB Output is correct
72 Correct 405 ms 46592 KB Output is correct
73 Correct 691 ms 37276 KB Output is correct