神秘魔改dijkstra求hack

#include<bits/stdc++.h>
using namespace std;
#define inf 1e9+1
const int N=2e5+9;
int n,m,a[N],b[N];
struct edge{int to,s,t;};
vector<edge> e[N];
bool cmp(const edge&a,const edge&b){return a.s<b.s;}
struct node{
	int x,d;
	bool operator<(const node&tmp)const{return d>tmp.d;}
};
priority_queue<node> q;
int main(){
	cin>>n>>m;
	while(m--){
		int u,s,v,t;cin>>u>>s>>v>>t;
		e[u].push_back((edge){v,s,t});
	}
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) sort(e[i].begin(),e[i].end(),cmp);
	for(int i=2;i<=n;i++) b[i]=inf;
	b[1]=-a[1];
	q.push((node){1,0});
	while(!q.empty()){
		int u=q.top().x,d=q.top().d;q.pop();
		int l=0,r=e[u].size()-1,res=e[u].size();
		while(l<=r){
			int mid=(l+r)>>1;
			if(e[u][mid].s<d) l=mid+1;
			else r=mid-1,res=mid;
		}
		for(int i=res;i<e[u].size();i++){
			int v=e[u][i].to,w=e[u][i].t;
			if(w<b[v]){
				b[v]=w;
				q.push((node){v,w+a[v]});
			}
		}
	}
	puts("0");
	for(int i=2;i<=n;i++) cout<<(b[i]==inf?-1:b[i])<<endl;
	return 0;
}