玄学存图+手打堆优化+dij不知为何错了。。。

#include<iostream>
#include<map>
using namespace std;
struct note
{
    long long size,go;
};
map<long long,note>a[200001];
long long the_max;
long long n,m,k,data[200001],x,y,z,mindata,minnum,num[200001],aa[200001],zx[100001],r;
bool jl[200001];

void newswap(long long &x,long long &y)
{
    long long t=x;
    x=y;
    y=t;
    t=zx[x];
    zx[x]=zx[y];
    zx[y]=t;
}

void wh(long long x)
{
    if (2*x<=r && (data[aa[2*x-1]]<data[aa[x]] || data[aa[2*x]]<data[aa[x]]))
    {
        if (data[aa[2*x-1]]<data[aa[2*x]])
        {
            newswap(aa[2*x-1],aa[x]);
            wh(2*x-1);
        }
        else 
        {
            newswap(aa[2*x],aa[x]);
            wh(2*x);
        }
    }
    else if (2*x-1<=r && (data[aa[2*x-1]]<data[aa[x]]))
    {
        newswap(aa[2*x-1],aa[x]);
        wh(2*x-1);
    }
    if (data[aa[(x+1)/2]]>data[aa[x]])
    {
        newswap(aa[(x+1)/2],aa[x]);
        wh((x+1)/2);
    }
}

void puts(long long x)
{
    aa[++r]=x;
    wh(r);
}

void del()
{
    aa[1]=aa[r];
    r--;
    wh(1);
}

int main()
{
    the_max=2305843009213693952;
    cin>>n>>m>>k;
    r=n;
    for (long long i=1;i<=n;i++) data[i]=the_max,aa[i]=i,zx[i]=i;
    data[k]=0;
    wh(k);
    for (long long i=1;i<=m;i++)
    {
        cin>>x>>y>>z;
        num[x]++;
        a[x][num[x]].size=z;
        a[x][num[x]].go=y;
    }
    for (long long i=1;i<=n;i++)
    {
    	k=aa[1];
    	del();
    	jl[k]=true;
        for (long long j=1;j<=num[k];j++) 
        if (!jl[a[k][j].go])
        if (data[a[k][j].go]>data[k]+a[k][j].size)
        {
            data[a[k][j].go]=data[k]+a[k][j].size;
            wh(zx[a[k][j].go]);
        }
    }
    for (long long i=1;i<=n;i++) cout<<data[i]<<' ';
    return 0;
}