#include <bits/stdc++.h>
#include "lokahia.h"
using namespace std;
int p[210];
int visit[210][210];
int num[210];
int findset(int i){
return p[i]==i?p[i]:p[i]=findset(p[i]);
}
int FindBase(int N){
srand(3082);
int counter = 0;
for (int i = 0; i < N; i++) p[i] = i;
int fail = 0;
while (counter < 400){
int a = rand()%N,b = rand()%N;
if (fail > 1000) break;
fail++;
if (a == b) continue;
if (visit[a][b]) continue;
if (findset(a) == findset(b)) continue;
fail = 0;
counter++;
visit[a][b] = visit[b][a] = 1;
int temp = CollectRelics(a,b);
if (temp != -1) {
p[findset(a)] = temp;
p[findset(b)] = temp;
}
}
for (int i = 0; i < N; i++){
num[findset(i)]++;
}
int maxi = 0,cur = -1;
for (int i = 0; i < N; i++){
if (num[i] > maxi){
maxi = num[i];
cur = i;
}
}
int tot = 1;
for (int i = 0; i < N; i++){
if (i == cur) continue;
tot += CollectRelics(i,cur)!=-1;
}
if (tot > N/2) return cur;
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 598 |
2 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 599 |
3 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 599 |
4 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 598 |
5 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 518 |
6 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 598 |
7 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 598 |
8 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 518 |
9 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 343 |
10 |
Correct |
5 ms |
512 KB |
Correct : C = 0 |
11 |
Correct |
5 ms |
640 KB |
Correct : C = 212 |
12 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 598 |
13 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 599 |
14 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 353 |
15 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 519 |
16 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 519 |
17 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 599 |
18 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 599 |
19 |
Correct |
5 ms |
512 KB |
Correct : C = 7 |
20 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 598 |
21 |
Incorrect |
5 ms |
768 KB |
Wrong |
22 |
Partially correct |
6 ms |
640 KB |
Partially correct : C = 518 |
23 |
Correct |
5 ms |
640 KB |
Correct : C = 206 |
24 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 519 |
25 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 519 |
26 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 599 |
27 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 518 |