Dijkstra

存一下模板，指不定哪天手抖就删了

#include<iostream>
#include<cstdio>
#include<queue>
#include<string>
#include<cstring>
#define maxn 100005
#define maxm 1000005
using namespace std;
int head[maxn],ver[maxm],edge[maxm],ne[maxm],d[maxn];
bool v[maxn];
int n,m,tot,s;
int x,y,z;
priority_queue< pair<int,int> >q;
void add(int x,int y,int z)
{
    ver[++tot]=y;edge[tot]=z;ne[tot]=head[x];head[x]=tot;
}
void dij()
{
    memset(d,0x3f,sizeof(d));
    memset(v,0,sizeof(v));
    d[s]=0;
    q.push(make_pair(0,s));
    while(q.size()){
        int x=q.top().second;q.pop();
        if(v[x])continue;
        v[x]=1;
        for(int i=head[x];i;i=ne[i]){
            int y=ver[i],z=edge[i];
            if(d[y]>d[x]+z){
                d[y]=d[x]+z;
                q.push(make_pair(-d[y],y));
            }
        }
    }
}
int main()
{
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        add(x,y,z);
    }
    dij();
    for(int i=1;i<=n;i++)
        printf("%d ",d[i]);
}