Pagini recente » Cod sursa (job #3281535) | Cod sursa (job #1825176) | Cod sursa (job #1079776) | Cod sursa (job #904060) | Cod sursa (job #2058436)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100002];
int rg[100002];
int c,x,y;
int cauta(int x)
{
int r,y;
r=x;
while(t[r]!=r)
{
r=t[r];
}
while(t[x]!=x)
{
y=t[x];
t[x]=r;
x=y;
}
return r;
}
void uneste(int x,int y)
{
if(rg[y]>rg[x])
t[x]=y;
else
t[y]=x;
if(rg[y]==rg[x])
rg[y]++;
}
int main()
{
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
t[i]=i;
rg[i]=1;
}
for(int i=1;i<=m;i++)
{
fin>>c>>x>>y;
if(c==2)
{
if(cauta(x)==cauta(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
else
{
uneste(cauta(x),cauta(y));
}
}
return 0;
}