Cod sursa(job #2874861)
Utilizator | Data | 20 martie 2022 13:25:14 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("disjoint.in");
ofstream out ("disjoint.out");
int n,m,v[501],op,x,y;
int main()
{
in>>n>>m;
for (int i=1; i<=n; i++){
v[i]=i;
}
for (int i=1; i<=m; i++){
in>>op>>x>>y;
if (op==1){
int aux=v[x];
for (int j=1; j<=n; j++){
if (v[j]==aux) v[j]=v[y];
}
}
else {
if (v[x]==v[y]) out<<"DA"<<'\n';
else out<<"NU"<<'\n';
}
}
}