Cod sursa(job #2496264)

Utilizator emadinuDinu Ema emadinu Data 20 noiembrie 2019 16:52:22
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>

using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int sefx,sefy,tata[100001];
int sef(int x)
{
    if(x==tata[x])return x;
    else tata[x]=sef(tata[x]);
}
void unire(int x,int y)
{
    sefx=sef(x);
    sefy=sef(y);
    tata[sef(x)]=sefy;
}

int main()
{
    int n,m,cod,x,y,i;
    in>>n>>m;
    for(i=1;i<=n;i++)tata[i]=i;
    for(i=1;i<=m;i++)
    {
        in>>cod>>x>>y;
        if(cod==1)
        {
            unire(x,y);
        }
        else if(cod==2)
        {
            if(sef(x)==sef(y))out<<"DA"<<'\n';
            else out<<"NU"<<'\n';
        }
    }
     //for(i=1;i<=n;i++)out<<tata[i]<<" ";
    return 0;
}