Cod sursa(job #1794070)

Utilizator stefan_creastaStefan Creasta stefan_creasta Data 31 octombrie 2016 21:08:27
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <cstdio>
#include <vector>
using namespace std;
const int N = 100005;
int v[N];
int f(int x)
{
    if(x == v[x])
    {
        return x;
    }
    return v[x] = f(v[x]);
}

int main()
{
    int n, m, i, x, y, cod, q;
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d", &n, &m);
    for(i = 1;i <= n; ++i)
    {
        v[i] = i;
    }
    for(q = 1;q <= m; ++q)
    {
        scanf("%d%d%d", &cod, &x, &y);
        if(cod == 1)
        {
            v[f(x)] = v[f(y)];
        }
        else
        {
            if(v[f(x)] == v[f(y)])
            {
                printf("DA\n");
            }
            else
            {
                printf("NU\n");
            }
        }
    }
    return 0;
}