Cod sursa(job #1644370)

Utilizator Vali_DeaconuVali Deaconu Vali_Deaconu Data 9 martie 2016 22:45:06
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
# include <fstream>
# include <vector>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int MAX = 100005;
vector<int> t(MAX);
int n, m;

int radacina(int x) {
    int r;
    for (r = x; t[r] > 0; r = t[r])
        ;
    return r;
}

void connect(int x, int y) {
    t[radacina(x)] = radacina(y);
}

int main() {
    int tmp, x, y, i;
    fin >> n >> m;

    for (i=1; i<=m; ++i) {
        fin >> tmp >> x >> y;
        if (tmp == 1)
            connect(x, y);
        else if (radacina(x) != radacina(y))
                fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}