这是我学过的dijkstra吗

#include<bits/stdc++.h>
#define int  long long
using namespace std;
int h,w,p[200005],val[200005],dis[200005],vis[200005];
struct node{
	int x,y,w;
	bool operator<(const node &o)const{
		if(w==o.w&&x==o.x)return y<o.y;
		if(w==o.w)return x<o.x;
		return w<o.w;
	}
};
int id(int x,int y){
	return (x-1)*w+y;
}
int dx[2]={1,0},dy[2]={0,1};
priority_queue<node>q;
bool check(int mid){
	while(!q.empty())q.pop();
	memset(dis,-1,sizeof dis);
	memset(vis,0,sizeof vis);
	if(mid+val[1]-p[1]<0)return false;
	q.push({1,1,mid+val[1]-p[1]});
	dis[1]=mid+val[1]-p[1];
	while(!q.empty()){
		auto u=q.top();
		q.pop();
		int x=u.x,y=u.y;
		if(x==h&&y==w)return true;
		if(vis[id(x,y)])continue;
		vis[id(x,y)]=1;
		for(int i=0;i<2;i++){
			int nx=x+dx[i],ny=y+dy[i];
			if(nx>h||ny>w)continue;
			if(dis[id(x,y)]+val[id(nx,ny)]-p[x+y]>dis[id(nx,ny)]&&vis[id(nx,ny)]==0){
				dis[id(nx,ny)]=dis[id(x,y)]+val[id(nx,ny)]-p[x+y];
				q.push({nx,ny,dis[id(nx,ny)]});
			}
		}
	}
	return false;
}
signed main(){
	cin>>h>>w;
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cin>>val[id(i,j)];
		}
	}
	for(int i=1;i<h+w;i++)cin>>p[i];
	int l=0,r=1e18,ans;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid))r=mid-1,ans=mid;
		else l=mid+1;
	}
	cout<<ans;
}