Pagini recente » Istoria paginii runda/321 | Cod sursa (job #2632493) | Cod sursa (job #420085) | Cod sursa (job #2054842) | Cod sursa (job #1784580)
#include <stdio.h>
#include <stdlib.h>
#define MAXN 1000000
#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
if(pbuf==BUF_SIZE){
fread(buf, BUF_SIZE, 1, fi);
pbuf=0;
}
return buf[pbuf++];
}
inline long long nextnum(){
long long a=0;
char c=nextch();
while((c<'0' || c>'9') && c!='-')
c=nextch();
int semn=1;
if(c=='-'){
semn=-1;
c=nextch();
}
while('0'<=c && c<='9'){
a=a*10+c-'0';
c=nextch();
}
return a*semn;
}
int father[100001];
inline void Union(int x, int y){
father[y]=x;
}
inline int Find(int x){
if(father[x]==0)
return x;
int y=Find(father[x]);
father[x]=y;
return y;
}
int main(){
fi=fopen("disjoint.in","r");
fo=fopen("disjoint.out","w");
int n=nextnum(), m=nextnum();
for(int i=0;i<m;i++){
int c=nextnum(), x=nextnum(), y=nextnum();
if(c==1)
Union(Find(x), Find(y));
else{
if(Find(x)==Find(y))
fprintf(fo,"DA\n");
else
fprintf(fo,"NU\n");
}
}
fclose(fi);
fclose(fo);
return 0;
}