Pagini recente » Cod sursa (job #1133103) | Cod sursa (job #3290850) | Cod sursa (job #2581646) | Cod sursa (job #972853) | Cod sursa (job #499675)
Cod sursa(job #499675)
#include<stdio.h>
#define MAX 100001
int m,n,x,y,cod,T[MAX],R[MAX];
void init()
{
int i;
for(i=1;i<=n;++i)
{T[i] = i;R[i] = 1;}
}
void compress(int i,int rad)
{
int var;
for(;i != T[i];i=var)
{
var = T[i];
T[i] = rad;
}
}
int verif(int x,int y)
{
int i,rad,rad1;
i = T[x];
for(;i != T[i] ;i=T[i]);
rad = i;
compress(T[x], rad);
i=T[y];
for(;i != T[i] ;i=T[i]);
rad1 = i;
compress(T[y], rad1);
return (rad == rad1);
}
void unite(int x,int y)
{
if(R[x]>=R[y])
{
T[T[y]] = T[T[x]];
R[x] += R[y];
}
else
{
R[y] += R[x];
T[T[x]] = T[T[y]];
}
}
int main()
{
FILE*f = fopen("disjoint.in","r");
FILE*g = fopen("disjoint.out","w");
fscanf(f,"%d%d",&n,&m);
init();
while(m--)
{
fscanf(f,"%d%d%d",&cod,&x,&y);
if(cod == 2)
{
if(verif(x,y))fprintf(g,"DA\n");
else fprintf(g,"NU\n");
}
else
{
unite(x,y);
}
}
fclose(f);
fclose(g);
return 0;
}