This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub mugen1337/procon
#include "UnionFind/UnionFind.hpp"
struct UnionFind{ private: vector<int> par,siz; public: int con; UnionFind(int n):par(n),siz(n,1),con(n){ iota(begin(par),end(par),0); } int root(int x){ return (par[x]==x?x:(par[x]=root(par[x]))); } bool sameroot(int x,int y){ return root(x)==root(y); } bool unite(int x,int y){ x=root(x);y=root(y); if(x==y) return false; if(siz[x]<siz[y])swap(x,y); siz[x]+=siz[y]; par[y]=x; con--; return true; } int size(int x){ return siz[root(x)]; } };
#line 1 "UnionFind/UnionFind.hpp" struct UnionFind{ private: vector<int> par,siz; public: int con; UnionFind(int n):par(n),siz(n,1),con(n){ iota(begin(par),end(par),0); } int root(int x){ return (par[x]==x?x:(par[x]=root(par[x]))); } bool sameroot(int x,int y){ return root(x)==root(y); } bool unite(int x,int y){ x=root(x);y=root(y); if(x==y) return false; if(siz[x]<siz[y])swap(x,y); siz[x]+=siz[y]; par[y]=x; con--; return true; } int size(int x){ return siz[root(x)]; } };