Cod sursa(job #1927771)

Utilizator nicu_serteSerte Nicu nicu_serte Data 15 martie 2017 15:50:54
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, t[100001], rang[100001];
int gaseste(int x)
{
    int r, aux;
    r=x;
    while(t[r]!=r)
        r=t[r];
    while(t[x]!=x)
    {
        aux=t[x];
        t[x]=r;
        x=aux;
    }
    return r;
}
void uneste(int x, int y)
{
    if(rang[y]<rang[x])
        t[y]=x;
    else t[x]=y;
    if(rang[x]==rang[y])
        rang[y]++;
}
int main()
{
    int i, op, x, y;
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        t[i]=i;
        rang[i]=i;
    }
    for(i=1; i<=m; i++)
    {
        fin>>op>>x>>y;
        if(op==1)
            uneste(gaseste(x), gaseste(y));
        else if(gaseste(x)==gaseste(y))
            fout<<"DA\n";
        else fout<<"NU\n";
    }
    fin.close();
    fout.close();
    return 0;
}