Submission #11185304

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int H,W;
ll A,B,C;
int N;
int Y[101010],X[101010];
ll D[505][505];
ll D2[505][505];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>H>>W;
	cin>>A>>B>>C;
	cin>>N;
	H++,W++;
	FOR(y,H) FOR(x,W) D[y][x]=D2[y][x]=1LL<<60;
	queue<int> Q;
	FOR(i,N) {
		cin>>Y[i]>>X[i];
		D[Y[i]][X[i]]=0;
		Q.push(Y[i]*1000+X[i]);
	}
	while(Q.size()) {
		y=Q.front()/1000;
		x=Q.front()%1000;
		Q.pop();
		int dd[4]={1,0,-1,0};
		FOR(i,4) {
			int ty=y+dd[i];
			int tx=x+dd[i^1];
			if(ty<0||ty>=H||tx<0||tx>=W) continue;
			if(D[ty][tx]>D[y][x]+C) {
				D[ty][tx]=D[y][x]+C;
				Q.push(ty*1000+tx);
			}
		}
	}
	priority_queue<pair<ll,int>> PQ;
	D2[Y[0]][X[0]]=0;
	PQ.push({0,Y[0]*1000+X[0]});
	while(PQ.size()) {
		ll co=-PQ.top().first;
		int cy=PQ.top().second/1000;
		int cx=PQ.top().second%1000;
		PQ.pop();
		if(D2[cy][cx]!=co) continue;
		if(cy==Y[N-1]&&cx==X[N-1]) {
			cout<<co<<endl;
			return;
		}
		int dd[4]={1,0,-1,0};
		FOR(i,4) {
			int ty=cy+dd[i];
			int tx=cx+dd[i^1];
			if(ty<0||ty>=H||tx<0||tx>=W) continue;
			if(D2[ty][tx]>co+C) {
				D2[ty][tx]=co+C;
				PQ.push({-D2[ty][tx],ty*1000+tx});
			}
		}
		for(y=1;cy-y>=0&&y<=100;y++) if(D2[cy-y][cx]>co+A*y+B+D[cy-y][cx]) {
			D2[cy-y][cx]=co+A*y+B+D[cy-y][cx];
			PQ.push({-D2[cy-y][cx],(cy-y)*1000+cx});
		}
		for(y=1;cy+y<H&&y<=100;y++) if(D2[cy+y][cx]>co+A*y+B+D[cy+y][cx]) {
			D2[cy+y][cx]=co+A*y+B+D[cy+y][cx];
			PQ.push({-D2[cy+y][cx],(cy+y)*1000+cx});
		}
		for(x=1;cx-x>=0&&x<=100;x++) if(D2[cy][cx-x]>co+A*x+B+D[cy][cx-x]) {
			D2[cy][cx-x]=co+A*x+B+D[cy][cx-x];
			PQ.push({-D2[cy][cx-x],cy*1000+cx-x});
		}
		for(x=1;cx+x<W&&x<=100;x++) if(D2[cy][cx+x]>co+A*x+B+D[cy][cx+x]) {
			D2[cy][cx+x]=co+A*x+B+D[cy][cx+x];
			PQ.push({-D2[cy][cx+x],cy*1000+cx+x});
		}
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

Submission Info

Judge Result