Cod sursa(job #1043602)

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

using namespace std;

int tata[100002];

int find(int x) {
    int r=x;
    while(tata[r])
        r=tata[r];
    int y,t;
    y=x;
    return r;
}

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(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;
}