Cod sursa(job #1439137)
| Utilizator | Data | 21 mai 2015 16:17:17 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int n,m,v[100001],i,op,x,y;
int stramos(int x){
if(v[x]==x) return x;
else return stramos(v[x]);
}
int main(){
ifstream in("disjoint.in");
ofstream out("disjoint.out");
in>>n>>m;
for(i=1;i<=n;i++) v[i]=i;
for(i=1;i<=m;i++){
in>>op>>x>>y;
if(op==1) v[y]=v[x];
else if(stramos(x)==stramos(y)) out<<"DA"<<'\n';
else out<<"NU"<<'\n';
}
in.close();
out.close();
return 0;
}
