Submission #573993

#TimeUsernameProblemLanguageResultExecution timeMemory
573993Valaki2Game (IOI14_game)C++14
0 / 100
1 ms312 KiB
#include <bits/stdc++.h> #include "game.h" using namespace std; const int maxn = 1500; int cnt[maxn + 1]; void initialize(int n) { } int hasEdge(int u, int v) { return cnt[max(u, v)]++ == max(u, v) - 2; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...