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 a[1505];
queue <int> q[1505];
void initialize(int n){
for (int i=2; i<=n; i++)a[i]=1;
}
int hasEdge(int u, int v){
int e=0;
if(a[u])swap(v, u);
if(!a[u]){
a[v]--;
if(!a[v]){
e=1;
while(!q[v].empty()){
if(a[q[v].front()])a[q[v].front()]--;
q[v].pop();
}
}
}else q[v].push(u),q[u].push(v);
return e;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |