Submission #1104904

#TimeUsernameProblemLanguageResultExecution timeMemory
1104904NaxocistGame (IOI14_game)C++17
100 / 100
210 ms17992 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int N = 1503; int cnt[N]; void initialize(int n) { } int hasEdge(int u, int v) { return ++cnt[max(u,v)] == max(u,v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...