93tps求调

#include<bits/stdc++.h>
using namespace std;
struct Node{
	int id,ti,mo;
}u,v;
int k,n,m;
int s,e;
vector<Node>map1[2005];
int dis[2005];
int a,b,t,h;
queue<Node> q;
int main(){
	// freopen("convexhull.in","r",stdin);freopen("convexhull.out","w",stdout); 
	memset(dis,0x3f3f3f3f,sizeof(dis));
	cin>>k>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>a>>b>>t>>h;
		map1[a].push_back({b,t,h});
		map1[b].push_back({a,t,h});
	}
	cin>>s>>e;
	dis[s]=0;
	q.push({s,0,0});
	while(!q.empty()){
		u=q.front();
		q.pop();
		for(int i=0;i<map1[u.id].size();i++){
			v=map1[u.id][i];		
			if(u.mo+v.mo<k){
				if(dis[v.id]>u.ti+v.ti){
					dis[v.id]=u.ti+v.ti;
					v.ti+=u.ti;
					v.mo+=u.mo;
					q.push(v);
				}
			}
		}
	}
	if(dis[e]==0x3f3f3f3f)cout<<"-1";
	else cout<<dis[e];
	return 0;
}