Cod sursa(job #1345807)

Utilizator SagunistuStrimbu Alexandru Sagunistu Data 17 februarie 2015 21:23:14
Problema Paduri de multimi disjuncte Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>
#define nmax 100005

using namespace std;

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

int t[nmax],n,m,r[nmax];

void uneste(int x,int y)
{
    if(r[x]>r[y])
        t[y]=x;
    else
        t[x]=y;
    if(r[x]==r[y])
        r[x]++;
}

int tata(int x)
{
    if(t[x]==x)
        return x;
    t[x]=tata(t[x]);
    return t[x];
}

int main()
{
    fin>>n>>m;
    int cod,x,y;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        r[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;
        if(cod==1)
            uneste(x,y);
        else
            if(tata(x)==tata(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
    }
    return 0;
}