Submission #677600

#TimeUsernameProblemLanguageResultExecution timeMemory
677600Hacv16Game (IOI14_game)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #include "game.h" using namespace std; const int MAX = 2e6 + 50; int n, numQ, totQ, numYes, f[MAX]; void initialize(int _n){ n = _n; numYes = n - 1; totQ = n * (n - 1) / 2; return; } int hasEdge(int u, int v){ if(f[u] == n - 1 || f[v] == n - 1 || totQ - numQ <= numYes){ f[u]++; f[v]++; numYes--; numQ++; return 1; } numQ++; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...