堆优化的dijkstra

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+2;
ll n,h[N],tot,S,m;
struct node{
   ll v,c,ne;    
}e[N*8];
void add(ll u,ll v,ll c)
{
    tot++;e[tot]=(node){v,c,h[u]};h[u]=tot;
}
struct OK{
    ll x,d;
    friend bool operator <(OK A,OK B)
    {
        return A.d>B.d;
    }
}ff,rr;
priority_queue<OK>q;
bool v[N];
ll d1[N];
void dij()
{
   for(ll i=1;i<=n;++i) d1[i]=2147483647,v[i]=0;
   d1[S]=0;q.push((OK){S,0});
   while(!q.empty())
   {
       ff=q.top();q.pop();
       if(v[ff.x]) continue;
       v[ff.x]=1;
       for(ll i=h[ff.x];i;i=e[i].ne)
       {
             if(d1[e[i].v]>d1[ff.x]+e[i].c)
          {
               d1[e[i].v]=d1[ff.x]+e[i].c;
               q.push((OK){e[i].v,d1[e[i].v]});
          } 
       }
   }
}
int main()
{
    scanf("%lld%lld%lld",&n,&m,&S);
    for(ll i=1,x,y,z;i<=m;++i)
    {
        scanf("%lld%lld%lld",&x,&y,&z);
        add(x,y,z);//add(y,x,z);
    }
    dij();
    for(ll i=1;i<=n;++i) cout<<d1[i]<<" ";
    return 0; 
} 

粪虫至秽，变为蝉而饮露于秋风。

鬼话，不如多喝几口毒鸡汤，效果杠杠的