Cod sursa(job #2869002)
| Utilizator | Data | 11 martie 2022 12:04:57 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,i;
int tata[100005];
int verif(int x)
{
if(tata[x]==x)return x;
tata[x]=verif(tata[x]);
return tata[x];
}
int main()
{
int cod,x,y;
fin>>n>>m;
for(i=1; i<=n; i++)
{
tata[i]=i;
}
for(i=1; i<=m; i++)
{
fin>>cod>>x>>y;
verif(x);
verif(y);
if(cod==1)
{
tata[tata[y]]=tata[x];
}
else
{
verif(x);
verif(y);
if(tata[x]==tata[y])fout<<"DA"<<'\n';
else fout<<"NU"<<'\n';
}
}
return 0;
}
