Cod sursa(job #1395832)

Utilizator mihai.alphamihai craciun mihai.alpha Data 21 martie 2015 16:07:22
Problema Paduri de multimi disjuncte Scor 10
Compilator c Status done
Runda Arhiva educationala Marime 0.91 kb
#include <stdio.h>
#include <stdlib.h>
#define MAX 100002
int sef[MAX];
int main()  {
    FILE *fin, *fout;
    fin = fopen("disjoint.in", "r");
    fout = fopen("disjoint.out", "w");
    int n, m;
    fscanf(fin, "%d%d", &n, &m);
    int i, j, k;
    int cod, x, y;
    for(i = 1;i <= n;i++)
        sef [i] = i;
    for(i = 0;i < m;i++)  {
        fscanf(fin, "%d%d%d", &cod, &x, &y);
        if(cod == 1)  {
        j = x;
            while(sef[j] != j)
                j = sef[j];
        sef[x] = j;
        sef[y] = j;

        }
        else {
            j = x;
            while(sef[j] != j)
                j = sef[j];
            k = y;
            while(sef[k] != k)
                k = sef[k];
            if(j == k)
                fprintf(fout, "DA\n");
            else
                fprintf(fout, "NU\n");
        }
    }
    fclose(fin);
    fclose(fout);
    return 0;
}