Cod sursa(job #2661286)

Utilizator NashikAndrei Feodorov Nashik Data 21 octombrie 2020 18:38:34
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.95 kb
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,m,v[100005],t[100005],sz[100005];
int daddy(int a){
    if(a==t[a])
        return a;
    t[a]=daddy(t[a]);
    return t[a];
}
int same(int a,int b){
    a=daddy(a);
    b=daddy(b);
    if(a==b){
        return true;
    }
    return false;
}
int unite(int a,int b){
    a=daddy(a);
    b=daddy(b);
    if(sz[a]<sz[b]){
        t[a]=b;
        sz[b]+=sz[a];
    }
    else{
        t[b]=a;
        sz[a]+=sz[b];
    }

}
int main()
{
    int a,b,c;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        sz[i]=1;
        t[i]=i;
    }
    for(int i=1;i<=m;i++){
        cin>>c>>a>>b;
        if(c==1){
            unite(a,b);
        }
        if(c==2){
            if(same(a,b)==true)
                cout<<"DA\n";
            else
                cout<<"NU\n";
        }
    }
    return 0;
}