oj.uz

Submission #811866

# Submission time Handle Problem Language Result Execution time Memory
811866 2023-08-07T06:11:37 Z forelax Keys (IOI21_keys) C++17
100 / 100
 532 ms 62196 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pi;

#define MAXN 300000
#define MAXM 300000
#define MAXK 300000

// BEGIN UFDS
int par[MAXN + 5], sz[MAXN + 5];

void init(){
	for (int i = 0; i < MAXN; ++i){
		par[i] = i;
		sz[i] = 0;
	}
}

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

void merg(int x, int y){ // we can't merge by rank here
	par[findPar(x)] = findPar(y);
}
// END UFDS

vector<pi> adjList[MAXN + 5];
vector<int> locked[MAXK + 5];
vector<int> vals;

int homekeys[MAXN + 5], vis[MAXN+5], dead[MAXN + 5], last[MAXN + 5];
int keys[MAXK + 5];
int ans;

vector<int> reach;
vector<int> haslock;

void cleanup(){
	for (auto it : reach) keys[homekeys[it]] = 0;
	for (auto it : haslock) locked[it].clear();

	reach.clear();
	haslock.clear();
}

void runBFS(int rep, int iter){
	last[rep] = iter;
	queue<int> q;
	q.push(rep);


	while (!q.empty()){
		int u = q.front();
		q.pop();

		if (findPar(u) != rep){
			merg(rep,findPar(u));
			last[findPar(u)] = iter;
			cleanup();
			return;
		}
		if (vis[u]) continue;
		vis[u] = 1;

		reach.push_back(u);
		int nk = homekeys[u];

		if (keys[nk] == 0){
			keys[nk] = 1;
			while (!locked[nk].empty()){
				q.push(locked[nk].back());
				locked[nk].pop_back();
			}
		}

		for (auto it : adjList[u]){
			if (keys[it.second]) q.push(it.first);
			else{
				haslock.push_back(it.second);
				locked[it.second].push_back(it.first);
			}
		}
	}

	dead[rep] = 1;
	if (reach.size() < ans){
		vals.clear();
		ans = reach.size();
	}
	if (reach.size() == ans){
		for (auto it : reach) vals.push_back(it);
	}
	cleanup();
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	int n = r.size(), m = c.size();
	init();

	for (int i = 0; i < n; ++i) homekeys[i] = r[i];

	for (int i = 0; i < m; ++i){
		adjList[u[i]].push_back(pi(v[i],c[i]));
		adjList[v[i]].push_back(pi(u[i],c[i]));
	}

	ans = n+1;

	for (int iter = 1;; ++iter){
		for (int i = 0; i < n; ++i) vis[i] = 0;
		int check = 0;
		for (int i = 0; i < n; ++i){
			if (findPar(i) == i && !dead[i]){
				if (last[i] != iter){
					runBFS(i,iter);
					check = 1;
				}
			}
		}
		if (!check) break;
		//if(iter>=18) break;
	}

	vector<int> ret(n);
	for(auto it : vals) ret[it] = 1;

	return ret;
}

Compilation message

keys.cpp: In function 'void runBFS(int, int)':
keys.cpp:90:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   90 |  if (reach.size() < ans){
      |      ~~~~~~~~~~~~~^~~~~
keys.cpp:94:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   94 |  if (reach.size() == ans){
      |      ~~~~~~~~~~~~~^~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 10 ms 16704 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 10 ms 16724 KB Output is correct
7 Correct 10 ms 16724 KB Output is correct
8 Correct 10 ms 16712 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 10 ms 16704 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 10 ms 16724 KB Output is correct
7 Correct 10 ms 16724 KB Output is correct
8 Correct 10 ms 16712 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 9 ms 16756 KB Output is correct
11 Correct 9 ms 16724 KB Output is correct
12 Correct 10 ms 16712 KB Output is correct
13 Correct 8 ms 16772 KB Output is correct
14 Correct 9 ms 16776 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 11 ms 16676 KB Output is correct
17 Correct 8 ms 16724 KB Output is correct
18 Correct 9 ms 16740 KB Output is correct
19 Correct 7 ms 16724 KB Output is correct
20 Correct 9 ms 16724 KB Output is correct
21 Correct 9 ms 16700 KB Output is correct
22 Correct 9 ms 16712 KB Output is correct
23 Correct 10 ms 16712 KB Output is correct
24 Correct 10 ms 16672 KB Output is correct
25 Correct 11 ms 16696 KB Output is correct
26 Correct 10 ms 16724 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 10 ms 16704 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 10 ms 16724 KB Output is correct
7 Correct 10 ms 16724 KB Output is correct
8 Correct 10 ms 16712 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 9 ms 16756 KB Output is correct
11 Correct 9 ms 16724 KB Output is correct
12 Correct 10 ms 16712 KB Output is correct
13 Correct 8 ms 16772 KB Output is correct
14 Correct 9 ms 16776 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 11 ms 16676 KB Output is correct
17 Correct 8 ms 16724 KB Output is correct
18 Correct 9 ms 16740 KB Output is correct
19 Correct 7 ms 16724 KB Output is correct
20 Correct 9 ms 16724 KB Output is correct
21 Correct 9 ms 16700 KB Output is correct
22 Correct 9 ms 16712 KB Output is correct
23 Correct 10 ms 16712 KB Output is correct
24 Correct 10 ms 16672 KB Output is correct
25 Correct 11 ms 16696 KB Output is correct
26 Correct 10 ms 16724 KB Output is correct
27 Correct 11 ms 16980 KB Output is correct
28 Correct 12 ms 17032 KB Output is correct
29 Correct 10 ms 16980 KB Output is correct
30 Correct 9 ms 16852 KB Output is correct
31 Correct 8 ms 16856 KB Output is correct
32 Correct 8 ms 16796 KB Output is correct
33 Correct 8 ms 16852 KB Output is correct
34 Correct 8 ms 16852 KB Output is correct
35 Correct 12 ms 16856 KB Output is correct
36 Correct 13 ms 16980 KB Output is correct
37 Correct 9 ms 16980 KB Output is correct
38 Correct 8 ms 16976 KB Output is correct
39 Correct 10 ms 16980 KB Output is correct
40 Correct 9 ms 16852 KB Output is correct
41 Correct 10 ms 16852 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 10 ms 16704 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 10 ms 16724 KB Output is correct
7 Correct 10 ms 16724 KB Output is correct
8 Correct 10 ms 16712 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 224 ms 42292 KB Output is correct
11 Correct 266 ms 53108 KB Output is correct
12 Correct 39 ms 22836 KB Output is correct
13 Correct 217 ms 46220 KB Output is correct
14 Correct 130 ms 48752 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16724 KB Output is correct
2 Correct 9 ms 16712 KB Output is correct
3 Correct 10 ms 16704 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 10 ms 16724 KB Output is correct
7 Correct 10 ms 16724 KB Output is correct
8 Correct 10 ms 16712 KB Output is correct
9 Correct 10 ms 16724 KB Output is correct
10 Correct 9 ms 16756 KB Output is correct
11 Correct 9 ms 16724 KB Output is correct
12 Correct 10 ms 16712 KB Output is correct
13 Correct 8 ms 16772 KB Output is correct
14 Correct 9 ms 16776 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 11 ms 16676 KB Output is correct
17 Correct 8 ms 16724 KB Output is correct
18 Correct 9 ms 16740 KB Output is correct
19 Correct 7 ms 16724 KB Output is correct
20 Correct 9 ms 16724 KB Output is correct
21 Correct 9 ms 16700 KB Output is correct
22 Correct 9 ms 16712 KB Output is correct
23 Correct 10 ms 16712 KB Output is correct
24 Correct 10 ms 16672 KB Output is correct
25 Correct 11 ms 16696 KB Output is correct
26 Correct 10 ms 16724 KB Output is correct
27 Correct 11 ms 16980 KB Output is correct
28 Correct 12 ms 17032 KB Output is correct
29 Correct 10 ms 16980 KB Output is correct
30 Correct 9 ms 16852 KB Output is correct
31 Correct 8 ms 16856 KB Output is correct
32 Correct 8 ms 16796 KB Output is correct
33 Correct 8 ms 16852 KB Output is correct
34 Correct 8 ms 16852 KB Output is correct
35 Correct 12 ms 16856 KB Output is correct
36 Correct 13 ms 16980 KB Output is correct
37 Correct 9 ms 16980 KB Output is correct
38 Correct 8 ms 16976 KB Output is correct
39 Correct 10 ms 16980 KB Output is correct
40 Correct 9 ms 16852 KB Output is correct
41 Correct 10 ms 16852 KB Output is correct
42 Correct 224 ms 42292 KB Output is correct
43 Correct 266 ms 53108 KB Output is correct
44 Correct 39 ms 22836 KB Output is correct
45 Correct 217 ms 46220 KB Output is correct
46 Correct 130 ms 48752 KB Output is correct
47 Correct 7 ms 16708 KB Output is correct
48 Correct 7 ms 16708 KB Output is correct
49 Correct 8 ms 16724 KB Output is correct
50 Correct 129 ms 49144 KB Output is correct
51 Correct 144 ms 50076 KB Output is correct
52 Correct 232 ms 47320 KB Output is correct
53 Correct 211 ms 47204 KB Output is correct
54 Correct 209 ms 47256 KB Output is correct
55 Correct 205 ms 44652 KB Output is correct
56 Correct 278 ms 56824 KB Output is correct
57 Correct 178 ms 54952 KB Output is correct
58 Correct 233 ms 62196 KB Output is correct
59 Correct 335 ms 55232 KB Output is correct
60 Correct 230 ms 51308 KB Output is correct
61 Correct 351 ms 54048 KB Output is correct
62 Correct 532 ms 50276 KB Output is correct
63 Correct 140 ms 49252 KB Output is correct
64 Correct 9 ms 17236 KB Output is correct
65 Correct 10 ms 17252 KB Output is correct
66 Correct 471 ms 50468 KB Output is correct
67 Correct 22 ms 19900 KB Output is correct
68 Correct 32 ms 22132 KB Output is correct
69 Correct 323 ms 55164 KB Output is correct
70 Correct 66 ms 27336 KB Output is correct
71 Correct 151 ms 49288 KB Output is correct
72 Correct 286 ms 55100 KB Output is correct
73 Correct 515 ms 50308 KB Output is correct