HDU 2145wa

还是WA了，这个究竟是为神魔？

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#define INF 1e9
using namespace std;
const int maxn = 300+10;

struct Edge
{
    int from,to,dist;
    Edge(int f,int t,int d):from(f),to(t),dist(d){}
};

struct BellmanFord
{
    int n,m;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool inq[maxn];
    int d[maxn];

    void init(int n)
    {
        this->n = n;
        for(int i=1;i<=n;i++) G[i].clear();
        edges.clear();
    }

    void AddEdge(int from,int to,int dist)
    {
        edges.push_back(Edge(from,to,dist));
        m = edges.size();
        G[from].push_back(m-1);
    }

    void spfa(int s)
    {
        memset(inq,0,sizeof(inq));
        queue<int> Q;
        for(int i=1;i<=n;i++) d[i]= i==s?0:INF;
        Q.push(s);

        while(!Q.empty())
        {
            int u=Q.front(); Q.pop();
            inq[u]=false;
            for(int i=0;i<G[u].size();i++)
            {
                Edge &e=edges[G[u][i]];
                if(d[e.to] > d[u]+e.dist)
                {
                    d[e.to] = d[u]+e.dist;
                    if(!inq[e.to])
                    {
                        inq[e.to]=true;
                        Q.push(e.to);
                    }
                }
            }
        }
    }
}BF;


int n,m,k;

int main()
{
    scanf("%d%d%d",&n,&m,&k);
    BF.init(n);
    while(k--){
        int u,v,cost;
        scanf("%d%d%d",&u,&v,&cost);
        //BF.AddEdge(n,m,cost);
        BF.AddEdge(v,u,cost);
    }
    int st;
    scanf("%d",&st);
    int ed[maxn],speed[maxn];
    for(int i=1;i<=m;i++){
        int tmp;
        scanf("%d",&tmp);
        ed[i]=tmp;
    }
    for(int i=1;i<=m;i++){
        int tmp;
        scanf("%d",&tmp);
        speed[i]=tmp;
    }
    BF.spfa(st);
    int flag=0;
    double tm=INF;//=(double)(BF.d[ed[1]]/speed[1]);
    int judge=0;
   // if(m==1&&BF.d[ed[1]]!=INF){printf("1\n");return 0;}
    for(int i=1;i<=m;i++)if(BF.d[ed[i]]!=INF)
    {
        if((double)BF.d[ed[i]]/speed[i]<tm||((double)BF.d[ed[i]]/speed[i]==tm&&speed[i]>=speed[flag])){
            flag=i;
            tm=(double)BF.d[ed[i]]/speed[i];
        }
    }
    for(int i=1;i<=m;i++){
        if(BF.d[i]==INF)judge++;
    }   
    if(!flag){printf("No one\n");return 0;}

    printf("%d\n",flag);
    return 0;
}