Dijkstra算法模版

好吧，最近这几天发现SPFA老是被卡，于是就打了dij，挺好打的，也不长。

CODE

#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstring>
#define fo(i,a,b)for (int (i)=(a);(i)<=(b);(i)++)
using namespace std;
const int N=100000+55;
const int M=200000;
#include<cstdio>
#include<queue>
using namespace std;
struct node
{
    int x,y;
    bool operator < (const node & a) const
    {
        return x>a.x;
    }
}k;
priority_queue <node> q;
int head[N],to[M],next[M],w[M],tot=1,dis[N];
bool vis[N];
void R(int &x)
{
    int f=1;x=0;char s=getchar();
    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
    while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}
    x*=f;
}
void add(int x,int y,int z)
{
    to[++tot]=y;
    next[tot]=head[x];
    w[tot]=z;
    head[x]=tot;
}
void dij(int s)
{
    for (int i=0;i<N;i++)dis[i]=2147483647;
    dis[s]=0;
    q.push((node){0,s});
    int x,v;
    while (q.size()){
        x=q.top().y;q.pop();
        if (vis[x]) continue;
        vis[x]=1;
        for(int i=head[x];i;i=next[i]){
            v=to[i];
            if (dis[v]>dis[x]+w[i]){
                dis[v]=dis[x]+w[i];
                q.push((node){dis[v],v});
            }
        }
    }
}
int main(){
    int n,m,x,y,z,s;
    R(n);R(m);R(s);
    fo(i,1,m){
        R(x);R(y);R(z);
        add(x,y,z);
    }
    dij(s);
    fo(i,1,n)
        printf("%d ",dis[i]);
}