Cod sursa(job #2573562)

Utilizator NashikAndrei Feodorov Nashik Data 5 martie 2020 18:09:43
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.9 kb
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int tata[100005],sz[100005],n,m,a,b,cer;
int daddy(int a){
    if(tata[a]==a){
        return a;
    }
    tata[a]=daddy(tata[a]);
    return tata[a];
}
void unite(int a,int b){
    a=daddy(a);
    b=daddy(b);
    if(a!=b){
        if(sz[a]>sz[b])
            swap(a,b);
        tata[a]=b;
        sz[b]+=sz[a];
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        tata[i]=i;
        sz[i]=1;
    }
    for(int i=1;i<=m;i++){
        cin>>cer;
        if(cer==1){
            cin>>a>>b;
            unite(a,b);
        }
        else{
            cin>>a>>b;
            a=daddy(a);
            b=daddy(b);
            if(a==b)
                cout<<"DA\n";
            else
                cout<<"NU\n";
        }
    }
    return 0;
}