Pagini recente » Cod sursa (job #134198) | Cod sursa (job #1011983) | Cod sursa (job #2100760) | Cod sursa (job #398778) | Cod sursa (job #1235694)
#include <stdio.h>
#define NMAX 100001
using namespace std;
FILE * f=fopen("disjoint.in","r"),* g = fopen("disjoint.out","w");
int n,m;
int RG[NMAX],TT[NMAX];
int search1(int x)
{
if(TT[x]!=x)return search1(TT[x]);
return x;
}
void leg()
{
for(int i=1;i<=n;i++)
TT[i]=search1(i);
}
void unite (int x, int y)
{
if(RG[x]>RG[y])TT[y]=x;
else TT[x]=y;
if (RG[x] == RG[y]) {RG[x]++;}
}
//int n,m;
int main()
{
fscanf(f,"%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
TT[i]=i;
RG[i]=1;
}
int cod,x,y;
for(int i=1;i<=m;i++)
{
fscanf(f,"%d %d %d",&cod,&x,&y);
leg();
if(cod == 2)
{
if(search1(x)==search1(y))fprintf(g,"%s\n","DA");
else fprintf(g,"%s\n","NU");
}
else
{
unite(x,y);
}
}
fclose(f);
fclose(g);
return 0;
}