Cod sursa(job #1392431)
| Utilizator | Data | 18 martie 2015 17:35:33 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,i,M,a,b,x,ra,rb;
int T[100000];
int rad(int x){
while(T[x]>0)
x=T[x];
return x;
}
int main(){
fin>>n>>m;
for(i=1;i<=n;i++)
T[i]=-1;
for(M=1;M<=m;M++){
fin>>x>>a>>b;
ra=rad(a);
rb=rad(b);
if(x==1){
if(T[ra]<T[rb]){
T[ra]+=T[rb];
T[rb]=ra;
}
else{
T[rb]+=T[ra];
T[ra]=rb;
}
}
else{
if(ra==rb)
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}
