Cod sursa(job #2946022)
| Utilizator | Data | 24 noiembrie 2022 14:41:06 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
vector<int> tata(100001);
int gasire(int k)
{
if(tata[k]) {
tata[k] = gasire(tata[k]);
return tata[k];
}
return k;
}
int main(){
f>>n>>m;
int op, x, y;
while (m--)
{
f>>op>>x>>y;
if(op==1)
{
if(gasire(x)!=gasire(y))
{
tata[gasire(x)]=gasire(y);
}
}
else{
if(gasire(x)==gasire(y))
g<<"DA\n";
else
g<<"NU\n";
}
}
f.close();
g.close();
return 0;
}
