# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381620 | ritul_kr_singh | 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 "game.h"
#include "bits/stdc++.h"
using namespace std;
vector<int> e;
int find(int u){
return e[u] < 0 ? u : e[u] = find(e[u]);
}
int sz(int u){
return -e[find(u)];
}
void union(int u, int v){
u = find(u), v = find(v);
if(u==v) return;
if(e[u] > e[v]) swap(u, v);
e[u] += e[v], e[v] = u;
}
void initialize(int n){
e.assign(n+1, -1);
}
int hasEdge(int u, int v){
if(find(u)==find(v) or sz(u)+sz(v)<n){
union(u, v);
return 1;
}
return 0;
}