Submission #247190

#TimeUsernameProblemLanguageResultExecution timeMemory
247190dantoh000로카히아 유적 (FXCUP4_lokahia)C++17
0 / 100
7 ms640 KiB
#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 timeMemoryGrader output
Fetching results...