Cod sursa(job #1146044)
Utilizator | Rad Emanuel RadEmanuel | Data | 18 martie 2014 17:39:48 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
#define DMAX 100001
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout("disjoint.out");
int n,m,q,x,y,i,dad[DMAX];
int caut(int x)
{
while(x!=dad[x])
x=dad[x];
return x;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;++i)
dad[i]=i;
for(i=0;i<m;++i)
{
fin>>q>>x>>y;
if(q==2)
if(caut(x)==caut(y))
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
else
if(x<y)
dad[y]=x;
else
dad[x]=y;
}
return 0;
}