#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(1423);
int counter = 0;
for (int i = 0; i < N; i++) p[i] = i;
int fail = 0;
while (counter < 200){
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 = 0;
for (int i = 0; i < N; i++){
if (findset(i)== cur) tot++;
else tot += CollectRelics(i,cur)!=-1;
}
if (tot > N/2) return cur;
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 399 |
2 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 318 |
3 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 319 |
4 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 376 |
5 |
Incorrect |
5 ms |
640 KB |
Wrong |
6 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 336 |
7 |
Correct |
5 ms |
640 KB |
Correct : C = 265 |
8 |
Partially correct |
7 ms |
768 KB |
Partially correct : C = 381 |
9 |
Incorrect |
5 ms |
768 KB |
Wrong |
10 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 310 |
11 |
Correct |
5 ms |
640 KB |
Correct : C = 88 |
12 |
Correct |
5 ms |
512 KB |
Correct : C = 4 |
13 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 333 |
14 |
Partially correct |
7 ms |
768 KB |
Partially correct : C = 332 |
15 |
Correct |
6 ms |
768 KB |
Correct : C = 149 |
16 |
Correct |
6 ms |
640 KB |
Correct : C = 89 |
17 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 319 |
18 |
Correct |
5 ms |
512 KB |
Correct : C = 0 |
19 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 398 |
20 |
Partially correct |
6 ms |
816 KB |
Partially correct : C = 325 |
21 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 340 |
22 |
Correct |
5 ms |
768 KB |
Correct : C = 147 |
23 |
Correct |
5 ms |
640 KB |
Correct : C = 269 |
24 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 325 |
25 |
Correct |
5 ms |
640 KB |
Correct : C = 268 |
26 |
Correct |
5 ms |
640 KB |
Correct : C = 265 |
27 |
Correct |
6 ms |
640 KB |
Correct : C = 268 |