| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 150798 | rkm0959 (#200) | Lokahian Relics (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"
#include <bits/stdc++.h>
using namespace std;
int FindBase(int N) {
srand(20001021);
vector<int> ans;
int k;
for (int i=0; i+1<N; i+=2) if ((k = CollectRelics(i, i+1)) != -1) ans.push_back(k);
if (N%2 and ans.empty()) ans.push_back(N-1);
if (ans.empty()) return -1;
int cand = ans[rand() % ans.size()];
int cnt = 1;
for (int i=0; i<N; i++) if (i != cand) cnt += (CollectRelics(cand, i) != -1);
if (cnt > N/2) return cand;
return -1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
