数据过水？

#include <bits/stdc++.h>
using namespace std;
struct node{int x,y,z,w;}a[20];
int n;
double dp[1<<19][20],ans=1e9;
double distance(int x,int y,int z,int xx,int yy,int zz){return sqrt((x-xx)*(x-xx)+(y-yy)*(y-yy)+(z-zz)*(z-zz));}
int main(){
	cin>>n;
	for(int i = 0;i<n;i++) cin>>a[i].x>>a[i].y>>a[i].z>>a[i].w;
	for(int i = 0;i<1<<n;i++) for(int j = 0;j<n;j++) dp[i][j]=1e9;
	for(int i = 0;i<n;i++) dp[1<<i][i]=0;
	for(int i = 1;i<1<<n;i++){
		for(int j = 0;j<n;j++){
			if(i&(1<<j)==0) continue;
			for(int k = 0;k<n;k++){
				if(i&(1<<k)==0||j==k) continue;
				dp[i][j]=min(dp[i][j],dp[i^(1<<j)][k]+distance(a[j].x,a[j].y,a[j].z,a[k].x,a[k].y,a[k].z)*a[j].w);
			}
		}
	}
	for(int i = 0;i<n;i++) ans=min(ans,dp[(1<<n)-1][i]);
	printf("%.2f",ans);
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
struct node{int x,y,z,w;}a[20];
int n;
double dp[1<<19][20],ans=1e9;
double distance(int x,int y,int z,int xx,int yy,int zz){return sqrt((x-xx)*(x-xx)+(y-yy)*(y-yy)+(z-zz)*(z-zz));}
int main(){
	cin>>n;
	for(int i = 0;i<n;i++) cin>>a[i].x>>a[i].y>>a[i].z>>a[i].w;
	for(int i = 0;i<1<<n;i++) for(int j = 0;j<n;j++) dp[i][j]=1e9;
	for(int i = 0;i<n;i++) dp[1<<i][i]=0;
	for(int i = 1;i<1<<n;i++){
		for(int j = 0;j<n;j++){
			if(i&(1<<j)==0) continue;
			for(int k = 0;k<n;k++){
				if(i&(1<<k)==0||j==k) continue;
				dp[i][j]=min(dp[i][j],dp[i^(1<<j)][k]+distance(a[j].x,a[j].y,a[j].z,a[k].x,a[k].y,a[k].z)*a[k].w);//唯一的不同点在a[k].w和a[j].w上
			}
		}
	}
	for(int i = 0;i<n;i++) ans=min(ans,dp[(1<<n)-1][i]);
	printf("%.2f",ans);
	return 0;
}