Pagini recente » Cod sursa (job #2616221) | Cod sursa (job #228819) | Cod sursa (job #1939924) | Cod sursa (job #2792872) | Cod sursa (job #2815863)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int tata[100001];
int sef(int x){
if(x==tata[x])
return x;
else
return tata[x]=sef(tata[x]);
}
void unire(int x,int y){
x=sef(x);
y=sef(y);
tata[y]=x;
}
int main()
{
int i,n,m,cod,x,y,s1,s2;
cin>>n>>m;
for(i=1;i<=n;i++)
tata[i]=i;
for(i=1;i<=m;i++){
cin>>cod>>x>>y;
if(cod==1)
unire(x,y);
else{
s1=sef(x);
s2=sef(y);
if(s1==s2)
cout<<"DA"<<'\n';
else
cout<<"NU"<<'\n';
}
}
return 0;
}