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 nmax=1.5e3+42;
int target[nmax];
void initialize(int n)
{
for(int i=0;i<n;i++)
target[i]=n-i-1;
}
int hasEdge(int u,int v)
{
int e=min(u,v);
target[e]--;
if(target[e]==0)return 1;
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... |