Cod sursa(job #3272411)
| Utilizator | Data | 29 ianuarie 2025 12:17:54 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[100005],n,m,o,x,y;
int r(int a)
{
if(t[a]!=0)
{
int k=r(t[a]);
t[a]=k;
return k;
}
return a;
}
void op1(int x,int y)
{
int ry=r(y),rx=r(x);
t[ry]=rx;
}
void op2(int x,int y)
{
if(r(x)==r(y))
out<<"DA\n";
else
out<<"NU\n";
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>o>>x>>y;
if(o==1) op1(x,y);
else op2(x,y);
}
return 0;
}
