| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 149896 | 본인 하지만 안 어림 ㅋㅋ (#200) | 로카히아 유적 (FXCUP4_lokahia) | C++17 | 7 ms | 640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "lokahia.h"
int p[202];
int a[202];
int FindBase(int N){
int i, j, k, t;
for (i = 0; i < N; i++) {
p[i] = 1;
a[i] = i;
}
for (i = j = k = 0; i < N; i++) {
if (k) {
t = a[j] == a[i] ? CollectRelics(a[j], a[i]) : a[j];
if (t == -1) k--;
else {
p[i] = 0;
p[j]++;
a[j] = t;
k++;
}
}
else {
j = i;
k = 1;
}
}
if (!k) return -1;
for (i = 0; i < j; i++) if (p[i]) {
t = a[j] == a[i] ? CollectRelics(a[j], a[i]) : a[j];
if (t != -1) {
a[j] = t;
p[j] += p[i];
}
}
if (p[j] * 2 > N) return a[j];
return -1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
