# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113964 | baqargam | Game (IOI14_game) | C++14 | 0 ms | 0 KiB |
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>
#include "game.h"
using namespace std;
int n,m,k,l,i,j,a,b;
void initialize(int n) {
for(int i=0;i<n*(n-1)/2;i++)
{
cin>>a>>b;
cout<<hasEdge(a,b);
}
}
void unite(int a,int b){
sz[a]+=sz[b];
for(int i=0;i<n;i++){
if(col[i]==b) col[i]=a;
d[a][i]+=d[b][i];
}
}
int hasEdge(int u, int v) {
if(d[col[a]][col[b]]+1==sz[a]*sz[b])
{
unite(col[a],col[b]);
return 1;
}
else
return 0;
}