Cod sursa(job #1125330)
| Utilizator | Data | 26 februarie 2014 16:57:31 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#define nx 100007
using namespace std;
int n,m,p,i,x,x1,y,y1,t[nx];
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata(int x)
{
while(x!=t[x])x=t[x];
return x;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)t[i]=i;
for(i=1;i<=m;i++)
{
fin>>p>>x>>y;
x1=tata(x);
y1=tata(y);
if(p==1)
{
if(x1<y1)t[y]=x1;
else t[x]=y1;
}
else if(x1==y1)fout<<"DA"<<'\n';
else fout<<"NU"<<'\n';
}
return 0;
}
