Submission #150656

#TimeUsernameProblemLanguageResultExecution timeMemory
150656rkm0959 (#200)Lokahian Relics (FXCUP4_lokahia)C++17
0 / 100
7 ms640 KiB
#include "lokahia.h"

int FindBase(int N) {
    if (N == 1) return -1;

    int cand = (N%2) ? N-1 : -1, k;
    for (int i=0; i+1<N; i+=2) if ((k = CollectRelics(i, i+1)) != -1) cand = k;

    if (cand == -1) return -1;

    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...