Cod sursa(job #2065754)

Utilizator alexandruilieAlex Ilie alexandruilie Data 14 noiembrie 2017 09:53:27
Problema Ciclu hamiltonian de cost minim Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
#define inf 1e9
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
int c[263000][20],i,j,k,p,n,m,dim,cost[20][20],x,y,cst,mn;
int main()
{
    f>>n>>m;

    for(i=0;i<=n;i++)
        for(j=0;j<=n;j++)
        cost[i][j]=inf;
    for(i=1;i<=m;i++) {f>>x>>y>>cst;cost[x][y]=cst;}
    dim=(1<<n)-1;
    for(i=0;i<=dim;i++)
        for(j=0;j<n;j++) c[i][j]=inf;
    c[1][0]=0;
    for(i=0;i<=dim;i++)
        for(j=0;j<n;j++)
            if(i&(1<<j))
            for(p=0;p<n;p++)
            if(cost[p][j]!=inf)
            {
                if(c[i^(1<<j)][p]+cost[p][j]<c[i][j]) c[i][j]=c[i^(1<<j)][p]+cost[p][j];
            }
    mn=inf;
    for(i=1;i<n;i++)
        if(cost[i][0]!=inf&&mn>c[dim][i]+cost[i][0])
        mn=c[dim][i]+cost[i][0];
    if(mn!=inf)g<<mn;
    else g<<"Nu exista solutie";
    return 0;
}