Cod sursa(job #3235347)
| Utilizator | Data | 17 iunie 2024 10:14:49 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int v[501];
int main()
{
int n, m;
cin>>n>>m;
for(int i=1; i<=n; i++)
{
v[i]=i;
}
for(int i=1; i<=m; i++)
{
int op, x, y;
cin>>op>>x>>y;
if(op==2)
{
if(v[x]==v[y])
{
cout<<"DA\n";
}
else
{
cout<<"NU\n";
}
}
else
{
int sef=v[y];
for(int j=1; j<=n; j++)
{
if(v[j]==sef)
{
v[j]=v[x];
}
}
}
}
return 0;
}
