B - Flowery Trails UVALive - 6885 spfa

题意：求最短路上的边权之和并*2

题解：枚举边

天哪，赛时我怎么没想出来，气死了

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int max_m = 250000+10;
const int max_n = 10000+10;
int P,T;
inline int read(){
    int x = 0,f = 1;
    char ch = getchar();
    while(ch<'0'||ch>'9'){if(ch == '-')f=-1;ch = getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch = getchar();}
    return x*f;
}
struct node{
    int to,w,next;
}edge[max_m<<2];
struct EDGE{
    int u,v,w;
}Path[max_m];
int head[max_n],dist[max_n],dist1[max_n],vist[max_n],cnt;
inline void ADD(int u,int v,int w){
    edge[cnt].to = v;
    edge[cnt].w = w;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}
void spfa(){
    for(int i = 0; i < P; i++){
        dist[i] = INF;
        vist[i] = 0;
    }
    dist[0] = 0;
    deque<int>Q;
    Q.push_back(0);
    while(!Q.empty()){
        int u = Q.front();
        Q.pop_front();
        vist[u] = 0;
        for(int i = head[u]; ~i; i = edge[i].next){
            int v = edge[i].to;
            if(dist[v] > dist[u]+edge[i].w){
                dist[v] = dist[u]+edge[i].w;
                if(!vist[v]){
                    vist[v] = 1;
                    if(!Q.empty() && dist[v]<dist[Q.front()])
                        Q.push_front(v);
                    else
                        Q.push_back(v);
                }
            }
        }
    }

    for(int i = 0; i < P; i++){
        dist1[i] = INF;
        vist[i] = 0;
    }
    dist1[P-1] = 0;
    Q.push_back(P-1);
    while(!Q.empty()){
        int u = Q.front();
        Q.pop_front();
        vist[u] = 0;
        for(int i = head[u]; ~i; i = edge[i].next){
            int v = edge[i].to;
            if(dist1[v] > dist1[u]+edge[i].w){
                dist1[v] = dist1[u]+edge[i].w;
                if(!vist[v]){
                    vist[v] = 1;
                    if(!Q.empty() && dist1[v]<dist1[Q.front()])
                        Q.push_front(v);
                    else
                        Q.push_back(v);
                }
            }
        }
    }
    int ans = 0;
    for(int i = 0; i < T; i++){
        if(dist[P-1] == dist[Path[i].u]+dist1[Path[i].v]+Path[i].w)
            ans += Path[i].w*2;
        else if(dist[P-1] == dist1[Path[i].u]+dist[Path[i].v]+Path[i].w)
            ans += Path[i].w*2;
    }
    printf("%d\n",ans);
}
int main(){
    while(~scanf("%d %d",&P,&T)){
        cnt = 0;
        memset(head,-1,sizeof(head));
        int u,v,w;
        for(int i = 0; i < T; i++){
            u = read();v = read();w = read();
            Path[i].u = u;
            Path[i].v = v;
            Path[i].w = w;
            ADD(u,v,w);
            ADD(v,u,w);
        }
        spfa();
    }
    return 0;
}