Elegant Showroom

#include <iostream>
#include <queue>
#include <tuple>
using namespace std;
char map[402][402];
int dist[402][402];
bool vv[402][402];
typedef tuple<int,int,int> TI3;
int main(){
	int r,c;
	cin>>r>>c;
	for(int i=1;i<=r;++i)cin>>(map[i]+1);
	int x,y;
	cin>>x>>y;
	priority_queue<TI3> q;
	q.emplace(-1,x,y);
	for(int i=1;i<=r;++i){
		for(int j=1;j<=c;++j){
			if(map[i][j]!='#'){
				dist[i][j]=-1e9;
			}
		}
	}
	int d;
	while(!q.empty()){
		tie(d,x,y) = q.top();
		q.pop();
		if(dist[x][y]>d)continue;
		if(vv[x][y])continue;
		vv[x][y]=true;
		if(x==1||y==1||x==r||y==c){cout<<-d<<'\n';return 0;}
		#define dd(x,y) (d-(map[x][y]=='D'?0:1))
		#define foo(x,y) if(dist[x][y]<dd(x,y))q.emplace(dd(x,y),x,y);
		foo(x+1,y)
		foo(x-1,y)
		foo(x,y+1)
		foo(x,y-1)
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED