Cod sursa(job #3157622)
Utilizator | Data | 16 octombrie 2023 12:32:49 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int Nmax=100005;
int p[Nmax];
int sef(int x)
{
if(p[x]==x)
{
return x;
}
p[x]=sef(p[x]);
return p[x];
}
int main()
{
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
p[i]=i;
}
int c,x,y;
for(int i=1;i<=m;i++)
{
fin>>c>>x>>y;
if(c==1)
{
int sef1=sef(x);
int sef2=sef(y);
p[sef2]=sef1;
}
if(c==2)
{
if(sef(x)==sef(y))
{
fout<<"DA"<<'\n';
}
else fout<<"NU"<<'\n';
}
}
return 0;
}