BFS T了on #16#19，请大佬帮忙看看

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
int n,m,s,t;
vector<pii> g[20005];
int mp[20005];
int bfs(){
	priority_queue<pair<pii,int>,vector<pair<pii,int>>,greater<pair<pii,int>>> q;
	q.push({{0,0},t});
	while(!q.empty()){
		register int ans=q.top().first.first,cnt=q.top().first.second,x=q.top().second;
		q.pop();
		if(x==s||cnt>=100) return ans;
		for(register int i=0;i<g[x].size();++i)
				q.push({{ans+g[x][i].second/(cnt+1),cnt+1},g[x][i].first});
	}
}
int main(){
	cin>>n>>m>>s>>t;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		g[u].push_back({v,w});
		g[v].push_back({u,w});
	}
	cout<<bfs();
	return 0;
}