oj.uz

Submission #599509

# Submission time Handle Problem Language Result Execution time Memory
599509 2022-07-19T14:54:36 Z CaroLinda Keys (IOI21_keys) C++17
100 / 100
 1199 ms 59188 KB 
#include <vector>
#include <bits/stdc++.h>

const int MAXN = 3e5+10;

using namespace std;

vector<int> filaChave[MAXN];
int N;
int dsu[MAXN], p[MAXN];
vector<pair<int,int> > adj[MAXN];
bool chave[MAXN]; //assume sempre que estah limpa
bool vis[MAXN];
bool ruim[MAXN];

int find(int x){
	return dsu[x] = (x == dsu[x]) ? x : find(dsu[x]);
}

bool join(int a, int b){
	a = find(a);
	b = find(b);

	if(a == b)
		return false;

	dsu[b] = a;

	return true;
}

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

	vector<int> ruins, bons(N);

	iota(bons.begin(),bons.end(), 0);

	for(int i = 0; i < u.size(); i++){
		int a = u[i];
		int b = v[i];

		adj[a].push_back(make_pair(b,c[i]));
		adj[b].push_back(make_pair(a,c[i]));
	}

	iota(dsu, dsu+N, 0);

	auto fazBfs = [&](int x){
		vector<int> toProcess = {x};

		int ini = 0, ans = 0;
		int quebra = -1;

		vector<int> c;

		while(ini < toProcess.size() && quebra == -1){
			int y = toProcess[ini++];

			if(vis[y])
				continue;

			if(find(y) != find(x)){
				quebra = find(y);
				break;
			}

			ans++;

			vis[y] = true;
			chave[r[y]] = true;

			while(!filaChave[r[y]].empty()){
				toProcess.push_back(filaChave[r[y]].back());
				filaChave[r[y]].pop_back();
			}

			for(auto &e: adj[y]){
				if(vis[e.first])
					continue;

				if(chave[e.second])
					toProcess.push_back(e.first);
				else{
					filaChave[e.second].push_back(e.first);
					c.push_back(e.second);
				}
			}

		}

		for(auto &e: c)
			filaChave[e].clear();

		for(auto &e: toProcess){
			vis[e] = false;
			chave[r[e]] = false;
			p[e] = ans;
		}

		return quebra;
	};

	while(!bons.empty()){
		vector<int> newBons, auxBons;

		for(auto &e: bons){
			newBons.push_back(fazBfs(e));
		}

		for(int i =0; i < newBons.size(); i++){
			if(newBons[i] == -1){
				ruim[bons[i]] = true;
			}
			else if(!join(newBons[i], bons[i])){
				auxBons.push_back(bons[i]);
			}
		}

		swap(auxBons, bons);
	}

	fill(p, p+N, N);

	for(int i = 0; i < N; i++)
		if(ruim[i])
			fazBfs(i);

	vector<int> ans(N, 0);

	int mn = p[0];
	for(int i = 0; i < N; i++)
		mn = min(mn, p[i]);

	for(int i= 0; i < N; i++)
		if(mn == p[i])
			ans[i] = 1;

	return ans;
}

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:39:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i = 0; i < u.size(); i++){
      |                 ~~^~~~~~~~~~
keys.cpp: In lambda function:
keys.cpp:57:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   while(ini < toProcess.size() && quebra == -1){
      |         ~~~~^~~~~~~~~~~~~~~~~~
keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:111:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |   for(int i =0; i < newBons.size(); i++){
      |                 ~~^~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14292 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 10 ms 14428 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14372 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14400 KB Output is correct
18 Correct 8 ms 14432 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 7 ms 14444 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14292 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 10 ms 14428 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14372 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14400 KB Output is correct
18 Correct 8 ms 14432 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 7 ms 14444 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 9 ms 14560 KB Output is correct
28 Correct 8 ms 14548 KB Output is correct
29 Correct 11 ms 14548 KB Output is correct
30 Correct 8 ms 14500 KB Output is correct
31 Correct 8 ms 14420 KB Output is correct
32 Correct 7 ms 14436 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 8 ms 14420 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 9 ms 14496 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 9 ms 14604 KB Output is correct
39 Correct 9 ms 14632 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 8 ms 14520 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14292 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 225 ms 35068 KB Output is correct
11 Correct 300 ms 48512 KB Output is correct
12 Correct 57 ms 20364 KB Output is correct
13 Correct 351 ms 43188 KB Output is correct
14 Correct 199 ms 44484 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14292 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 10 ms 14428 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14372 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14400 KB Output is correct
18 Correct 8 ms 14432 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 7 ms 14444 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 9 ms 14560 KB Output is correct
28 Correct 8 ms 14548 KB Output is correct
29 Correct 11 ms 14548 KB Output is correct
30 Correct 8 ms 14500 KB Output is correct
31 Correct 8 ms 14420 KB Output is correct
32 Correct 7 ms 14436 KB Output is correct
33 Correct 8 ms 14420 KB Output is correct
34 Correct 8 ms 14420 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 9 ms 14496 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 9 ms 14604 KB Output is correct
39 Correct 9 ms 14632 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 8 ms 14520 KB Output is correct
42 Correct 225 ms 35068 KB Output is correct
43 Correct 300 ms 48512 KB Output is correct
44 Correct 57 ms 20364 KB Output is correct
45 Correct 351 ms 43188 KB Output is correct
46 Correct 199 ms 44484 KB Output is correct
47 Correct 8 ms 14292 KB Output is correct
48 Correct 7 ms 14420 KB Output is correct
49 Correct 7 ms 14420 KB Output is correct
50 Correct 176 ms 45484 KB Output is correct
51 Correct 220 ms 47376 KB Output is correct
52 Correct 261 ms 43504 KB Output is correct
53 Correct 276 ms 43620 KB Output is correct
54 Correct 269 ms 43516 KB Output is correct
55 Correct 331 ms 41840 KB Output is correct
56 Correct 345 ms 52336 KB Output is correct
57 Correct 323 ms 52336 KB Output is correct
58 Correct 289 ms 59188 KB Output is correct
59 Correct 480 ms 51152 KB Output is correct
60 Correct 357 ms 49568 KB Output is correct
61 Correct 458 ms 50132 KB Output is correct
62 Correct 1199 ms 45920 KB Output is correct
63 Correct 229 ms 45928 KB Output is correct
64 Correct 13 ms 14808 KB Output is correct
65 Correct 11 ms 14928 KB Output is correct
66 Correct 1146 ms 45924 KB Output is correct
67 Correct 27 ms 17384 KB Output is correct
68 Correct 39 ms 19352 KB Output is correct
69 Correct 411 ms 51052 KB Output is correct
70 Correct 71 ms 24276 KB Output is correct
71 Correct 199 ms 45048 KB Output is correct
72 Correct 427 ms 51040 KB Output is correct
73 Correct 1179 ms 46316 KB Output is correct