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"
using namespace std;
int a[35005],p[35005];
int P(int x) {
if (p[x]==x) return x;
return p[x]=P(p[x]);
}
void Uni(int a,int b) {
a=P(a);
b=P(b);
p[b]=a;
}
void initialize(int n) {
for (int i=1; i<=n; i++)
p[i]=i,a[i]=n-1;
}
int hasEdge(int u,int v) {
u++,v++;
if (P(u)==P(v)){
a[u]--,a[v]--;
return 1;
}
if (a[u]==1 || a[v]==1) {
Uni(u,v);
if (a[u]) a[u]--;
if (a[v]) a[v]--;
return 1;
}
a[u]--,a[v]--;
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... |