Cod sursa(job #2090012)

Utilizator sydeff90Voicu Stefan sydeff90 Data 17 decembrie 2017 14:48:09
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <fstream>

using namespace std;

int t[100001];
ifstream in("disjoint.in");
ofstream out("disjoint.out");

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

void join(int x,int y)
{
    int rx=tata(x);
    t[rx]=y;
}

int main()
{
    int n,m,tip,x,y;
    in>>n>>m;
    for (int i=1;i<=n;i++)
        t[i]=i;
    for (int i=1;i<=m;i++)
    {
        in>>tip>>x>>y;
        if (tip==1)//reuniune
            join(x,y);
        else //intrebare
            if (tata(x)==tata(y))
                out<<"DA\n";
            else
                out<<"NU\n";
    }
    return 0;
}