Pagini recente » Cod sursa (job #1280788) | Cod sursa (job #570798) | Cod sursa (job #725151) | Cod sursa (job #2423583) | Cod sursa (job #2944624)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int papa[100001];
int find_papa(int x){
if(papa[x]==x)
return x;
else
return papa[x]=find_papa(papa[x]);
}
void union_papa(int x,int y){
int daddy_x=find_papa(x),daddy_y=find_papa(y);
if(x<y)
papa[daddy_y]=daddy_x;
else
papa[daddy_x]=daddy_y;
}
int main()
{
int n,m,i,x,y,op;
fin>>n>>m;
for(i=1;i<=n;i++)
papa[i]=i;
for(i=1;i<=m;i++){
fin>>op>>x>>y;
if(op==1)
union_papa(x,y);
else{
if(find_papa(x)==find_papa(y))
fout<<"DA"<<"\n";
else
fout<<"NU"<<"\n";
}
}
return 0;
}