# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67167 | MKopchev | 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>
#include "game.h"
const int nmax=1.5e3+42;
int target[nmax];
void initialize(int n)
{
for(int i=0;i<n;i++)
target[i]=n-i-1;
}
bool hasEdge(int u,int v)
{
int e=min(u,v);
target[e]--;
if(target[e]==0)return 1;
return 0;
}