Cod sursa(job #2547402)

Utilizator olteanupetru02Olteanu Petru olteanupetru02 Data 15 februarie 2020 12:17:27
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>

using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int N = 100001;
const int M = 100001;

int n,nr[N],m,cod,x,y,t[N];

int radacina(int x){
    if(t[x]==0)
        return x;
    t[x]=radacina(t[x]);
    return t[x];
}
void reuniune(int x,int y){
    int rx = radacina(x);
    int ry = radacina(y);
    if(rx == ry)
        return;
    if(nr[rx] < nr[ry]){
        t[rx] = ry;
        nr[ry] += nr[rx];
    }else{
        t[ry] = rx;
        nr[rx] += ry;
    }
}
bool interogare(int x,int y){
    return(radacina(x) == radacina(y));
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++){
        in>>cod>>x>>y;
        if(cod==1)
            reuniune(x,y);
        else{
            if(interogare(x,y))
                out<<"DA"<<'\n';
        else
            out<<"NU"<<'\n';
        }
    }
    return 0;
}