Cod sursa(job #1416174)

Utilizator AndreiITCuriman Andrei AndreiIT Data 7 aprilie 2015 15:26:21
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, tata[100001];
int find_tata(int x)
{
    if(tata[x]==x)
        return x;
    int t=find_tata(tata[x]);
    tata[x]=t;
    return t;
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; ++i)
        tata[i]=i;
    for(int mi=1; mi<=m; ++mi)
    {
        int t, x, y;
        fin>>t>>x>>y;
        int tx, ty;
        tx=find_tata(x);
        ty=find_tata(y);
        if(t==1)
            tata[tx]=ty;
        else
        {
            if(tata[x]==tata[y])
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}