Pagini recente » Cod sursa (job #1800535) | Cod sursa (job #1784975) | Cod sursa (job #465930) | Cod sursa (job #121177) | Cod sursa (job #2815866)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int tata[100001];
int sef(int x)
{
if(tata[x]==x)
return x;
else
return tata[x]=sef(tata[x]);
}
void unire(int x, int y)
{
int s1=sef(x);
int s2=sef(y);
tata[s2]=s1;
}
int main()
{ int n, m, i, ii, x, y, tip;
cin>>n>>m;
for(i=1; i<=n; i++)
tata[i]=i;
for(i=1; i<=m; i++)
{
cin>>tip>>x>>y;
if(tip==1)
unire(x, y);
else
{
int s1=sef(x);
int s2=sef(y);
if(s1==s2)
cout<<"DA"<<'\n';
else
cout<<"NU"<<'\n';
}
}
return 0;
}