Pagini recente » Cod sursa (job #1915286) | Cod sursa (job #843530) | Cod sursa (job #431232) | Cod sursa (job #2702898) | Cod sursa (job #2099122)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int T[100010],RG[100010],i,j,n,m,k,a,b,c;
int fnd(int x)
{
int R,y;
y=x;
for(R=x;T[R]!=R;R=T[R]);
for(;T[x]!=x;)
{
y=T[x];
T[x]=R;
x=y;
}
return R;
}
void unite(int x,int y)
{
if(RG[x]>RG[y])
T[y]=x;
else
T[x]=y;
if(RG[x]==RG[y])
RG[y]++;
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
T[i]=i;
RG[i]=1;
}
for(i=1;i<=m;i++)
{
f>>a>>b>>c;
if(a==1)
{
unite(fnd(b),fnd(c));
}
else
{
if(fnd(b)==fnd(c))
g<<"DA"<<'\n';
else
g<<"NU"<<'\n';
}
}
}