45pts求调（邪修最短路）

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,dist[20],cnt[20],ans=4e18,sum,op[20],pw[2005];
bool vis[20],visp[2005];
struct node{
	int v,w,p;
};
vector<node> vct[20];
struct node2{
	int d,u;
};
bool operator<(node2 x,node2 y){
	return x.d>y.d;
}
priority_queue<node2> q;
void Dij(int s){
	while(q.size())q.pop();
	memset(dist,0x3f,sizeof dist);
	memset(cnt,0,sizeof cnt);
	memset(vis,0,sizeof vis);
	memset(visp,0,sizeof visp);
	memset(op,0,sizeof op);
	memset(pw,0,sizeof pw);
	dist[s]=0;
	vis[s]=1;
	q.push({0,s});
	while(q.size()){
		int u=q.top().u;
		q.pop();
		vis[u]=0;
		for(int i=0;i<vct[u].size();i++){
			int v=vct[u][i].v,w=vct[u][i].w,p=vct[u][i].p;
			if(dist[v]>dist[u]+w*(cnt[u]+1)){
				dist[v]=dist[u]+w*(cnt[u]+1);
				cnt[v]=cnt[u]+1;
				visp[op[v]]=0;
				visp[p]=1;
				op[v]=p;
				pw[p]=w*cnt[v];
				if(!vis[v]){
					vis[v]=1;
					q.push({dist[v],v});
				}
			}
		}
	}
	int sum2=0;
	for(int i=1;i<=sum;i++){
		if(visp[i])sum2+=pw[i];
	}
	ans=min(ans,sum2);
}
signed main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		vct[u].push_back({v,w,++sum});
		vct[v].push_back({u,w,++sum});
	}
	for(int i=1;i<=n;i++){
		Dij(i);
	}
	cout<<ans;
	return 0;
}