Submission #247200

#TimeUsernameProblemLanguageResultExecution timeMemory
247200dantoh000Lokahian Relics (FXCUP4_lokahia)C++17
0 / 100
7 ms768 KiB
#include <bits/stdc++.h> using namespace std; #include "lokahia.h" int Q[205][205]; int query(int i, int j){ if (i == j) return Q[i][i] = i; else if (Q[i][j] == -1) return Q[i][j] = Q[j][i] = CollectRelics(i,j); else return Q[i][j]; } int FindBase(int N){ memset(Q,-1,sizeof(Q)); int cur = 0; for (int i = 0; i < N; i++){ if (cur == i) continue; int q = query(cur,i); if (q != -1 && q != cur) cur = q; } int ct = 0; for (int i = 0; i < N; i++){ if (i == cur || query(i,cur) != -1) ct++; if (ct > N/2) break; } if (ct > N/2) return cur; else return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...