Cod sursa(job #898745)

Utilizator Eugen01Vasilescu Eugen Eugen01 Data 28 februarie 2013 11:32:17
Problema Ciclu hamiltonian de cost minim Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include<fstream>
#include<cstring>
#include<vector>
#define Nmax 18
#define pb push_back
#define inf 0x3f3f3f3f

using namespace std;

ifstream in("hamilton.in");
ofstream out("hamilton.out");

int sol=inf,i,j,k,n,m,x,y,c,D[Nmax][1<<Nmax],C[Nmax][Nmax];
vector<int> a[Nmax];

int main()
{
    in>>n>>m;
    for (i=1;i<=m;i++)
    {
        in>>x>>y>>c;
        a[y].pb(x);
        C[x][y]=c;
    }

    memset(D,inf,sizeof(D));
    D[0][1]=0;

    for (int i=1;i<(1<<n);++i)
        for (int j=0;j<n;++j)
            if (i & (1<<j))
                for (int k=0;k<a[j].size();++k)
                    if (i & (1<<a[j][k]))
                        D[j][i] = min(D[j][i], D[a[j][k]][i^(1<<j)]+C[a[j][k]][j]);

    for (i=1;i<n;i++)
        if (C[i][0]) sol=min(sol,D[i][(1<<n)-1]+C[i][0]);
    if (sol!=inf) out<<sol;
        else out<<"Nu exista solutie";
}