Cod sursa(job #3157615)
| Utilizator | Data | 16 octombrie 2023 12:17:55 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int Nmax=100005;
int p[Nmax];
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)
{
p[y]=p[x];
}
if(c==2)
{
while(p[y]!=y)
{
y=p[y];
}
while(p[x]!=x)
{
x=p[x];
}
if(x==y)
{
fout<<"DA"<<'\n';
}
else fout<<"NU"<<'\n';
}
}
return 0;
}
