Pagini recente » Cod sursa (job #3343522) | Cod sursa (job #3343902) | Cod sursa (job #3334192) | Cod sursa (job #3302864) | Cod sursa (job #3344401)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin ("disjoint.in");
ofstream cout ("disjoint.out");
int n,m,x,y,tip;
int repr[100005];
int gasire(int x)
{
if (x==repr[x])
return x;
x=repr[x];
return gasire(repr[x]);
}
void unire(int x, int y)
{
int rx=gasire(x);
int ry=gasire(y);
if (rx != ry)
{
repr[rx]=ry;
}
}
int main()
{
cin>>n>>m;
for (int i=1;i<=n;i++)
repr[i]=i;
for (int i=1;i<=m;i++)
{
cin>>tip>>x>>y;
if (tip==1)
{
unire(x,y);
}
if (tip==2)
{
/*for (int i=1;i<=n;i++)
cout<<i<<' ';
cout<<endl;
for (int i=1;i<=n;i++)
cout<<repr[i]<<' ';*/
if (gasire(x)==gasire(y))
cout<<"DA"<<endl;
else
cout<<"NU"<<endl;
}
}
return 0;
}