Cod sursa(job #1209225)
Utilizator | Data | 17 iulie 2014 12:58:23 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.88 kb |
#include <fstream>
#define DIM 100011
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,T[DIM];
int root(int x){
int y=x,aux;
while(T[x]>0)
x=T[x];
while(T[y]>0)
aux=T[y],T[y]=x,y=aux;
return x;
}
int main(void){
register int i,j,t,x,y;
f>>n>>m;
for(i=1;i<=n;i++) T[i]=-1;
for(i=1;i<=m;i++){
f>>t>>x>>y;
switch(t){
case 1:
x=root(x);
y=root(y);
if(x==y)
continue;
if(T[x]<T[y])
T[x]+=T[y],T[y]=x;
else
T[y]+=T[x],T[x]=y;
break;
default:
x=root(x),y=root(y);
if(x==y) g<<"DA\n";
else g<<"NU\n";
}
}
return 0;
}