状压DP95求找错

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,dis[1<<15][15],f[1<<15];
int l[15][15];
int main()
{
	//freopen("a.in","r",stdin);
	scanf("%d%d",&n,&m);
	memset(l,0x7f,sizeof(l));
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		l[x][y]=l[y][x]=min(l[x][y],z);
	}
	memset(f,0x3f,sizeof(f));
	for(int i=1;i<=n;i++)
	if((1<<(i-1))>=(1<<n))break;
	else f[1<<(i-1)]=0,dis[1<<(i-1)][i]=1;
	for(int i=1;i<(1<<n);i++)
	for(int j=1;j<=n;j++)
	if(!(i&(1<<(j-1))))
	for(int k=1;k<=n;k++)
	if(i&(1<<(k-1)))
	if(l[j][k]!=2139062143)
	{
		if(f[i|(1<<(j-1))]>f[i]+l[j][k]*(dis[i][k]))
		{
			f[i|(1<<(j-1))]=f[i]+l[j][k]*(dis[i][k]);
			for(int now=1;now<=n;now++)
			if(i&(1<<(now-1)))
			dis[i|(1<<(j-1))][now]=dis[i][now];
			dis[i|(1<<(j-1))][j]=dis[i][k]+1;
		}
	}
	printf("%d",f[(1<<n)-1]);
}