Cod sursa(job #2089304)

Utilizator nicolleeeStanica Nicole nicolleee Data 16 decembrie 2017 12:32:48
Problema Paduri de multimi disjuncte Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int t[100001],x,y;

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

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

int main()
{
    int n,m,op;

    f>>n>>m;

    for(int i=1;i<=n;i++)
        t[i]=i;

    for(int i=1;i<=m;i++)
    {
        f>>op>>x>>y;
        if(op==1) join(x,y);
        if(op==2)
          {

           if(tata(x)==tata(y))
                 g<<"DA"<<endl;
            else g<<"NU"<<endl;
            }
    }

    f.close();
    g.close();

    return 0;
}