分析:就是暴力- -
因为是有向图,所以要存一个反转的边集合
#include <cstring>
#include <cstdio>
#include <queue>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0xFFFFFFFF
#define maxn 1000000+5
struct node
{
int nxt,dec,len;
};
node E[2][maxn];
int vis[maxn];
int head[2][maxn];
long long int d[maxn];
int n , m ;
void spfa(int x)
{
memset(vis,0,sizeof(vis));
for(int i = 0 ; i <= n ; ++i){
d[i] = INF;
}
queue<int>Q;
Q.push(1);
vis[1] = 1;
d[1] = 0;
while( !Q.empty() )
{
int u = Q.front();
Q.pop();
vis[u] = 0;
for(int i = head[x][u] ; ~i ; i = E[x][i].nxt){
int v = E[x][i].dec;
if( d[v] > d[u] + E[x][i].len )
{
d[v] = d[u] + E[x][i].len;
if(!vis[v])
{
vis[v] = 1;
Q.push(v);
}
}
}
}
}
void init()
{
for(int i=0;i<=n;i++){
head[0][i]=-1;
head[1][i]=-1;
}
}
int main()
{
int T;
cin >> T;
while(T--)
{
cin >> n >> m;
init();
for(int i = 1 ; i <= m ; ++i)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
E[0][i].dec = b;
E[0][i].len = c;
E[0][i].nxt = head[0][a];
head[0][a] = i;
E[1][i].dec = a;
E[1][i].len = c;
E[1][i].nxt = head[1][b];
head[1][b] = i;
}
spfa(0);
long long int ans = 0;
for(int i = 1 ; i <= n ; ++i){
ans += d[i];
// printf("%d ",d[i]);
}
spfa(1);
for(int i = 1 ; i <= n ; ++i){
ans += d[i];
// printf("%d ",d[i]);
}
cout << ans << endl;
}
}