Cod sursa(job #2538983)
| Utilizator | Data | 5 februarie 2020 14:48:20 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int v[100005];
int n,m;
int tata(int a)
{
if(v[a]==a)
return a;
tata(v[a]);
}
void reuniune(int a,int b)
{
int x=tata(a),xx=tata(b);
v[x]=xx;
}
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
v[i]=i;
for(int i=1;i<=m;i++)
{
int a,b,c;
in>>a>>b>>c;
if(a==1)
reuniune(b,c);
else
{
int x=tata(b);
int xx=tata(c);
if(x==xx)
out<<"DA \n";
else
out<<"NU \n";
}
}
return 0;
}
