Cod sursa(job #812093)
| Utilizator | Data | 13 noiembrie 2012 14:37:20 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
#define nmax 100010
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,t[nmax];
int rad(int x)
{
if (t[x]==0)
return x;
else
return rad(t[x]);
}
void citire()
{
f>>n>>m;
int x,y,op,r1,r2;
for (int i=1;i<=m;++i)
{
f>>op;
f>>x>>y;
r1=rad(x);
r2=rad(y);
if (op==1)
t[r2]=r1;
else
{
if (r2==r1)
g<<"DA\n";
else
g<<"NU\n";
}
}
}
int main()
{
citire();
return 0;
}
