Sokkelo

input/code.cpp: In function 'int main()':
input/code.cpp:47:24: warning: 'bx' may be used uninitialized in this function [-Wmaybe-uninitialized]
     dfs(ay, ax, 0); dfs(by, bx, 1);
                     ~~~^~~~~~~~~~~
input/code.cpp:47:8: warning: 'ay' may be used uninitialized in this function [-Wmaybe-uninitialized]
     dfs(ay, ax, 0); dfs(by, bx, 1);
     ~~~^~~~~~~~~~~
input/code.cpp:47:8: warning: 'ax' may be used uninitialized in this function [-Wmaybe-uninitialized]
input/code.cpp:47:24: warning: 'by' may be used uninitialized in this function [-Wmaybe-uninitialized]
     dfs(ay, ax, 0); dfs(by, bx, 1);
                     ~~~^~~~~~~~~~~

#include <bits/stdc++.h>
 
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
 
using namespace std;
 
const int N = (int)1e5;
const int inf = (int)1e8;
bool grid[1000][1000];
bool vis[1000][1000][2];
 
 
 
void dfs(int y, int x, bool b){
    //cout << y << " " << x << "\n";
    vis[y][x][b] = 1;
    if(grid[y+1][x]&&!vis[y+1][x][b])dfs(y+1, x, b);
    if(grid[y-1][x]&&!vis[y-1][x][b])dfs(y-1, x, b);
    if(grid[y][x+1]&&!vis[y][x+1][b])dfs(y, x+1, b);
    if(grid[y][x-1]&&!vis[y][x-1][b])dfs(y, x-1, b);
}
 
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    int ay, ax, by, bx;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < m; ++j){
            char c; cin >> c;
            if(c=='#')grid[i][j]=0;
            else grid[i][j] = 1;
            if(c=='A'){
                ay = i;
                ax = j;
            }
            else if(c=='B'){
                by = i;
                bx = j;
            }
        }
    }
    dfs(ay, ax, 0); dfs(by, bx, 1);
    ll closestA[n][m];
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < m; ++j){
            if(vis[i][j][0])closestA[i][j]=0;
            else closestA[i][j] = inf;
            //cout << closestA[i][j] << " ";
        }
    }
    for(int i = 1; i < n - 1; ++i){
        for(int j = 1; j < m - 1; ++j){
            if(!vis[i][j][0]){
                closestA[i][j] = min(closestA[i][j], min(closestA[i+1][j], min(closestA[i-1][j], min(closestA[i][j+1], closestA[i][j-1])))+1);
            }
            //cout << closestA[i][j] << " ";
        }
    }
    ll ans = inf;
    for(int i = 1; i < n-1; ++i){
        for(int j = 1; j < m - 1; ++j){
            if(!vis[i][j][1])continue;
            else ans = min(ans, closestA[i][j]);
        }
    }
    if(!ans)cout << "1\n";
    else cout << ans << "\n";
 
 
 
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 1, 2

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED