# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92184 | CPX | 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.
void initialize(int n) {
::n=n;
for(int i = 0 ; i<= n ; i++)vis[i][i]=1;
}
int hasEdge(int u, int v) {
if(vis[u][v])return val[u][v];
vis[u][v]=vis[v][u]=1;
ctr[u]++;
ctr[v]++;
if(ctr[u]>n-2||ctr[v]>n-2){
val[u][v]=val[v][u]=1;
return 1;
}else{
val[u][v]=val[v][u]=0;
return 0;
}
}