Cod sursa(job #2370944)
Utilizator | Data | 6 martie 2019 14:44:09 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("disjoint.in");
ofstream g ("disjoint.out");
const int nmax=1e5+3;
int v[nmax],n,m,caz,a,b;
inline int usu(int nod)
{
if(v[nod]==nod) return nod;
v[nod]=usu(v[nod]);
return v[nod];
}
int main()
{
ios::sync_with_stdio(false);
f>>n>>m;
for(int i=1;i<=n;++i) v[i]=i;
while(m--)
{
f>>caz>>a>>b;
if(caz==1)
{
if(usu(a)!=usu(b)) v[usu(a)]=usu(b);
}
else
{
if(usu(a)==usu(b)) g<<"DA\n";
else g<<"NU\n";
}
}
return 0;
}