# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247226 | 2020-07-11T08:13:35 Z | dantoh000 | Lokahian Relics (FXCUP4_lokahia) | C++17 | 7 ms | 916 KB |
#include <bits/stdc++.h> using namespace std; #include "lokahia.h" int Q[205][205]; int query(int i, int j){ if (i == j) return Q[i][i] = i; else if (Q[i][j] == -1) return Q[i][j] = Q[j][i] = CollectRelics(i,j); else return Q[i][j]; } int FindBase(int N){ memset(Q,-1,sizeof(Q)); int s = -1, e = -1; for (int i = 0; i < N/2; i++){ if (query(i,(i+N/2+1)%N) != -1){ s = i; e = (i+N/2+1)%N; break; } } if (s == -1) return -1; else return s; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 896 KB | Correct : C = 99 |
2 | Correct | 5 ms | 768 KB | Correct : C = 59 |
3 | Incorrect | 7 ms | 768 KB | Wrong |
4 | Incorrect | 5 ms | 768 KB | Wrong |
5 | Incorrect | 5 ms | 768 KB | Wrong |
6 | Incorrect | 6 ms | 768 KB | Wrong |
7 | Correct | 5 ms | 768 KB | Correct : C = 100 |
8 | Incorrect | 5 ms | 768 KB | Wrong |
9 | Incorrect | 5 ms | 768 KB | Wrong |
10 | Incorrect | 5 ms | 768 KB | Wrong |
11 | Incorrect | 5 ms | 768 KB | Wrong |
12 | Incorrect | 5 ms | 768 KB | Wrong |
13 | Correct | 5 ms | 768 KB | Correct : C = 60 |
14 | Incorrect | 5 ms | 768 KB | Wrong |
15 | Incorrect | 7 ms | 768 KB | Wrong |
16 | Incorrect | 5 ms | 640 KB | Wrong |
17 | Incorrect | 5 ms | 768 KB | Wrong |
18 | Incorrect | 7 ms | 768 KB | Wrong |
19 | Incorrect | 6 ms | 768 KB | Wrong |
20 | Incorrect | 5 ms | 768 KB | Wrong |
21 | Incorrect | 5 ms | 768 KB | Wrong |
22 | Incorrect | 6 ms | 768 KB | Wrong |
23 | Incorrect | 5 ms | 916 KB | Wrong |
24 | Incorrect | 5 ms | 768 KB | Wrong |
25 | Incorrect | 5 ms | 640 KB | Wrong |
26 | Incorrect | 5 ms | 768 KB | Wrong |
27 | Incorrect | 5 ms | 768 KB | Wrong |