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<algorithm>
using namespace std;
int degree[10010];
void initialize(int n){
for(int i=0;i<n;i++)degree[i]=i;
}
int hasEdge(int u, int v){
int t=max(u,v);
if(degree[t]==1)return 1;
degree[t]--;
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... |