Cod sursa(job #1146713)
| Utilizator | Data | 19 martie 2014 11:09:04 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int T[100010],n,m,i,x,y,key;
int multime(int x)
{
int r;
if (T[x]==x)
r=x;
else r=multime(T[x]);
T[x]=r;
return r;
}
int main()
{
ifstream f("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
for (i=1;i<=n;i++) T[i]=i;
for (i=1;i<=m;i++)
{
f>>key>>x>>y;
if (key==2) if (multime(x)==multime(y)) g<<"DA"<<'\n';else g<<"NU"<<'\n';
else T[multime(y)]=multime(x);
}
f.close();
g.close();
return 0;
}
