Cod sursa(job #2154447)

Utilizator tuddor1234Turdasan Tudor tuddor1234 Data 6 martie 2018 22:50:07
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>

#define maxSize 100002

using namespace std;

ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

int T[maxSize];
int rang[maxSize];
int n,m,cer,x,y;

int find(int nod)
{
    if(nod!=T[nod])
        nod=find(T[nod]);
    return T[nod];
}

void unite(int x,int y)
{
    x=find(x); y=find(y);
    if(rang[x]<rang[y]) T[x]=y;
    else T[y]=x;

    if(rang[x]==rang[y])
    {
        rang[x]++;
    }
}


int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++){ T[i]=i;rang[i]=1;}

    for(int i=1;i<=m;i++)
    {
        fin>>cer>>x>>y;
        if(cer==1) unite(x,y);
        else
        {
            if(find(x)==find(y)) cout<<"DA";
            else cout<<"NU";
            cout<<'\n';
        }


    }

    return 0;
}