HDU 1535 Invitation Cards

Dijkstra+优先队列+反向建图+邻接表

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>

const int maxn = 1000010;
const int inf = 0xffffff;

struct Edge{
    int u,v,w;
}e[maxn];

int d[maxn],first[maxn],next[maxn],ans=0,n,m;
bool vis[maxn];

using namespace std;

typedef pair<int,int> pii;

void init(){
    memset(vis,false,sizeof(vis));
    memset(first,-1,sizeof(first));
    for(int i=0;i<maxn;i++)
        d[i]=inf;
    d[1]=0;
}

void solve(){
    priority_queue<pii,vector<pii>,greater<pii> > q;
    q.push(make_pair(d[1],1));
    while(!q.empty()){
        pii k=q.top();
        q.pop();
        int x=k.second;
        if(vis[x])
            continue;
        vis[x]=true;
        for(int i=first[x];i!=-1;i=next[i])
            if(d[e[i].v]>d[x]+e[i].w){
                d[e[i].v]=d[x]+e[i].w;
                q.push(make_pair(d[e[i].v],e[i].v));
            }
    }
    for(int i=2;i<=n;i++)
        ans+=d[i];
}

int main()
{
    int t,i;
    scanf("%d",&t);
    while(t--){
        ans=0;
        init();
        scanf("%d%d",&n,&m);
        for(i=0;i<m;i++){
            scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w);
            next[i]=first[e[i].u];
            first[e[i].u]=i;
        }
        solve();
        init();
        for(i=0;i<m;i++){
            int tmp=e[i].u;
            e[i].u=e[i].v;
            e[i].v=tmp;
            next[i]=first[e[i].u];
            first[e[i].u]=i;
        }
        solve();
        printf("%d\n",ans);
    }
    return 0;
}