Pagini recente » Cod sursa (job #1196888) | Cod sursa (job #389579) | Cod sursa (job #2937003) | Cod sursa (job #255275) | Cod sursa (job #2306602)
#include<cstdio>
int i,j,d,k,v,n,m,a,b,r,p,t,c[262145][19],w[19][19],u[19];
int main()
{
freopen("hamilton.in","r",stdin),freopen("hamilton.out","w",stdout),scanf("%d%d",&n,&m);
while(m--)
scanf("%d%d%d",&a,&b,&d),w[a][b]=d;
for(j=0;j<(1<<n);j++)
{
for(i=0;i<n;i++)
c[j][i]=(j!=(1<<i))?(1<<30):0;
for(i=t=0,k=j;k;k>>=1,i++)
if(k&1)
u[t++]=i;
for(r=0;r<t;r++)
if(u[r])
{
for(v=1<<30,p=0;p<t;p++)
if(w[u[p]][u[r]]&&v>w[u[p]][u[r]]+c[j^(1<<u[r])][u[p]])
v=w[u[p]][u[r]]+c[j^(1<<u[r])][u[p]];
c[j][u[r]]=v;
}
}
for(v=1<<30,j=0;j<n;j++)
if(w[j][0]&&v>c[(1<<n)-1][j]+w[j][0])
v=c[(1<<n)-1][j]+w[j][0];
v==1<<30?printf("Nu exista solutie"):printf("%d",v);
}