Pagini recente » Cod sursa (job #515362) | Cod sursa (job #3002631) | Cod sursa (job #1809903) | Cod sursa (job #139172) | Cod sursa (job #3209587)
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int tata[100001];
int ftata(int a){
if(tata[a]!=a){
tata[a]=ftata(tata[a]);
}
return tata[a];
}
int main()
{
int n,m,i,tata1,tata2,rasp=0,cer,nod1,nod2;
cin>>n>>m;
for(i=1;i<=n;i++){
tata[i]=i;
}
for(i=0;i<m;i++){
cin>>cer>>nod1>>nod2;
tata1=ftata(nod1);
tata2=ftata(nod2);
if(cer==1){
if(tata1!=tata2){
tata[tata1]=tata2;
}
}else{
if(tata1!=tata2){
cout<<"NU\n";
}else{
cout<<"DA\n";
}
}
}
return 0;
}