Cod sursa(job #2019737)

Utilizator NashikAndrei Feodorov Nashik Data 8 septembrie 2017 13:45:36
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
//#include <iostream>
//#include <fstream>
#include <cstdio>
using namespace std;

int tata[100005],g[100005];
int find(int a)
{
    if(tata[tata[a]]!=a)
        tata[a]=find(tata[a]);
    return tata[a];
}
void unite(int a,int b)
{
    a=find(a);
    b=find(b);
    if(a==b)
        return;
    if(g[a]<g[b])
    {
        tata[a]=b;
        g[b]+=g[a];
    }
    else
    {
        tata[b]=a;
        g[a]+=g[b];
    }
}
int main()
{
    FILE * in=fopen("disjoint.in", "r");
    FILE * out=fopen("disjoint.out", "w");
    int n,m,i,cer,x,y;
    //cin>>n>>m;
    fscanf(in, "%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        tata[i]=i;
        g[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        //cin>>cer>>x>>y;
        fscanf(in,"%d%d%d",&cer,&x,&y);
        if(cer==1)
        {
            unite(x,y);
        }
        else
        {
            if(find(x)==find(y))
            {
                //cout<<"DA\n";
                fprintf(out, "DA\n");
            }
            else
                //cout<<"NU\n";
                fprintf(out,"Da\n");
        }
    }

    return 0;
}