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