Cod sursa(job #3367674)
| Utilizator | Data | 9 octombrie 2026 17:29:11 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int v[501];
int main()
{
int n,m,i,op,x,y,j,copie;
cin >> n >> m;
for (i=1;i<=n;i++)
v[i]=i;
for (i=1;i<=m;i++)
{
cin >> op >> x >> y;
if (op==1)
{
copie=v[y];
for (j=1;j<=n;j++)
{
if (v[j]==copie)
v[j]=v[x];
}
}
else
if (v[x]==v[y])
cout << "DA" << '\n';
else cout << "NU" << '\n';
}
return 0;
}
