Submission #1016622

#TimeUsernameProblemLanguageResultExecution timeMemory
1016622NValchanovGame (IOI14_game)C++17
100 / 100
201 ms13896 KiB
#include <bits/stdc++.h> #define endl '\n' using namespace std; typedef long long ll; const int MAXN = 1500 + 10; int outdeg[MAXN]; int n; void initialize(int _n) { n = _n; } int hasEdge(int u, int v) { u++, v++; if(u > v) swap(u, v); outdeg[u]++; if(outdeg[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...