HDU4725 The Shortest Path in Nya Graph（堆优化的dijkstra算法）

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int maxn=1e6+10;
const int inf=1e9;
int N,M,C;
struct node {
    int u;
    int v;
    int w;
    int next;
}edge[maxn];
int head[maxn];
int tol=0;
void addedge (int u,int v,int w) {
    edge[tol].u=u;
    edge[tol].v=v;
    edge[tol].w=w;
    edge[tol].next=head[u];
    head[u]=tol++;
}
int d[maxn];
int visit[maxn];
struct qnode {
    int v;
    int w;
    bool operator < (const qnode &r) const {
        return w>r.w;
    }
};
void dijkstra (int s) {
    memset(visit,0,sizeof(visit));
    for (int i=1;i<=N*3;i++) d[i]=inf;
    priority_queue<qnode> q;
    d[s]=0;
    q.push({s,0});
    qnode tmp;
    while (!q.empty()) {
        tmp=q.top();
        q.pop();
        int u=tmp.v;
        if (visit[u]) continue;
        visit[u]=1;
        for (int i=head[u];i!=-1;i=edge[i].next) {
            int v=edge[i].v;
            if (!visit[v]&&d[v]>d[u]+edge[i].w) {
                d[v]=d[u]+edge[i].w;
                q.push({v,d[v]});
            }
        }
    } 
}
int main () {
    int T;
    scanf("%d",&T);
    for (int k=1;k<=T;k++) {
        scanf("%d%d%d",&N,&M,&C);
        memset(head,-1,sizeof(head));
        tol=0;
        for (int i=1;i<=N;i++) {
            int x;
            scanf("%d",&x);
            addedge(i,N+2*x-1,0);
            addedge(N+2*x,i,0);
        }
        for (int i=1;i<N;i++) {
            addedge(N+2*i-1,N+2*(i+1),C);
            addedge(N+2*(i+1)-1,N+2*i,C);
        }
        while (M--) {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            addedge(u,v,w);
            addedge(v,u,w);
        }
        dijkstra(1);
        if (d[N]==inf) d[N]=-1;
        printf("Case #%d: %d\n",k,d[N]);
    }
    return 0;
}