Cod sursa(job #2277521)

Utilizator Alex.PAlexandru Pacurar Alex.P Data 6 noiembrie 2018 14:17:22
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <stdio.h>
#include <stdlib.h>
using namespace std;

FILE *fin, *fout;

int T[100005],t1,t2;

int sef(int x)
{
    if(x==T[x])
        return T[x];
    return T[x] = sef(T[x]);
}

void join(int x, int y)
{
    t1 = sef(x);
    t2 = sef(y);
    T[t2]=t1;
}

int main()
{
    int n, m, cod, x, y, i;
    fin=fopen("disjoint.in","r");
    fout=fopen("disjoint.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i = 1; i<=n; i++)
        T[i]=i;
    for(i = 1; i<=m; i++)
    {
        fscanf(fin,"%d%d%d",&cod,&x,&y);
        if(cod==1)
            join(x, y);
        else
        {
            if(sef(T[x])==sef(T[y]))
                fprintf(fout,"DA\n");
            else
                fprintf(fout,"NU\n");
        }
    }
    return 0;
}