Hypyt

input/code.cpp: In function 'int main()':
input/code.cpp:28:9: warning: unused variable 'c' [-Wunused-variable]
   28 |     int c = 0;
      |         ^

#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define fi first
#define se second
#define pii pair<int,int>
using ll = long long;

char r[251][251];

vector<int> adj[62501];

int n, m, q;
int dist[62501];
bool vis[62501];

int id(int y, int x) {
    return (y-1)*m + x;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> n >> m >> q;

    int c = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> r[i][j];
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (r[i][j] == '*') continue;
            int a = id(i, j);
            for (int x = 1; x <= m; x++) {
                if (x == j || r[i][x] == '*') continue;
                int b = id(i, x);
                adj[a].push_back(b);
            }
            for (int y = 1; y <= n; y++) {
                if (y == i || r[y][j] == '*') continue;
                int b = id(y, j);
                adj[a].push_back(b);
            }
        }
    }

    map<int, vector<pii>> w;
    for (int i = 1; i <= q; i++) {
        int y1, x1, y2, x2;
        cin >> y1 >> x1 >> y2 >> x2;
        int a = id(y1, x1), b = id(y2, x2);
        w[a].push_back({b, i});
    }

    vector<pii> ans;
    for (auto x : w) {

        int a = x.fi;
        
        memset(vis, false, sizeof(vis));

        queue<int> bfs;
        bfs.push(a);
        vis[a] = true;
        dist[a] = 0;

        while (!bfs.empty()) {
            int s = bfs.front(); 
            bfs.pop();
            for (int u : adj[s]) {
                if (vis[u]) continue;
                vis[u] = true;
                dist[u] = dist[s]+1;
                bfs.push(u);
            }
        }

        for (auto u : x.se) {
            if (dist[u.fi] == 0) ans.push_back({u.se, (a == u.fi ? 0 : -1)});
            else ans.push_back({u.se, dist[u.fi]});
        }

    }

    sort(all(ans));

    for (auto u : ans) cout << u.se << " ";
    cout << "\n";
    
    return 0;
}

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 6

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2, 5

Verdict: ACCEPTED

Test 9

Group: 3, 4, 5

Verdict: ACCEPTED

Test 10

Group: 3, 4, 5

Verdict: ACCEPTED

Test 11

Group: 3, 4, 5

Verdict: ACCEPTED

Test 12

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4, 5

Verdict: ACCEPTED

Test 15

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5

Verdict: ACCEPTED

Test 20

Group: 5

Verdict: ACCEPTED

Test 21

Group: 5

Verdict: ACCEPTED

Test 22

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 23

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 24

Group: 5

Verdict: ACCEPTED

Test 25

Group: 5

Verdict: ACCEPTED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: ACCEPTED