Cod sursa(job #3244038)

Utilizator RaduCalisovCalisovRadu RaduCalisov Data 23 septembrie 2024 09:27:48
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include <fstream>

using namespace std;

ifstream cin("disjoint.in");
ofstream cout("disjoint.out");

int card[100002],rad[100002];

void uunion(int x,int y){
    if(card[x]<card[y])
    swap(x,y);
    rad[y]=x;
    card[x] +=card[y];
}

int ffind(int x){
    if (rad[x]==x)
        return x;
    rad[x]=ffind(rad[x]);
    return rad[x];
}
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        rad[i]=i;


    for(int i=1;i<=m;i++){
        int c,x,y;
        cin>>c>>x>>y;
        if(c==1)
        uunion(x,y);
        else{
            int nr1=ffind(x),nr2=ffind(y);
            if(nr1==nr2)
            cout<<"YES\n";
            else
            cout<<"NO\n";
        }
    }
}