Cod sursa(job #1806435)

Utilizator RaduMirceaAndreiRadu Mircea Andrei RaduMirceaAndrei Data 15 noiembrie 2016 12:33:50
Problema Ciclu hamiltonian de cost minim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
# include <fstream>
# define N 19
# define DIM 1<<18
# define INF 2000000000
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
int v[N][N],d[DIM][N],re[DIM],n,m,x,y,cost,i,j,t,r,q,b1,b2,sol;
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        v[x][y]=cost;
    }
    for(i=1,j=0;i*2<DIM;i*=2,j++)
        re[i]=j;
    for(i=1;i<(1<<n);i++)
        for(j=0;j<n;j++)
            d[i][j]=INF;
    d[1][0]=0;
    for(i=1;i<(1<<n);i++){
        r=i;
        q=(((1<<n)-1)^r);
        for(j=r;j>=1;j-=(j&(-j))){
            b1=(j&(-j));
            for(t=q;t>=1;t-=(t&(-t))){
                b2=(t&(-t));
                if(v[re[b1]][re[b2]])
                    d[i+b2][re[b2]]=min(d[i+b2][re[b2]],d[i][re[b1]]+v[re[b1]][re[b2]]);
            }
        }
    }
    sol=INF;
    for(i=1;i<n;i++)
        if(v[i][0])
            sol=min(sol,d[(1<<n)-1][i]+v[i][0]);
    if(sol!=INF)
        fout<<sol<<"\n";
    else
        fout<<"Nu exista solutie\n";
    return 0;
}