Abandoned warehouse

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

int height, width;
int startX, startY, endX, endY;
std::vector<std::vector<int>> grid;

int find_shortest_path(std::vector<int> &path, int posX, int posY) {
    if (grid[posY][posX] == 1) return -1;
    if (grid[posY][posX] == 3) return 0;

    std::vector<std::pair<int, int>> dist_dir_pairs(4);
    dist_dir_pairs[0] = std::make_pair(std::abs(posX+1 - endX) + std::abs(posY - endY), 0);
    dist_dir_pairs[1] = std::make_pair(std::abs(posX-1 - endX) + std::abs(posY - endY), 1);
    dist_dir_pairs[2] = std::make_pair(std::abs(posX - endX) + std::abs(posY+1 - endY), 2);
    dist_dir_pairs[3] = std::make_pair(std::abs(posX - endX) + std::abs(posY-1 - endY), 3);

    std::sort(dist_dir_pairs.begin(), dist_dir_pairs.end());

    for (int i = 0; i < 4; ++i) {
        int dir = dist_dir_pairs[i].second;
        int last_dir = -1;
        if (path.size() >= 1) last_dir = path.back();
        path.push_back(dir);
        int length = -1;
        std::cout << "check " << dir << " " << path.size() << std::endl;
        switch(dir) {
            case 0:
                if (last_dir == 1) break;
                length = find_shortest_path(path, posX+1, posY);
                break;
            case 1:
                if (last_dir == 0) break;
                length = find_shortest_path(path, posX-1, posY);
                break;
            case 2:
                if (last_dir == 3) break;
                length = find_shortest_path(path, posX, posY+1);
                break;
            case 3:
                if (last_dir == 2) break;
                length = find_shortest_path(path, posX, posY-1);
                break;
        }
        if (length == -1) {
            path.pop_back();
        } else {
            return length+1;
        }
    }
    grid[posY][posX] = 1;
    return -1;
}

int main() {
    std::cin >> height >> width;

    grid = std::vector<std::vector<int>>(height, std::vector<int>(width));
    int x = 0;
    int y = 0;
    for (auto &row : grid) {
        for (auto &cell : row) {
            char input;
            std::cin >> input;
            if (input == '.') {
                cell = 0;
            } else if (input == '#') {
                cell = 1;
            } else if (input == 'A') {
                cell = 2;
                startX = x;
                startY = y;
            } else if (input == 'B') {
                cell = 3;
                endX = x;
                endY = y;
            }
            x++;
        }
        x = 0;
        y++;
    }

    std::vector<int> path;
    int length = find_shortest_path(path, startX, startY);
    if (length == -1) {
        std::cout << "NO" << std::endl;
        return 0;
    }
    std::cout << "YES" << std::endl;
    std::cout << length << std::endl;
    for (uint i = 0; i < path.size(); ++i) {
        int dir = path[i];
        switch(dir) {
            case 0: 
                std::cout << "R";
                break;
            case 1: 
                std::cout << "L";
                break;
            case 2: 
                std::cout << "D";
                break;
            case 3: 
                std::cout << "U";
                break;
        }
    }
}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER