Cod sursa(job #460158)

Utilizator BitOneSAlexandru BitOne Data 1 iunie 2010 14:23:36
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <cstdlib>
#include <fstream>
#define Nmax 100111

/*
 *
 */
using namespace std;
int f[Nmax], r[Nmax];
inline int find( int x )
{
    int y, z;
    for( y=x; y != f[y]; y=f[y] );
    while( x != f[x] )
    {
        z=f[x];
        f[x]=y;
        x=z;
    }
    return y;
}
inline void unite( int x, int y )
{
    if( r[x] == r[y] )
    {
        if( x != y )
            f[y]=x;
        ++r[y];
    }
    else r[x]=r[y]=( r[x] <= r[y] ? r[x] : r[y] );
}
int main( void )
{
    int N, M, op, x, y;
    ifstream in( "disjoint.in" );
    in>>N>>M;
    for( x=1; x <= N; ++x )
        f[x]=x, r[x]=1;
    ofstream out( "disjoint.out" );
    for( ; M; --M )
    {
        in>>op>>x>>y;
        switch( op )
        {
            case 1 : unite( find(x), find(y) ); break;
            case 2 : out<<( find(x) == find(y) ? "DA" : "NU" )<<'\n';
        }
    }
    return EXIT_SUCCESS;
}