Cod sursa(job #1394351)

Utilizator eneandradaEne Oana-Andrada eneandrada Data 20 martie 2015 11:33:24
Problema Paduri de multimi disjuncte Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int N,M,x,y,i,cod,t[100005];


int find_comp(int x)
{
    if(x!=t[x])
        return (t[x]=find_comp(t[x]));
    else
        return x;
}

void unite(int x, int y)
{
    int tx=find_comp(x);
    int ty=find_comp(y);
    int r=rand()%2;
    if(r==0)
        t[tx]=ty;
        else
            t[ty]=tx;
}

void test(int x, int y)
{
    if(find_comp(x)==find_comp(y))
        g<<"DA"<<endl;
    else
        g<<"NU"<<endl;
}


int main()
{
    srand(time(NULL));
    f>>N>>M;
    for(i=1;i<=N;i++)
        t[i]=i;
    for(i=1;i<=M;i++)
    {
        f>>cod>>x>>y;
        if(cod==1)
            unite(x,y);
        else
            test(x,y);
    }
}