# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127314 | nxteru | Game (IOI14_game) | C++14 | 1073 ms | 21568 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 "game.h"
#include <bits/stdc++.h>
using namespace std;
struct UF{
int n,par[1505],rs[1505];
void ini(int x,int v){
n=x;
for(int i=0;i<n;i++){
par[i]=i;
if(i==v)rs[i]=0;
else rs[i]=1;
}
}
int find(int x){
if(par[x]==x)return x;
return par[x]=find(par[x]);
}
void unit(int v,int u){
v=find(v);
u=find(u);
rs[v]+=rs[u];
par[u]=v;
}
};
int n,par[1505];
UF p[1505];
int find(int x){
if(par[x]==x)return x;
return par[x]=find(par[x]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |