#include <bits/stdc++.h>
using namespace std;
#include "lokahia.h"
int FindBase(int N){
int cur = 0;
for (int i = 1; i < N; i++){
int q = CollectRelics(cur,i);
if (q != -1 && q != cur) cur = q;
}
int ct = 0;
for (int i = 0; i < N; i++){
if (i == cur || CollectRelics(i,cur) != -1) ct++;
}
if (ct > N/2) return cur;
else return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
640 KB |
Wrong |
2 |
Incorrect |
5 ms |
640 KB |
Wrong |
3 |
Correct |
5 ms |
512 KB |
Correct : C = 236 |
4 |
Incorrect |
5 ms |
640 KB |
Wrong |
5 |
Correct |
4 ms |
512 KB |
Correct : C = 0 |
6 |
Incorrect |
5 ms |
640 KB |
Wrong |
7 |
Incorrect |
5 ms |
640 KB |
Wrong |
8 |
Incorrect |
5 ms |
512 KB |
Wrong |
9 |
Incorrect |
5 ms |
640 KB |
Wrong |
10 |
Partially correct |
7 ms |
640 KB |
Partially correct : C = 398 |
11 |
Correct |
5 ms |
640 KB |
Correct : C = 238 |
12 |
Incorrect |
5 ms |
640 KB |
Wrong |
13 |
Incorrect |
5 ms |
640 KB |
Wrong |
14 |
Incorrect |
5 ms |
640 KB |
Wrong |
15 |
Incorrect |
5 ms |
512 KB |
Wrong |
16 |
Correct |
5 ms |
512 KB |
Correct : C = 238 |
17 |
Incorrect |
5 ms |
640 KB |
Wrong |
18 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 398 |
19 |
Incorrect |
5 ms |
640 KB |
Wrong |
20 |
Incorrect |
5 ms |
640 KB |
Wrong |
21 |
Correct |
4 ms |
512 KB |
Correct : C = 8 |
22 |
Incorrect |
5 ms |
640 KB |
Wrong |
23 |
Incorrect |
5 ms |
640 KB |
Wrong |
24 |
Incorrect |
5 ms |
640 KB |
Wrong |
25 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 396 |
26 |
Correct |
5 ms |
512 KB |
Correct : C = 236 |
27 |
Incorrect |
5 ms |
640 KB |
Wrong |