dijkstra模板(fast)

对应题目Candies POJ - 3159,此题卡时间很紧,于是各种优化…
dijkstra+快读+链式前向星+最小堆

#include<map>
#include<set>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<iomanip>
#include<sstream>
#include<iostream>
#include<algorithm>
#define INF 0x3f3f3f3f
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define ll __int64
//#define int ll
//typedef  long long ll;
typedef unsigned long long ull;
const int MAXN=1e6+10;
const int MOD=1e9+7;
const double eps=1e-6;
const double finf=1e10;
using namespace std;
template<class T>inline void read(T &res)
{
    char c;T flag=1;
    while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
    while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}
//-------------------------------------------//
struct node
{
    int u,d;
    node(int v,int d):u(v),d(d){}
    bool operator<(const node&a)const
    {
        return d>a.d;
    }
};
struct edges
{
    int to,next,dis;
}E[MAXN*5];
int d[MAXN],vis[MAXN],head[MAXN];
int n,m;
void dijkstra(int s)
{
    priority_queue<node> q;
    d[s]=0;
    q.push(node(s,0));
    while(!q.empty())
    {
        node cur=q.top();q.pop();
        int u=cur.u;
        if(vis[u])continue;
        vis[u]=1;
        for(int i=head[u];~i;i=E[i].next)
        {
            edges& e=E[i];
            if(d[u]+e.dis<d[e.to])
            {
                d[e.to]=d[u]+e.dis;
                q.push(node(e.to,d[e.to]));
            }
        }
    }
}
void init()
{
   // E.clear();
    for(int i=0;i<=n;++i)
    {
        //g[i].clear();
        d[i]=INF;head[i]=-1;
        //vis[i]=0;
    }
}
int cnt;
void addedge(int u,int v,int d)
{
    E[cnt].dis=d;
    E[cnt].to=v;
    E[cnt].next=head[u];
    head[u]=cnt++;
}
int main()
{
    int x,t=1;
    while(t--)
    {
        read(n);read(m);
        init();
        int u,v,val;
        for(int i=1;i<=m;++i)
        {
            read(u);read(v);read(val);
            addedge(u,v,val);
        }
        dijkstra(1);
        printf("%d\n",d[n]);
    }
    return 0;
}