Cod sursa(job #729620)

Utilizator ZexonAvramita Teodor Zexon Data 29 martie 2012 19:26:48
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <string>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int m,n;
int t[100000];

int sefu(int x)
{
    if(t[x]==0)
        return x;
    int s= sefu(t[x]);
    t[x] =s;
    return s;
}

int main()
{
    string tmp;
    in>>tmp;
    n = atoi(tmp.c_str());
    in>>tmp;
    m = atoi(tmp.c_str());

    int x,y;
    for(int i=1;i<=m;i++)
    {
    in>>tmp;
    if(atoi(tmp.c_str())==1)
        {in>>tmp;
        x = atoi(tmp.c_str());
        in>>tmp;
        y = atoi(tmp.c_str());
        t[sefu(x)]=sefu(x);}
    else
        {in>>tmp;
        x = atoi(tmp.c_str());
        in>>tmp;
        y = atoi(tmp.c_str());
        if((sefu(x)==sefu(y))&&(sefu(x)!=0))
        out<<true<<endl;
        else out<<false<<endl;}

    }
    return 0;
}