Cod sursa(job #3037753)
| Utilizator | Data | 26 martie 2023 13:13:57 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m;
int t[100005];
int rad(int val)
{
if(t[val]==0)
return val;
rad(t[val]);
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int op,x,y;
fin>>op>>x>>y;
if(op==1)
{
if(x>y)
swap(x,y);
t[rad(y)]=rad(x);
}
else
{
(rad(y)==rad(x)) ? fout<<"DA" : fout<<"NU";
fout<<'\n';
}
}
}
