Elegant Showroom

#include <iostream>
#include <string>
#include <vector>
#include <queue>

using namespace std;

typedef pair<int, int> P;
#define X first
#define Y second

bool visited[500][500];

int main() {
	int r, c;
	cin >> r >> c;
	vector<string> map(r);
	for (string &s : map)
		cin >> s;
	
	queue<pair<P, int>> q;
	int x, y;
	cin >> x >> y;
	q.push({P(x, y), 1});

	while (!q.empty()) {
		auto t = q.front(); q.pop();
		int x = t.first.X;
		int y = t.first.Y;
		int d = t.second;
		char r = map[x-1][y-1];
		
		//cout<<x<<" "<<y<<" "<<d<<" "<<r<<endl;
		
		if (r == '#')
			continue;
		
		if (r == 'D')
			d--;
		
		if (x == 1 || y == 1 || x == r || y == c) {
			cout << d << "\n";
			return 0;
		}
		
		if (visited[x][y])
			continue;
		visited[x][y] = true;
		
		q.push({P(x+1, y), d+1});
		q.push({P(x-1, y), d+1});
		q.push({P(x, y+1), d+1});
		q.push({P(x, y-1), d+1});
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: RUNTIME ERROR

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED