Abandoned warehouse

input/code.cpp: In function 'int main()':
input/code.cpp:51:31: warning: 'endY' may be used uninitialized in this function [-Wmaybe-uninitialized]
   51 |         if (current.x == endX && current.y == endY) {
      |             ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
input/code.cpp:51:9: warning: 'endX' may be used uninitialized in this function [-Wmaybe-uninitialized]
   51 |         if (current.x == endX && current.y == endY) {
      |         ^~
input/code.cpp:25:17: warning: 'startY' may be used uninitialized in this function [-Wmaybe-uninitialized]
   25 |     int startX, startY, endX, endY;
      |                 ^~~~~~
input/code.cpp:45:19: warning: 'startX' may be used uninitialized in this function [-Wmaybe-uninitialized]
   45 |     visited[startX][startY] = true;
      |                   ^

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

const vector<pair<int, int>> directions = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
const vector<char> directionChars = {'U', 'R', 'D', 'L'};

struct Node {
    int x, y;
    string path;
};

bool isValid(int x, int y, int n, int m, vector<vector<char>>& warehouse, vector<vector<bool>>& visited) {
    return x >= 0 && y >= 0 && x < n && y < m && warehouse[x][y] != '#' && !visited[x][y];
}

int main() {
    int n, m;
    cin >> n >> m;
    
    vector<vector<char>> warehouse(n, vector<char>(m));
    vector<vector<bool>> visited(n, vector<bool>(m, false));
    
    int startX, startY, endX, endY;
    
    for (int i = 0; i < n; i++) {
        string row;
        cin >> row;
        for (int j = 0; j < m; j++) {
            warehouse[i][j] = row[j];
            if (row[j] == 'A') {
                startX = i;
                startY = j;
            }
            if (row[j] == 'B') {
                endX = i;
                endY = j;
            }
        }
    }

    queue<Node> q;
    q.push({startX, startY, ""});
    visited[startX][startY] = true;
    
    while (!q.empty()) {
        Node current = q.front();
        q.pop();

        if (current.x == endX && current.y == endY) {
            cout << "YES" << endl;
            cout << current.path.length() << endl;
            cout << current.path << endl;
            return 0;
        }

        for (int i = 0; i < 4; i++) {
            int newX = current.x + directions[i].first;
            int newY = current.y + directions[i].second;
            
            if (isValid(newX, newY, n, m, warehouse, visited)) {
                visited[newX][newY] = true;
                q.push({newX, newY, current.path + directionChars[i]});
            }
        }
    }
    
    cout << "NO" << endl;
    return 0;
}

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: TIME LIMIT EXCEEDED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED