#include "lokahia.h"
int FindBase(int N){
int prev = N - 2, cur = N - 1, cnt = 0;
while (true) {
int temp = CollectRelics(prev, cur);
if (temp == -1) cur = cnt++, prev = N - 1;
if (temp == cur) return cur;
prev = cur;
cur = temp;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
620 KB |
Wrong |
2 |
Correct |
1 ms |
492 KB |
Correct : C = 2 |
3 |
Incorrect |
1 ms |
620 KB |
Wrong |
4 |
Incorrect |
1 ms |
620 KB |
Wrong |
5 |
Incorrect |
1 ms |
620 KB |
Wrong |
6 |
Correct |
0 ms |
492 KB |
Correct : C = 2 |
7 |
Incorrect |
1 ms |
492 KB |
Wrong |
8 |
Correct |
1 ms |
492 KB |
Correct : C = 2 |
9 |
Incorrect |
1 ms |
620 KB |
Wrong |
10 |
Incorrect |
1 ms |
620 KB |
Wrong |
11 |
Incorrect |
1 ms |
620 KB |
Wrong |
12 |
Incorrect |
1 ms |
492 KB |
Wrong |
13 |
Correct |
2 ms |
620 KB |
Correct : C = 2 |
14 |
Incorrect |
1 ms |
620 KB |
Wrong |
15 |
Incorrect |
1 ms |
620 KB |
Wrong |
16 |
Incorrect |
1 ms |
492 KB |
Wrong |
17 |
Incorrect |
1 ms |
492 KB |
Wrong |
18 |
Incorrect |
1 ms |
492 KB |
Wrong |
19 |
Incorrect |
1 ms |
620 KB |
Wrong |
20 |
Incorrect |
0 ms |
492 KB |
Wrong |
21 |
Incorrect |
1 ms |
748 KB |
Wrong |
22 |
Correct |
1 ms |
620 KB |
Correct : C = 2 |
23 |
Correct |
1 ms |
492 KB |
Correct : C = 2 |
24 |
Incorrect |
1 ms |
620 KB |
Wrong |
25 |
Incorrect |
1 ms |
620 KB |
Wrong |
26 |
Incorrect |
1 ms |
492 KB |
Wrong |
27 |
Correct |
1 ms |
492 KB |
Correct : C = 2 |