Cod sursa(job #2815871)

Utilizator AlexbilecaAlexandru Theodor Bileca Alexbileca Data 10 decembrie 2021 15:47:34
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include <fstream>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");

int tata[100001];
int sef(int x)
{
    if(sef(x)==x)
        return x;
    else
    {
        return tata[x]=sef(x);
    }
}
int unire(int x, int y)
{
    int s1=sef(x);
    int s2=sef(y);
    tata[y]=s1;
}
int main()
{
    int n , m , i , j , x , y , tip;
    cin>>n>>m;
    for(i=1;i<=n;i++)
        tata[i]=i;
    for(i=1;i<=m;i++)
    {
        cin>>tip>>x>>y;
        if(tip==2)
        {
            if(sef(x)==sef(y))
                cout<<"DA"<<"/n";
            else
                cout<<"NU"<<"/n";
        }
        if(tip==1)
        {
            unire(x,y);
        }
    }
    return 0;
}