Cod sursa(job #2675186)
Utilizator | Gulin Tudor gulin | Data | 21 noiembrie 2020 11:01:03 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,v[100005],caz,x,y;
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
v[i]=i;
for(int h=1; h<=m; h++)
{
fin>>caz>>x>>y;
if(caz==1)
{
v[y]=x;
}
else
{
while(v[x]!=x)
{
x=v[x];
}
while(v[y]!=y)
{
y=v[y];
}
if(x==y)
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
}
}
return 0;
}