Cod sursa(job #2480987)

Utilizator M3nTh0LLPlosceac Alexandre-Joaquim M3nTh0LL Data 26 octombrie 2019 12:31:25
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int x,y,z,t[200100],i,n,m,cod;
int gasire(int x)
{
    if (x==t[x]) return x;
    t[x]=gasire(t[x]);
    return t[x];
}
void uniune(int x,int y)
{
    x=gasire(x);
    y=gasire(y);
    if (x==y) return;
    t[x]=gasire(y);
}

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