Submission #150779

#TimeUsernameProblemLanguageResultExecution timeMemory
150779rkm0959 (#200)Lokahian Relics (FXCUP4_lokahia)C++17
0 / 100
9 ms640 KiB
#include "lokahia.h" #include <bits/stdc++.h> using namespace std; int FindBase(int N) { 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 timeMemoryGrader output
Fetching results...