Cod sursa(job #1846205)

Utilizator Zydrax04Morar Rares Zydrax04 Data 12 ianuarie 2017 12:44:25
Problema Paduri de multimi disjuncte Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.99 kb
#include <fstream>
#include <vector>
using namespace std;

ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

int n, m, viz[1001], cod, x, y;

int TT[100010], h[100010];

void citire()
{
    fin >> n >> m;
    for(int i=1;i<=n;i++)
    {
        TT[i]=i;
        h[i]=0;
    }
}

int find(int z)
{
    int n;
    for(n=z; TT[n]!=n; n=TT[n]);
    return n;
}

int main()
{
    citire();
    while(m--)
    {
        fin >> cod >> x >> y;
        if(cod==1)
        {
            if(h[x]>h[y])
            {
                TT[y]=x;
            }
            if(h[x]<h[y])
            {
                TT[x] = y;
            }
            if(h[x] == h[y])
            {
                TT[x] = y;
                h[x]++;
            }
        }
        else if(cod==2)
        {
            if(find(x) == find(y))
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
    }
    return 0;
}