Cod sursa(job #2571423)
Utilizator | Iliescu Alexia iliescualexia | Data | 4 martie 2020 23:07:05 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.97 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int i,j,x,y,aux,p,t[100010],m,n,tx,ty;
int dettata(int x)
{
if(t[x]==x)
{
return x;
}
else
{
return dettata(t[x]);
}
}
void act(int x,int y)
{
int nod;
while(x!=t[x])
{
nod=t[x];
t[x]=y;
x=nod;
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
t[i]=i;
}
for(i=1;i<=m;i++)
{
fin>>p>>x>>y;
if(p==1)
{
t[dettata(x)]=t[dettata(y)];
}
else
{
tx=dettata(x); ty=dettata(y);
if(dettata(x)==dettata(y))
{
fout<<"DA"<<'\n';
}
else
{
fout<<"NU"<<'\n';
}
act(x,tx);
act(y,ty);
}
}
return 0;
}