# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990533 | Lib | Game (IOI14_game) | C++14 | 0 ms | 0 KiB |
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>
using namespace std;
int q[10003];
int con[10003];
int N;
void initialize(int n){
N=n-1;
}
int hasEdge(int u, int v){
q[u]++;
q[v]++;
int ret=0;
if(q[u]==N||q[v]==n||con[u]||con[v]){
ret=1;
con[u]=1;
con[v]=1;
}
return ret;
}