Abandoned warehouse

input/code.cpp: In function 'int main()':
input/code.cpp:81:14: warning: 'jj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   81 |     s = solve(s, vs, ii, jj, vis, n, m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:81:14: warning: 'ii' may be used uninitialized in this function [-Wmaybe-uninitialized]

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef pair <ll, ll> pl;
typedef vector <vl> vvl;

bool valid(ll i, ll j, ll n, ll m, const vvl &vis)
{
    if(i >= 0 && j >= 0 && i < n && j < m && !vis[i][j])
        return true;
    return false;
}

string solve(string s, const vector <string> vs, ll i, ll j, vvl &vis, ll n, ll m)
{
    //cerr << i << " " << j << " " << vs[i][j] << "\n";
    vis[i][j] = true; string k;
    if(vs[i][j] == 'B')
        return s;
    if(valid(i + 1, j, n, m, vis))
    {
        s += 'D';
        vis[i + 1][j] = true;
        k = solve(s, vs, i + 1, j, vis, n, m);
        if(k.length() > 0)
            return k;
    }
    if(valid(i - 1, j, n, m, vis))
    {
        s += 'U';
        vis[i - 1][j] = true;
        k = solve(s, vs, i - 1, j, vis, n, m);
        if(k.length() > 0)
            return k;
    }
    if(valid(i, j + 1, n, m, vis))
    {
        s += 'R';
        vis[i][j + 1] = true;
        k = solve(s, vs, i, j + 1, vis, n, m);
        if(k.length() > 0)
            return k;
    }
    if(valid(i, j - 1, n, m, vis))
    {
        s += 'L';
        vis[i][j - 1] = true;
        k = solve(s, vs, i, j - 1, vis, n, m);
        if(k.length() > 0)
            return k;
    }
    return "";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    ll n, m, i, j, ii, jj;
    cin >> n >> m;
    vector <string> vs(n);
    vvl vis(n, vl(m, 0));
    for(i = 0; i < n; i++)
        cin >> vs[i];
    for(i = 0; i < n; i++)
    {
        for(j = 0; j < m; j++)
        {
            if(vs[i][j] == 'A')
            {
                ii = i;
                jj = j;
            }
            if(vs[i][j] == '#')
                vis[i][j] = true;
        }
    }
    string s;
    s = solve(s, vs, ii, jj, vis, n, m);
    if(s.length() == 0)
        cout << "NO";
    else
        cout << "YES\n" << s.length() << "\n" << s;

    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: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: RUNTIME ERROR

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: RUNTIME ERROR