Pagini recente » Cod sursa (job #990271) | Cod sursa (job #913322) | Cod sursa (job #2144677) | Cod sursa (job #279406) | Cod sursa (job #2815888)
#include <fstream>
using namespace std;
ifstream cin("disjunct.in");
ofstream cout("disjunct.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)
{
tata[sef(y)]=sef(x);
}
int main()
{
int n,m,c,x,y,i;
cin>>n>>m;
for(i=1; i<=n; i++)
tata[i]=i;
for(i=1; i<=m; i++)
{
cin>>c>>x>>y;
if(c==1)
unire(x,y);
else
{
if(sef(x)==sef(y))
cout<<"DA"<<'\n';
else
cout<<"NU"<<'\n';
}
}
return 0;
}