Cod sursa(job #2682004)
Utilizator | Data | 7 decembrie 2020 16:16:44 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n,m,x,y,i,v[100001],cod;
int radacina(int x)
{
while(v[x])x=v[x];
return x;
}
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int main()
{
f>>n>>m;
while(m--)
{
f>>cod>>x>>y;
if(cod==1)
v[radacina(x)]=radacina(y);
if(cod==2)
{
if(radacina(x)==radacina(y))g<<"DA\n";
else g<<"NU\n";
}
}
}