Cod sursa(job #460944)

Utilizator BitOneSAlexandru BitOne Data 4 iunie 2010 19:52:26
Problema Ciclu hamiltonian de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.33 kb
#include <cstdlib>
#include <fstream>
#define Nmax 19
#define Mmax 1<<Nmax
#define oo 999999

/*
 *
 */
using namespace std;
int d[Nmax], dd[Nmax];
int G[Nmax][Nmax], C[Nmax][Nmax], CC[Nmax][Mmax];
int main( void )
{
    int N, M, x, x2, y, y2, z, s, till;
    ifstream in( "hamilton.in" );
    ofstream out( "hamilton.out" );
    in>>N>>M;
    till=1<<N;
    for( x=0; x < N; ++x )
        for( y=0; y < till; ++y )
            if( y < N )
                C[x][y]=CC[x][y]=oo;
            else CC[x][y]=oo;
    for( ; M; --M )
    {
        in>>x>>y;
        in>>C[x][y];
        G[y][++G[y][0]]=x;
        ++d[x]; ++dd[y];
    }
    for( x=0; x < N; ++x )
        if( 0 == d[x]*dd[x] )
        {
                out<<"-1\n";
                return EXIT_SUCCESS;
        }
    CC[0][1]=0;
    for( x=0; x < till; ++x )
        for( y=0, y2=1; y < N; ++y, y2<<=1 )
           if( x & y2 )
            {
                x2=x^y2;
                for( z=1; z <= G[y][0]; ++z )
                    if( x & (1<<G[y][z]) )
                        CC[y][x]=min( CC[y][x], CC[G[y][z]][x2]+C[G[y][z]][y] );
            }
    till-=1;
    for( s=oo, x=1; x <= G[0][0]; ++x )
        s=min( s, CC[G[0][x]][till]+C[G[0][x]][0] );
    if( oo == s )
        out<<"-1\n";
    else out<<s<<'\n';
    return EXIT_SUCCESS;
}