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