Pagini recente » Cod sursa (job #1119045) | Cod sursa (job #1263447) | Cod sursa (job #1607051) | Cod sursa (job #497790) | Cod sursa (job #2019729)
//#include <iostream>
#include <fstream>
using namespace std;
int tata[100005],g[100005];
int find(int a)
{
if(tata[tata[a]]!=a)
tata[a]=find(tata[a]);
return tata[a];
}
void unite(int a,int b)
{
a=find(a);
b=find(b);
if(a==b)
return;
if(g[a]<g[b])
{
tata[a]=b;
g[b]+=g[a];
}
else
{
tata[b]=a;
g[a]+=g[b];
}
}
int main()
{
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,m,i,cer,x,y;
cin>>n>>m;
for(i=1;i<=n;i++)
{
tata[i]=i;
g[i]=1;
}
for(i=1;i<=m;i++)
{
cin>>cer>>x>>y;
if(cer==1)
{
unite(x,y);
}
else
{
if(find(x)==find(y))
{
cout<<"DA";
}
else
cout<<"NU";
}
}
return 0;
}