Cod sursa(job #3253589)
| Utilizator | Data | 3 noiembrie 2024 17:21:23 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
using namespace std;
int p[100005];
int root(int a)
{
while(p[a] != a)
a = p[a];
return a;
}
void unite(int a, int b)
{
a = root(a);
b = root(b);
if(p[a] != p[b])
p[a] = b;
}
int main()
{
int n, m;
cin>>n>>m;
for(int i=1;i<=n;i++)
p[i] = i;
int c, a, b;
for(int i=1;i<=m;i++)
{
cin>>c>>a>>b;
if(c == 1) unite(a, b);
else if(c == 2)
{
if(root(a) == root(b))
cout<<"DA";
else
cout<<"NU";
cout<<'\n';
}
}
return 0;
}
