luogu 3371 【模板】单源最短路径

我太菜了

今天才学会堆优化的dij

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<cmath>
 #include<cstdlib>
 #include<cstring>
 #include<queue>
 #include<vector>
 #define ll long long
 #define inf 2147483647
 #define MAXN 10101
 #define P pair<int,int>
 #define mp(a,b) make_pair(a,b)
 using namespace std;
 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(!isdigit(ch)) {if(ch=='-') f=-;ch=getchar();}
     while(isdigit(ch)) {x=(x<<)+(x<<)+ch-'';ch=getchar();}
     return x*f;
 }
 priority_queue <P,vector<P>,greater<P> > q;
 int n,m,s;
 int next[MAXN*],first[MAXN],to[MAXN*],val[MAXN*],dis[MAXN],cnt;
 void add(int u,int v,int w) {next[++cnt]=first[u],first[u]=cnt,val[cnt]=w,to[cnt]=v;}
 int main()
 {
     n=read(),m=read(),s=read();
     int a,b,c,k;
     for(int i=;i<=m;i++) {a=read(),b=read(),c=read();add(a,b,c);}
     for(int i=;i<=n;i++) dis[i]=inf;dis[s]=;
     q.push(mp(,s));
     while(!q.empty())
     {
         k=q.top().second;
         q.pop();
         for(int i=first[k];i;i=next[i])
             if(dis[to[i]]>dis[k]+val[i]) {dis[to[i]]=dis[k]+val[i];q.push(mp(dis[to[i]],to[i]));}
     }
     for(int i=;i<=n;i++)
         printf("%d ",dis[i]);
 }