This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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){
int mx = max(f[u], f[v]);
if(mx == n - 2 || totQ - numQ <= numYes){
f[u]++; f[v]++; numYes--; numQ++;
return 1;
}
numQ++;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |