Pagini recente » Cod sursa (job #841555) | Cod sursa (job #803107) | Cod sursa (job #2952703) | Cod sursa (job #1790373) | Cod sursa (job #871178)
Cod sursa(job #871178)
#include<stdio.h>
#include<vector>
using namespace std;
FILE*in=fopen("disjoint.in","r");
FILE*out=fopen("disjoint.out","w");
int noduri,query,boss[100001];
int main()
{
fscanf(in,"%d%d",&noduri,&query);
for(int i=1;i<=noduri;++i)
boss[i]=i;
for(int i=0;i<query;++i)
{
int tip,nod1,nod2;
fscanf(in,"%d",&tip);
fscanf(in,"%d%d",&nod1,&nod2);
if(tip==1)
{
if(boss[nod1]>boss[nod2])
boss[nod2]=boss[nod1];
else
boss[nod1]=boss[nod2];
}
else
if(boss[nod1]==boss[nod2])
fprintf(out,"DA\n");
else
fprintf(out,"NU\n");
}
fclose(in);
fclose(out);
return 0;
}