蒟蒻刚学 OI样例 WA 求条谢谢

123456789101112131415161718192021222324252627282930313233343536#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>>G[1010];
int dis[1010],vis[1010];
int n,m;
void dij(){
    priority_queue<int>que;
    que.push(1);
    memset(dis,-1,sizeof dis);
    dis[1]=0,vis[1]=1;
    while(!que.empty()){
        int f=que.top();
        que.pop();
        for(int i=0;i<G[f].size();++i){
            if(dis[G[f][i].first]==0||dis[G[f][i].first]>dis[f]+G[f][i].second){
                dis[G[f][i].first]=dis[f]+G[f][i].second;
                que.push(G[f][i].first);
            }
        }
    }
    dis[1]=0;
    for(int i=1;i<=n;++i){
    	printf("%d ",dis[i]);
	}
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i){
        int x,y,z;
        scanf("%d%d%d",&x,&y,&z);
        G[x].push_back(make_pair(y,z));
        G[y].push_back(make_pair(x,z));
    }
    dij();
    return 0;
}