Submission #856235

#TimeUsernameProblemLanguageResultExecution timeMemory
856235HakiersGame (IOI14_game)C++17
0 / 100
1 ms2648 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e3 + 7; bool edge[MAXN][MAXN]; int deg[MAXN]; int hasEdge(int u, int v){ if(!edge[u][v]){ if(min(deg[v], deg[u]) == 2) return 1; deg[u]--; deg[v]--; edge[u][v] = edge[v][u] = 1; return 0; } return 0; } void initg(int n){ for(int i = 1; i <= n; i++) deg[i] = n-1; } void initialize(int n){ initg(n); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...