Submission #442963

#TimeUsernameProblemLanguageResultExecution timeMemory
442963asbsfdsGame (IOI14_game)C++14
0 / 100
1 ms328 KiB
#include "game.h" #include <bits/stdc++.h> const int maxn = 2000; int n; void initialize(int n) { ::n = n; } int niz[maxn]; int hasEdge(int u, int v) { if (u > v) std::swap(u, v); if (++niz[u] >= n - u) return 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...