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 "game.h"
#include <bits/stdc++.h>
using namespace std;
int a[1501],n,g[1501];
int root(int num){
if(num==a[num])return num;
a[num]=root(a[num]);
return a[num];
}
void initialize(int num) {
n=num;
for(int i=0;i<n;i++){
a[i]=i;
g[i]=n-1;
}
}
int hasEdge(int u, int v) {
int n1=root(u),n2=root(v);
g[n1]--;
g[n2]--;
if(g[n1]&&g[n2])return 0;
else {
a[n1]=min(n1,n2);
a[n2]=min(n1,n2);
return 1;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |