Cod sursa(job #2329545)
Utilizator | Lup Lucia Fredy | Data | 26 ianuarie 2019 22:01:00 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
#define limn 100010
int n,m,dad[limn];
int get_dad(int x)
{
if(x!=dad[x]) dad[x]=get_dad(dad[x]);
return dad[x];
}
int main()
{
int q,a,b;
fin>>n>>m;
for(int i=1; i<=n; i++) dad[i] = i;
while(m--)
{
fin>>q>>a>>b;
if(q==1)
{
dad[get_dad(a)] = get_dad(b);
}
else
{
if (get_dad(a) == get_dad(b)) fout<<"DA"<<'\n';
else fout<<"NU"<<'\n';
}
}
fin.close();
fout.close();
return 0;
}