T最后两点

#include <iostream>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
int n,m,dis[1001],ans;
bool vis[1001];
struct node{
	int nx,w;
};
struct nodeforq{
	int d,a;
	bool operator > (const nodeforq& o) const { return d > o.d; }
};
vector<node> v[1001];
int dijk(int a,int b)//求a到b的最短路
{
	memset(dis,0x3f,sizeof(dis));
	memset(vis,0,sizeof(vis));
	priority_queue<nodeforq,vector<nodeforq>,greater<nodeforq> > q;
	dis[a]=0;vis[a]=0;
	q.push({0,a});
	while(!q.empty())
	{
		int t1=q.top().a,t2=q.top().d;
		q.pop();
		if(vis[t1]==1)continue;
		else vis[t1]=1;
		for(int i=0;i<v[t1].size();i++)
		{
			int j=v[t1][i].nx;
			if(!vis[j]&&(dis[j]>dis[t1]+v[t1][i].w))
			{
				dis[j]=dis[t1]+v[t1][i].w;
				q.push({dis[j],j});
			}
		}
	}
	return dis[b];
} 
int main()
{
	cin>>n>>m;
	int a,b,w;
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&a,&b,&w);
		v[a].push_back({b,w});
	}
	for(int i=2;i<=n;i++)
	{
		ans+=dijk(1,i);
		ans+=dijk(i,1); 
	}
	cout<<ans;
	return 0;
}

轻喷

谢邀~