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 N;
int que[2000] ={0};
int hasEdge(int u,int v){
que[u]++;
que[v]++;
if(que[u] == N-1 || que[v] == N-1){
return 1;
}else{
return 0;
}
}
void initialize(int n){
N = n;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |