Cod sursa(job #2571386)
Utilizator | Anda Epure andaraluca2001 | Data | 4 martie 2020 22:47:10 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
const int MAX=100001;
int tata[MAX],n,m,cod,x,y;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int radacina(int nod)
{
if(tata[nod]==nod) return nod;
int ans;
ans=radacina(tata[nod]);
tata[nod]=ans;
return ans;
}
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++) tata[i]=i;
for(int i=1;i<=m;i++)
{
in>>cod>>x>>y;
if(cod==1)
{
tata[radacina(x)]=radacina(y);
}
else if(cod==2)
{
if(radacina(x)==radacina(y)) out<<"DA\n";
else out<<"NU\n";
}
}
return 0;
}