Cod sursa(job #1043605)

Utilizator CosminRusuCosmin Rusu CosminRusu Data 28 noiembrie 2013 20:16:39
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>

using namespace std;

int tata[100002];

int find(int x) {
    if(tata[x] != x)
        tata[x] = find(tata[x]);
    return tata[x];
}

void uneste(int x,int y) {
    x=find(x);
    y=find(y);
    tata[x]=y;
}

int main() {
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    int n,i,m,tip,x,y;
    fin>>n>>m;
    for(int i = 1 ; i <= n ; ++ i)
        tata[i] = i;
    for(i=0; i<m; i++) {
        fin>>tip>>x>>y;
        if(tip==1)
            uneste(x,y);
        else {
            if(find(x)==find(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }

    fin.close();
    fout.close();
    return 0;
}