P1629 邮递员送信

https://www.luogu.org/problem/P1629

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
#define INF (1<<30)-1
#define maxn 200010
#include<queue>
using namespace std;
inline int read()
{    
     int x=0; char ch=getchar();
     while (ch<'0' || ch>'9') ch=getchar();
     while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
     return x;
}   
struct HeapNode
{
    int d,u;
    bool operator<(const HeapNode & rhs) const
    {
        return d>rhs.d;
    }
};
struct node
{
    int to,next,v;
}edge[1000000+10],fedge[1000010];
int cnt,head[maxn],fhead[maxn];
inline void add(int x,int y,int v)
{
    edge[++cnt].to=y;
    edge[cnt].v=v;
    edge[cnt].next=head[x];
    head[x]=cnt;
    fedge[cnt].to=x;
    fedge[cnt].v=v;
    fedge[cnt].next=fhead[y];
    fhead[y]=cnt;
}
int dis[maxn],n,m,ans;
bool exist[maxn];
int fdis[maxn];
bool fexist[maxn];
inline void Dijkstra()
{
    priority_queue<HeapNode> Q;
    for (int i=1;i<=n;i++) dis[i]=INF;
    dis[1]=0;
    memset(exist,0,sizeof(exist));
    Q.push((HeapNode){0,1});
    while (!Q.empty())
    {
        HeapNode x=Q.top();Q.pop();
        int u=x.u;
        if (exist[u]) continue;
        exist[u]=true;
        for (int i=head[u];i;i=edge[i].next)
        {
            int temp=edge[i].to;
            if (dis[temp]>dis[u]+edge[i].v)
            {
                dis[temp]=dis[u]+edge[i].v;
                Q.push((HeapNode){dis[temp],temp});
            }
        }
    }
}
inline void FDijkstra()
{
    priority_queue<HeapNode> Q;
    for (int i=1;i<=n;i++) fdis[i]=INF;
    fdis[1]=0;
    memset(fexist,0,sizeof(fexist));
    Q.push((HeapNode){0,1});
    while (!Q.empty())
    {
        HeapNode x=Q.top();Q.pop();
        int u=x.u;
        if (fexist[u]) continue;
        fexist[u]=true;
        for (int i=fhead[u];i;i=fedge[i].next)
        {
            int temp=fedge[i].to;
            if (fdis[temp]>fdis[u]+fedge[i].v)
            {
                fdis[temp]=fdis[u]+fedge[i].v;
                Q.push((HeapNode){fdis[temp],temp});
            }
        }
    }
}
int main(){
    int x,y,v;
    n=read();m=read();
    for (int i=1;i<=m;i++){
        x=read(),y=read(),v=read();
        add(x,y,v);
    }
    Dijkstra();FDijkstra();
    for (int i=2;i<=n;i++)
        ans=ans+dis[i]+fdis[i];
    printf("%d\n",ans);
}