Cod sursa(job #1831067)

Utilizator MarcSpataruMarc Spataru MarcSpataru Data 17 decembrie 2016 13:55:19
Problema Paduri de multimi disjuncte Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include<cstdio>
#include<ctime>
#include<cstdlib>
using namespace std;
struct uf
{
    int cod,x,y;
};
uf v[100001];
int dad[100001];
int find(int e)
{
    if(e==dad[e])
        return e;
    else
        find(dad[e]);
    return dad[e];
}
void unionn(int e1,int e2)
{
    int a,b;
    a=find(e1);
    b=find(e2);
    if(a!=b)
        if(rand()%2==0)
            dad[a]=b;
        else
            dad[b]=a;
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m,cod,x,y,i;
    srand(time(0));
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&v[i].cod,&v[i].x,&v[i].y);
    }
    for(i=1;i<=n;i++)
        dad[i]=i;
    for(i=1;i<=m;i++)
    {
        if(v[i].cod==1)
            unionn(v[i].x,v[i].y);
        if(v[i].cod==2)
        {
            if(find(v[i].x)==find(v[i].y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}