Cod sursa(job #662063)
Utilizator | Data | 15 ianuarie 2012 19:26:40 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,op,x,y;
int tata[100100];
int gasit(int i)
{if(tata[i]!=i)
return i;
return tata[i]=gasit(tata[i]);
}
int main()
{ f>>n>>m;
for(int i=0;i<=n;i++)
tata[i]=i;
for(int i=0;i<m;++i){
f>>op>>x>>y;
if(op==1){
tata[y]=gasit(x);
}
else
if(gasit(y)==tata[x])
g<<"DA\n";
else
g<<"NU\n";
}
return 0;
}