| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 301553 | chirathnirodha | Game (IOI14_game) | C++17 | 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 "grader.h"
#include<bits/stdc++.h>
using namespace std;
int nn;
int unionfind[1500];
int numnodes[1500];
vector<vector<int> > remain;
void initialize(int n){
nn=n;
for(int i=0;i<n;i++){
unionfind[i]=i;
numnodes[i]=1;
remain.push_back(vector<int>());
for(int j=0;j<n;j++)remain[i].push_back(1);
}
}
int hasEdge(int u,int v){
int x=unionfind[u],y=unionfind[v];
if(remain[x][y]>1){
remain[x][y]--;
remain[y][x]--;
return 0;
}
else if(remain[x][y]==1){
int temp=unionfind[v];
for(int i=0;i<nn;i++)if(unionfind[i]==temp)unionfind[i]=unionfind[u];
numnodes[x]+=numnodes[y];
numnodes[y]=0;
for(int i=0;i<nn;i++){
remain[x][i]+=remain[y][i];
remain[i][x]+=remain[y][i];
}
remain[x][y]=remain[y][x]=0;
return 1;
}
}