dj+手打堆WA#1#3#4，求hack数据

如题。因为下载的测试的数据量过大，没办法手动模拟，找不到错误。。。

评测记录

代码如下：

#include<cstdio>
#define INF 0x3f3f3f3f
using namespace std;
int min(int a,int b){return a<b?a:b;}
int h[100003];//h[i]:the last out-edge of vertice i
struct tu_edge{
    int a,b,w,n;//st&ed and last out-edge of a
    void input(int i){
        scanf("%d%d%d",&a,&b,&w);
        n=h[a],h[a]=i;
    }
}edge[200003];
int dis[100003];//distance of each vertice to s
int pos[100003];//position in f_queue of each vertice
struct f_queue{
    private:
        int tail,tree[100003];
        void _upper(int x){
            int temp=tree[x];
            pos[tree[x/2]]=x,tree[x]=tree[x/2];
            pos[tree[x]]=x/2,tree[x/2]=temp;
        }
        void _update(int x){
            if(dis[tree[x]]<dis[tree[x/2]]) _upper(x),_update(x/2);
            else{
                if(x*2 >tail) return;
                int temp=x*2;
                if(temp<tail) if(dis[tree[temp]]>dis[tree[temp+1]]) ++temp;
                if(dis[tree[temp]]<dis[tree[x]]) _upper(temp),_update(temp);
            } 
        }
    public:
        void push(int a){
            tree[++tail]=a,pos[a]=tail;
            _update(tail);
        }
        void redate(int a){
            _update(pos[a]);
        }
        int pop(){
            int temp=tree[1];
            pos[tree[1]]=0 ,pos[tree[tail]]=1;
                tree[1] =       tree[tail--];
            _update(1);
            return temp;
        }
        bool empty(){
            return !tail;
        }
}que;
int n,m,s;
int main(){
    //input&pre
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1;i<=n;++i) dis[i]=INF;
    dis[s]=0,que.push(s);
    for(int i=1;i<=m;++i) edge[i].input(i);
    //dj
    while(!que.empty()){
        int temp=que.pop(),tmp;//new blue vertice
//      printf("%d:\n",temp);
        for(int i=h[temp];i;i=edge[i].n){
            tmp=edge[i].b;
            if (dis[tmp]>dis[temp]+edge[i].w) 
                dis[tmp]=dis[temp]+edge[i].w,//printf(" +%d=%d->%d:%d->%d\n",i,edge[i].w,tmp,dis[temp],dis[tmp]),
                pos[tmp]?que.redate(tmp):que.push(tmp);
        }
    }
    for(int i=1;i<=n;++i) printf("%d ",dis[i]);
    return 0;
} 

码风略史，还请见谅（）