Pagini recente » Cod sursa (job #1392086) | Cod sursa (job #2264281) | Cod sursa (job #2385161) | Cod sursa (job #3148842) | Cod sursa (job #2814796)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int boss[100005];
int sef(int x)
{
if(boss[x]==x)
{
return x;
}
else
{
return boss[x]=sef(boss[x]);
}
}
void unire(int x,int y)
{
int s1=sef(x),s2=sef(y);
if(s1!=s2)
{
boss[s2]=s1;
}
}
int main()
{
int n,m,cer,x,y;
cin>>n>>m;
for(int i=1;i<=n;i++)
boss[i]=i;
for(int i=1;i<=m;i++)
{
cin>>cer>>x>>y;
if(cer==1)
{
unire(x,y);
}
else
{
if(sef(x)==sef(y))
cout<<"DA"<<'\n';
else cout<<"NU"<<'\n';
}
}
return 0;
}