求助dalao,裸dijkstraWA了

#include<iostream>
#include<cstring>
using namespace std;
const int MAXN=1001,INF=0x3f3f3f3f;
int w[MAXN][MAXN];
bool v[MAXN];
int d[MAXN];
int n,m,s;
void dijkstra(int s){
    memset(v,false,sizeof(v));
    for(int i=1;i<=n;++i)
        d[i]=INF;
    d[s]=0;
    int x,m;
    for(int i=1;i<=n;++i){
        x=0,m=INF;
        for(int y=1;y<=n;++y)
            if(!v[y]&&d[y]<m){
                x=y;
                m=d[y];
            }
        if(!x)
            break;
        v[x]=true;
        for(int y=1;y<=n;++y)
            if(d[y]>d[x]+w[x][y])
                d[y]=d[x]+w[x][y];
    }
}
int main(){
    ios::sync_with_stdio(0);
    memset(w,0x3f,sizeof(w));
    cin>>n>>m>>s;
    int f,g;
    while(m--){
        cin>>f>>g;
        cin>>w[f][g];
    }
    dijkstra(s);
    for(int i=1;i<=n;++i){
        if(d[i]^INF)
            cout<<d[i]<<" ";
        else
            cout<<"2147483647 ";
    }
    return 0;
}
RT,怎么着也应该过70分啊