Cod sursa(job #2815820)
Utilizator | Petrescu Ioan Stefan BOSSSTEFAN | Data | 10 decembrie 2021 14:29:50 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int v[100001];
int main()
{
int m,n,op,x,y,i,j,aux;
cin>>n>>m;
for(i=1;i<=n;i++)
{
v[i]=i;
}
for (j=1;j<=m;j++)
{
cin>>op>>x>>y;
if(op==1)
{
if(v[x]!=v[y]){aux=v[y];
for (i=1;i<=n;i++)
if(v[i]==aux)
v[i]=v[x];}
}
else{
if (v[x]==v[y])
cout<<"DA"<<endl;
else
cout<<"NU"<<endl;}
}
return 0;
}