Pagini recente » Cod sursa (job #1176011) | Cod sursa (job #2446895) | Cod sursa (job #277781) | Cod sursa (job #2947672) | Cod sursa (job #999942)
Cod sursa(job #999942)
#include <cstdio>
using namespace std;
const int Nmax = 100005;
int N,M,daddy[ Nmax ];
inline int whos_ur_daddy(int nodc)
{
if(daddy[nodc]!=nodc)
daddy[nodc] = whos_ur_daddy(daddy[nodc]);
return daddy[nodc];
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&N,&M);
for(int i=1;i<=N;++i)daddy[i]=i;
int type,a,b;
while(M--)
{
scanf("%d%d%d",&type,&a,&b);
if(type == 1)
{
daddy[a]=whos_ur_daddy(a);
daddy[b]=whos_ur_daddy(b);
daddy[daddy[a]]=daddy[b];
}
else if( whos_ur_daddy(a)==whos_ur_daddy(b))
printf("DA\n");
else
printf("NU\n");
}
return 0;
}