Cod sursa(job #2473862)
| Utilizator | Data | 14 octombrie 2019 13:38:00 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,tata[100010];
int c,x,y;
int bigdaddy(int dad)
{
if(tata[dad]==0)
return dad;
return bigdaddy(tata[dad]);
}
void mergedads()
{
tata[bigdaddy(x)]=bigdaddy(y);
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>c>>x>>y;
if(c==1)
{
mergedads();
}
else
{
if(bigdaddy(x)==bigdaddy(y))
out<<"DA\n";
else
out<<"NU\n";
}
}
return 0;
}
