Cod sursa(job #664518)

Utilizator deneoAdrian Craciun deneo Data 20 ianuarie 2012 11:46:06
Problema Paduri de multimi disjuncte Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <fstream>
using namespace std;

int n, m, PA[100010];

int radacina(int a) {
    int r = a, aux;
    for(r = a; PA[r] != r; r = PA[r]);

    while(PA[a] != a) {
        aux = PA[a];
        PA[a] = r;
        a = aux;
    }
    return r;
}


int main() {
    int i, t, a, b;
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    f >> n >> m;
    for(i = 1; i <= n; ++i)
        PA[i] = i;
    for(i = 1; i <= m; ++i) {
        f >> t >> a >> b;
        if(t == 1)
            PA[b] = a;
        else if(radacina(a) == radacina(b))
            g << "DA\n";
        else
            g << "NU\n";
    }
    g.close();
    return 0;
}