Pagini recente » Cod sursa (job #929679) | Cod sursa (job #920966) | Cod sursa (job #1580872) | Cod sursa (job #1798027) | Cod sursa (job #1235700)
#include <stdio.h>
#define NMAX 100001
using namespace std;
FILE * f= fopen("disjoint.in","r"),* g = fopen("disjoint.out","w");
int RG[NMAX],TT[NMAX];
int search1(int x)
{
int aux=x,aux1;
if(TT[x]!=x)return search1(TT[x]);
while(TT[aux]!=aux){aux1=TT[aux];TT[aux]=x;aux=aux1;}
return x;
}
void unite (int x, int y)
{
if(RG[x]>RG[y])TT[search1(y)]=search1(x);
else TT[search1(x)]=search1(y);
if (RG[x] == RG[y]) {RG[y]++;}
}
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);
if(cod == 2)
{
if(search1(x)==search1(y))fprintf(g,"%s\n","DA");
else fprintf(g,"%s\n","NU");
}
else
{
// if (search1(x) == search1(y)) {fprintf(g,"%d ", i);return 0;}
unite(x,y);
}
}
fclose(f);
fclose(g);
return 0;
}