Cod sursa(job #3215092)
Utilizator | Data | 14 martie 2024 17:57:52 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
using namespace std;
int n,m,v[503],c,x,y;
int main()
{
cin>>n>>m;
for (int i=1;i<=n;i++)
v[i]=i;
while (m--)
{
cin>>c>>x>>y;
if (c==1)
{
if (v[x]!=v[y])
{
int a=v[y];
for (int i=1;i<=n;i++)
if (v[i]==a) v[i]=v[x];
}
}
else
{
if (v[x]==v[y])
cout<<"DA"<<'\n';
else
cout<<"NU"<<'\n';
}
}
return 0;
}