Abandoned warehouse

input/code.cpp: In function 'int main()':
input/code.cpp:56:23: warning: variable 'bx' set but not used [-Wunused-but-set-variable]
   56 |     int n, m, ax, ay, bx, by;
      |                       ^~
input/code.cpp:56:27: warning: variable 'by' set but not used [-Wunused-but-set-variable]
   56 |     int n, m, ax, ay, bx, by;
      |                           ^~
input/code.cpp:80:8: warning: 'ay' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |     bfs(map, ax, ay, n, m);
      |     ~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:80:8: warning: 'ax' may be used uninitialized in this function [-Wmaybe-uninitialized]

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
 
void bfs(vector< vector<char> >& map,int ax,int ay,int n,int m) {
 
    vector< vector< bool> > visited = vector<vector<bool> >(n, vector<bool>(m, false));
    queue<pair<pair<int, int>, string> > q;
 
    q.push(make_pair(make_pair(ax, ay), ""));
 
    while (!q.empty()){
        auto aux = q.front();
        q.pop();
 
        int nx = aux.first.first, ny = aux.first.second;
        //cout << nx << " " << ny << endl;
            visited[nx][ny] = true;
 
        if (map[nx][ny] == 'B')
        {
            cout << "YES" << endl;
            cout << aux.second.size() << endl;
            cout << aux.second << endl;
            return;
        }
 
        if (nx -1 >= 0 and map[nx -1][ny] != '#' and !visited[nx-1][ny])
        {   
            q.push(make_pair(make_pair(nx-1, ny), aux.second + 'U'));
            visited[nx-1][ny] = true;
        }
        if ( nx +1< n and map[nx +1][ny] != '#' and !visited[nx+1][ny]){
            q.push(make_pair(make_pair(nx+1, ny), aux.second + 'D'));
            visited[nx+1][ny] = true;
        }
 
        if (ny-1 >= 0 and map[nx][ny-1] != '#' and !visited[nx][ny-1])
        {
            q.push(make_pair(make_pair(nx, ny-1), aux.second + 'L'));
            visited[nx][ny-1] = true;
        }
        if (ny+1 < m and map[nx][ny+1] != '#' and !visited[nx][ny+1]){
            q.push(make_pair(make_pair(nx, ny+1), aux.second + 'R'));
            visited[nx][ny+1] = true;
        }
    }
    cout << "NO" << endl;
}
 
int main() {
    
    int n, m, ax, ay, bx, by;
 
    cin >> n >> m;
 
    vector< vector<char> > map = vector<vector<char> >(n);
    for (int i = 0; i < n; ++i)
    {
        char aux;
        for (int j = 0; j < m; ++j)
        {
            cin >> aux;
            if (aux == 'A'){
                ax = i;
                ay = j;
            }
            else if (aux == 'B')
            {
                bx = i;
                by = j;
            }
            map[i].push_back(aux);
        }
    }
 
    bfs(map, ax, ay, n, m);
 
 
}

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