Hypyt

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m, q, ekay, ekax, tokay, tokax;
    cin >> n >> m >> q;
    string row;
    vector<int> nodesInColumns[m];
    vector<int> nodesInRows[n];
    vector<int> col_dists[m], row_dists[n];
    string answers;
    string grid[n];
    for (int index = 0; index < m; index++) {
        vector<int> s(m, 1e9);
        col_dists[index] = s;
    }

    for (int index = 0; index < n; index++) {
        cin >> row;
        grid[index] = row;
        for (int col = 0; col < m; col++) {
            if (grid[index][col] == '.') {
                nodesInColumns[col].push_back(index);
                nodesInRows[index].push_back(col);
            }
        }
        vector<int> s(n, 1e9);
        row_dists[index] = s;
    }
    for (int index = 0; index < m; index++) {
        for (int j = 0; j < (int) nodesInColumns[index].size(); j++) {
            for (int i = j; i < (int) nodesInColumns[index].size(); i++) {
                if (nodesInColumns[index][j] < nodesInColumns[index][i]) {
                    if (row_dists[nodesInColumns[index][j]][nodesInColumns[index][i]] != 1) {
                        pair<vector<int>,vector<int>> p = {{nodesInColumns[index][i]}, {nodesInColumns[index][j]}};
                        row_dists[nodesInColumns[index][j]][nodesInColumns[index][i]] = 1;
                    }
                } else if (nodesInColumns[index][j] == nodesInColumns[index][i]) {
                    row_dists[nodesInColumns[index][j]][nodesInColumns[index][i]] = 0;
                }
            }
        }
    }
    for (int index = 0; index < n; index++) {
        for (int j = 0; j < (int) nodesInRows[index].size(); j++) {
            for (int i = j; i < (int) nodesInRows[index].size(); i++) {
                if (nodesInRows[index][j] < nodesInRows[index][i]) {
                    if (col_dists[nodesInRows[index][j]][nodesInRows[index][i]] != 1) {
                        pair<vector<int>,vector<int>> p = {{nodesInRows[index][i]}, {nodesInRows[index][j]}};
                        col_dists[nodesInRows[index][j]][nodesInRows[index][i]] = 1;
                    }
                } else if (nodesInRows[index][j] == nodesInRows[index][i]) {
                    col_dists[nodesInRows[index][j]][nodesInRows[index][i]] = 0;
                }
            }
        }
    }
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = i+1; j < n; j++) {
                row_dists[i][j] = min(row_dists[i][j], row_dists[min(i,k)][max(i,k)] + row_dists[min(k,j)][max(k,j)]);
            }
        }
    }
    for (int k = 0; k < m; k++) {
        for (int i = 0; i < m; i++) {
            for (int j = i+1; j < m; j++) {
                col_dists[i][j] = min(col_dists[i][j], col_dists[min(i,k)][max(i,k)] + col_dists[min(k,j)][max(k,j)]);
            }
        }
    }
    for (int index = 0; index < q; index++) {
        cin >> ekay >> ekax >> tokay >> tokax;
        int y1, y2, x1, x2;
        if (ekay < tokay) {
            y1 = ekay;
            y2 = tokay;
            x1 = ekax;
            x2 = tokax;
        } else {
            y1 = tokay;
            y2 = ekay;
            x1 = tokax;
            x2 = ekax;
        }
        if (y1 == y2 && x1 == x2) answers += "0\n";
        else if (y1 == y2 || x1 == x2) answers += "1\n";
        else {
            if (row_dists[y1-1][y2-1] >= 1e9) answers += "-1\n";
            else {
                answers += to_string(row_dists[y1-1][y2-1] + col_dists[x1-1][x2-1]) + "\n";
            }
        }
    }
    printf("%s", answers.c_str());
}

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 6

Group: 2, 5

Verdict: WRONG ANSWER

Test 7

Group: 2, 5

Verdict: WRONG ANSWER

Test 8

Group: 2, 5

Verdict: WRONG ANSWER

Test 9

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 12

Group: 4, 5

Verdict: WRONG ANSWER

Test 13

Group: 4, 5

Verdict: WRONG ANSWER

Test 14

Group: 4, 5

Verdict: WRONG ANSWER

Test 15

Group: 5

Verdict: WRONG ANSWER

Test 16

Group: 5

Verdict: WRONG ANSWER

Test 17

Group: 5

Verdict: WRONG ANSWER

Test 18

Group: 5

Verdict: WRONG ANSWER

Test 19

Group: 5

Verdict: WRONG ANSWER

Test 20

Group: 5

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 27

Group: 5

Verdict: ACCEPTED