# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247190 | dantoh000 | 로카히아 유적 (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 <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 |
---|---|---|---|---|
Fetching results... |