#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
int n, m;
vector<pair<int, int> >puentesDeEsteColor[2005];
int colorDeNodo[2005];
int respuestaParaNodo[2005];
int menorDeTodos = INT32_MAX;
bool yaPaso[2005];
int padre[2005];
vector<int>nodosDeEsteMan[2005];
int recorriendo;
int findPadre(int u){
if(padre[u] == u)return u;
return padre[u] = findPadre(padre[u]);
}
queue<int>llavesPorTomar;
void unir(int u, int v){
u = findPadre(u);
v = findPadre(v);
if(u==v)return;
//cout << "vamos a unir " << u << " " << v << endl;
if(nodosDeEsteMan[u].size()>nodosDeEsteMan[v].size())swap(u, v);
//u -> v
if(u == findPadre(recorriendo)){
for(int i = 0 ; i < nodosDeEsteMan[v].size() ; i++){
int curNodo = nodosDeEsteMan[v][i];
llavesPorTomar.push(colorDeNodo[curNodo]);
}
}else if(v == findPadre(recorriendo)){
for(int i = 0 ; i < nodosDeEsteMan[u].size() ; i++){
int curNodo = nodosDeEsteMan[u][i];
llavesPorTomar.push(colorDeNodo[curNodo]);
}
}
for(int i = 0 ; i < nodosDeEsteMan[u].size() ; i ++){
padre[nodosDeEsteMan[u][i]] = v;
nodosDeEsteMan[v].pb(nodosDeEsteMan[u][i]);
}
nodosDeEsteMan[u].clear();
}
int recorrerDesdeNodo(int u){
//cout << "resolviendo para " << u << endl;
recorriendo = u;
llavesPorTomar.push(colorDeNodo[u]);
while(!llavesPorTomar.empty()){
int currentColor = llavesPorTomar.front();
llavesPorTomar.pop();
if(yaPaso[currentColor])continue;
yaPaso[currentColor] = true;
//cout << "Analizando color " << currentColor << endl;
for(pair<int, int> puente:puentesDeEsteColor[currentColor]){
unir(puente.ff, puente.ss);
recorriendo = findPadre(recorriendo);
if(nodosDeEsteMan[recorriendo].size()>menorDeTodos)return nodosDeEsteMan[recorriendo].size();
}
}
return nodosDeEsteMan[recorriendo].size();
}
void reiniciar(){
memset(yaPaso, false, sizeof yaPaso);
for(int i = 0 ; i < n ; i ++){
padre[i] = i;
nodosDeEsteMan[i].clear();
nodosDeEsteMan[i].pb(i);
}
while(!llavesPorTomar.empty())llavesPorTomar.pop();
}
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
n = r.size();
m = u.size();
for(int i = 0 ; i < m ; i ++){
puentesDeEsteColor[c[i]].pb({u[i], v[i]});
}
for(int i = 0 ; i <n ; i ++){
colorDeNodo[i] = r[i];
}
vector<int>ans;
for(int i = 0 ; i <n ; i ++){
reiniciar();
respuestaParaNodo[i] = recorrerDesdeNodo(i);
menorDeTodos=min(respuestaParaNodo[i], menorDeTodos);
//cout << "Respuesta para nodo " << i << " = " << respuestaParaNodo[i] << endl;
}
for(int i = 0 ; i < n ; i ++){
if(respuestaParaNodo[i] == menorDeTodos)ans.pb(1);
else ans.pb(0);
}
return ans;
}
Compilation message
keys.cpp: In function 'void unir(int, int)':
keys.cpp:34:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
34 | for(int i = 0 ; i < nodosDeEsteMan[v].size() ; i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
keys.cpp:41:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
41 | for(int i = 0 ; i < nodosDeEsteMan[u].size() ; i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
keys.cpp:49:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
49 | for(int i = 0 ; i < nodosDeEsteMan[u].size() ; i ++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
keys.cpp: In function 'int recorrerDesdeNodo(int)':
keys.cpp:74:41: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
74 | if(nodosDeEsteMan[recorriendo].size()>menorDeTodos)return nodosDeEsteMan[recorriendo].size();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
404 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
404 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
0 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
468 KB |
Output is correct |
16 |
Correct |
1 ms |
400 KB |
Output is correct |
17 |
Correct |
1 ms |
400 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
0 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
468 KB |
Output is correct |
22 |
Correct |
1 ms |
400 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
528 KB |
Output is correct |
25 |
Correct |
1 ms |
468 KB |
Output is correct |
26 |
Correct |
2 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
404 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
0 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
468 KB |
Output is correct |
16 |
Correct |
1 ms |
400 KB |
Output is correct |
17 |
Correct |
1 ms |
400 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
0 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
468 KB |
Output is correct |
22 |
Correct |
1 ms |
400 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
528 KB |
Output is correct |
25 |
Correct |
1 ms |
468 KB |
Output is correct |
26 |
Correct |
2 ms |
468 KB |
Output is correct |
27 |
Correct |
23 ms |
632 KB |
Output is correct |
28 |
Correct |
24 ms |
596 KB |
Output is correct |
29 |
Correct |
22 ms |
652 KB |
Output is correct |
30 |
Correct |
23 ms |
1620 KB |
Output is correct |
31 |
Correct |
6 ms |
468 KB |
Output is correct |
32 |
Correct |
2 ms |
340 KB |
Output is correct |
33 |
Correct |
5 ms |
416 KB |
Output is correct |
34 |
Correct |
31 ms |
2380 KB |
Output is correct |
35 |
Correct |
31 ms |
2772 KB |
Output is correct |
36 |
Correct |
72 ms |
5052 KB |
Output is correct |
37 |
Correct |
117 ms |
9348 KB |
Output is correct |
38 |
Correct |
203 ms |
11996 KB |
Output is correct |
39 |
Correct |
138 ms |
9416 KB |
Output is correct |
40 |
Correct |
9 ms |
468 KB |
Output is correct |
41 |
Correct |
11 ms |
540 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
404 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Runtime error |
93 ms |
27068 KB |
Execution killed with signal 11 |
11 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
404 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
0 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
468 KB |
Output is correct |
16 |
Correct |
1 ms |
400 KB |
Output is correct |
17 |
Correct |
1 ms |
400 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
0 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
468 KB |
Output is correct |
22 |
Correct |
1 ms |
400 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
528 KB |
Output is correct |
25 |
Correct |
1 ms |
468 KB |
Output is correct |
26 |
Correct |
2 ms |
468 KB |
Output is correct |
27 |
Correct |
23 ms |
632 KB |
Output is correct |
28 |
Correct |
24 ms |
596 KB |
Output is correct |
29 |
Correct |
22 ms |
652 KB |
Output is correct |
30 |
Correct |
23 ms |
1620 KB |
Output is correct |
31 |
Correct |
6 ms |
468 KB |
Output is correct |
32 |
Correct |
2 ms |
340 KB |
Output is correct |
33 |
Correct |
5 ms |
416 KB |
Output is correct |
34 |
Correct |
31 ms |
2380 KB |
Output is correct |
35 |
Correct |
31 ms |
2772 KB |
Output is correct |
36 |
Correct |
72 ms |
5052 KB |
Output is correct |
37 |
Correct |
117 ms |
9348 KB |
Output is correct |
38 |
Correct |
203 ms |
11996 KB |
Output is correct |
39 |
Correct |
138 ms |
9416 KB |
Output is correct |
40 |
Correct |
9 ms |
468 KB |
Output is correct |
41 |
Correct |
11 ms |
540 KB |
Output is correct |
42 |
Runtime error |
93 ms |
27068 KB |
Execution killed with signal 11 |
43 |
Halted |
0 ms |
0 KB |
- |