http://acm.hnu.cn/online/?action=problem&type=show&id=13375&courseid=0
求从起点到终点的最短距离的所有路径的权值和
通过SPFA求出最短距离并记录所有路径 然后求和
#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#include <vector>
#include <queue>
#define MEM(a,x) memset(a,x,sizeof a)
#define eps 1e-8
#define MOD 10009
#define MAXN 10010
#define MAXM 100010
#define INF 99999999
#define ll __int64
#define bug cout<<"here"<<endl
#define fread freopen("ceshi.txt","r",stdin)
#define fwrite freopen("out.txt","w",stdout)
using namespace std;
struct Edge
{
int v;
int cost;
Edge(int _v,int _cost):v(_v),cost(_cost){}
};
vector<Edge> E[MAXN];
void addedge(int u,int v,int w)
{
E[u].push_back(Edge(v,w));
}
bool vis[MAXN];
int dis[MAXN];
vector<int> ans[MAXN];
vector<int> path[MAXN];
int n,m;
void SPFA(int s)
{
MEM(vis,0);
for(int i=0;i<n;i++) dis[i]=INF;
vis[s]=1;
dis[s]=0;
queue<int> que;
while(!que.empty()) que.pop();
que.push(s);
while(!que.empty())
{
int u=que.front();
que.pop();
vis[u]=0;
for(int i=0;i<E[u].size();i++)
{
int v=E[u][i].v;
if(dis[v]>dis[u]+E[u][i].cost)
{
dis[v]=dis[u]+E[u][i].cost;
if(!vis[v])
{
vis[v]=1;
que.push(v);
}
ans[v].clear();
ans[v].push_back(u);
path[v].clear();
path[v].push_back(i);
}
else if(dis[v]==dis[u]+E[u][i].cost)
{
ans[v].push_back(u);
path[v].push_back(i);
}
}
}
}
int res;
int vi[MAXN];
void dfs(int v)
{
if(vi[v]) return;
vi[v]=1;
for(int i=0;i<ans[v].size();i++)
{
int u=ans[v][i];
int x=path[v][i];
// cout<<"uu "<<u<<" xx "<<x<<endl;
res+=E[u][x].cost;
dfs(u);
}
}
int main()
{
// fread;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=0;i<n;i++)
{
ans[i].clear();
E[i].clear();
path[i].clear();
}
while(m--)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
addedge(u,v,w);
addedge(v,u,w);
}
SPFA(0);
res=0;
MEM(vi,0);
dfs(n-1);
printf("%d\n",res*2);
}
return 0;
}