Pagini recente » Cod sursa (job #2504981) | Cod sursa (job #1268801) | Cod sursa (job #2049695) | Cod sursa (job #2651082) | Cod sursa (job #2700999)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int sef[100001],n,m;
int sefsup(int a){
if(sef[a]==a)
return a;
else{
sef[a]=sefsup(sef[a]);
return sef[a];
}
}
void unire(int a,int b){
int sefa,sefb;
sefa=sefsup(a);
sefb=sefsup(b);
sef[sefb]=sefa;
}
int main()
{
int i,x,y,op;
in>>n>>m;
for(i=1;i<=n;i++)
sef[i]=i;
for(i=1;i<=m;i++){
in>>op>>x>>y;
if(op==1)
unire(x,y);
else{
if(sefsup(x)==sefsup(y))
out<<"DA"<<'\n';
else
out<<"NU"<<'\n';
}
}
return 0;
}