Cod sursa(job #1585087)

Utilizator andreiudilaUdila Andrei andreiudila Data 30 ianuarie 2016 19:08:00
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,k,tata[100001],i,x,y;

int radacina (int a)
{
    int r=a;
    while(tata[r]!=r)
    {
        r=tata[r];
    }

    while(tata[a]!=a)
    {
        int aux=tata[a];
        tata[a]=r;
        a=aux;
    }

    return r;
}
int main()
{
    fin>>n>>m;

    for(i=1;i<=n;i++) tata[i]=i;

    for(i=1;i<=m;i++)
    {
        fin>>k>>x>>y;

        if(k==1)
            tata[radacina(y)]=radacina(x);
        else
        if(radacina(x)==radacina(y)) fout<<"DA"<<'\n';
        else fout<<"NU\n";
    }
    return 0;
}