Pagini recente » Cod sursa (job #964394) | Cod sursa (job #974273) | Cod sursa (job #205049) | Cod sursa (job #2060203) | Cod sursa (job #418794)
Cod sursa(job #418794)
#include <cstdio>
using namespace std;
#define nmax 100005
FILE *f=fopen("disjoint.in","r");
FILE *g=fopen("disjoint.out","w");
int n,m;
int T[nmax];
int p(int nod)
{
int r;
for(r=nod;T[r]!=r;r=T[r]);
while(nod!=T[nod])
{
nod=T[nod];
T[nod]=r;
}
return r;
}
int main()
{
fscanf(f,"%d %d",&n,&m);
int i,x,y,ok;
for(i=1;i<=n;i++) T[i]=i;
for(i=1;i<=m;i++)
{
fscanf(f,"%d %d %d",&ok,&x,&y);
if(ok==1)
T[p(x)]=p(y);
else if(p(x)==p(y))
fprintf(g,"DA\n");
else
fprintf(g,"NU\n");
}
return 0;
}