Pagini recente » Cod sursa (job #208183) | Istoria paginii utilizator/ginaiuliana | Cod sursa (job #1129258) | Istoria paginii runda/concurs_nou1 | Cod sursa (job #2858973)
#include<fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,m,x,y,c,r[100001];
int cauta(int x)
{
if(x==r[x]) return x;
r[x]=cauta(r[x]);
return r[x];
}
void unire(int x,int y)
{
int rx=cauta(x);
int ry=cauta(y);
if(rx!=ry)
r[rx]=ry;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
r[i]=i;
for(int i=1;i<=m;i++)
{
cin>>c>>x>>y;
if(c==1) unire(x,y);
else if (cauta(x)==cauta(y)) cout<<"DA"<<endl;
else cout<<"NU"<<endl;
}
return 0;
}