Cod sursa(job #1644392)

Utilizator Vali_DeaconuVali Deaconu Vali_Deaconu Data 9 martie 2016 22:54:13
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
# include <cstdio>
# include <vector>

using namespace std;

FILE *fin = fopen("disjoint.in", "rt");
FILE *fout = fopen("disjoint.out", "wt");

const int MAX = 100005;
vector<int> t(MAX);
int n, m, tmp, x, y, i;

int radacina(int x) {
    if (t[x] == 0)
        return x;

    t[x] = radacina(t[x]);
    return t[x];
}

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

int main() {
    fscanf(fin, "%d%d", &n, &m);

    for (i=1; i<=m; ++i) {
        fscanf(fin, "%d%d%d", &tmp, &x, &y);

        if (tmp == 1)
            connect(x, y);
        else
            if (radacina(x) == radacina(y))
                fprintf(fout, "DA\n");
            else
                fprintf(fout, "NU\n");
    }
    return 0;
}