Abandoned warehouse

input/code.cpp: In function 'int main()':
input/code.cpp:57:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if (x < map[y].size() - 1 && (map[y][x+1] == '.' || map[y][x+1] == 'A'))
      |             ~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:63:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         if (y < map.size() - 1 && (map[y+1][x] == '.' || map[y+1][x] == 'A'))
      |             ~~^~~~~~~~~~~~~~~~
input/code.cpp:79:26: warning: 'endX' may be used uninitialized in this function [-Wmaybe-uninitialized]
   79 |         while (x != endX || y != endY)
      |                ~~~~~~~~~~^~~~~~~~~~~~
input/code.cpp:70:27: warning: 'startX' may be used uninitialized in this function [-Wmaybe-uninitialized]
   70 |     if (map[startY][startX]...

// Online C++ compiler to run C++ program online
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

int main() {
    // Write C++ code here
    int n, m; // height, width
    std::cin >> n >> m;
    
    vector<vector<char>> map = vector<vector<char>>(n, vector<char>(m, 0));
    int startX, startY = 0;
    int endX, endY = 0;
    for (int y = 0; y < n; y++)
    {
        string line;
        std::cin >> line;
        for (int x = 0; x < m; x++)
        {
            map[y][x] = line[x];
            if (line[x] == 'A')
            {
                startX = x;
                startY = y;
            }
            else if (line[x] == 'B')
            {
                endX = x;
                endY = y;
            }
        }
    }
    
    queue<pair<int, int>> que = queue<pair<int, int>>();
    que.push({endX, endY});
    
    while (!que.empty())
    {
        pair<int, int> coord = que.front();
        que.pop();
        int y = coord.second;
        int x = coord.first;
        
        if (y > 0 && (map[y-1][x] == '.' || map[y-1][x] == 'A'))
        {
            map[y-1][x] = 'D';
            que.push({x, y-1});
        }
        if (x > 0 && (map[y][x-1] == '.' || map[y][x-1] == 'A'))
        {
            map[y][x-1] = 'R';
            que.push({x-1, y});
        }
        if (x < map[y].size() - 1 && (map[y][x+1] == '.' || map[y][x+1] == 'A'))
        {
            
            map[y][x + 1] = 'L';
            que.push({x+1, y});
        }
        if (y < map.size() - 1 && (map[y+1][x] == '.' || map[y+1][x] == 'A'))
        {
            map[y+1][x] = 'U';
            que.push({x, y+1});
        }
    }
    
    if (map[startY][startX] == 'A')
    {
        std::cout << "NO";
    }
    else
    {
        std::cout << "YES" << std::endl;
        int x = startX;
        int y = startY;
        while (x != endX || y != endY)
        {
            std::cout << (char)map[y][x];
            if (map[y][x] == 'L')
                x--;
            else if (map[y][x] == 'U')
                y--;
            else if (map[y][x] == 'R')
                x++;
            else if (map[y][x] == 'D')
                y++;
        }
    }
    
    /*
    cout << endl;
    for (int y = 0; y < n; y++)
    {
        for (int x = 0; x < m; x++)
            std::cout << map[y][x];
        std::cout << endl;
    }
    */
    
    

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

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: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER