Hypyt

input/code.cpp: In function 'int main()':
input/code.cpp:25:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int k=0; k < nodes.size(); k++){
      |                  ~~^~~~~~~~~~~~~~
input/code.cpp:27:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         for(int c=0; c < nodes.size(); c++){
      |                      ~~^~~~~~~~~~~~~~
input/code.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int k = 0; k < nodes.size(); k++) {
      |                     ~~^~~~~~~~~~~~~~
input/code.cpp:43:27: warning: comparison of integer expressions of different signedness: 'int' and...

#include <bits/stdc++.h>

using namespace std;

int main() {
   
    int n, m, q;
    cin >> n >> m >> q;
   
    
    vector<pair<int, int>> nodes;
    map<pair<int, int>, int> node_map;
    vector<vector<int>> result;
    
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            char val;
            cin >> val;
            if(val == '*') continue;
            node_map[{i, j}] = nodes.size();
            nodes.push_back({i, j});
        }
    }
    
    for(int k=0; k < nodes.size(); k++){
        vector<int> result_col = {};
        for(int c=0; c < nodes.size(); c++){
            if(nodes[k] == nodes[c]){
                result_col.push_back(0);
            }
            else if(nodes[k].first == nodes[c].first || nodes[k].second == nodes[c].second){
                result_col.push_back(1);
            }
            else{
                result_col.push_back(1e8);
            }
        }
        result.push_back(result_col);
    }

    // Floyd Warshall Algorithm
    for (int k = 0; k < nodes.size(); k++) {
        for (int i = 0; i < nodes.size(); i++) {
            for (int j = 0; j < nodes.size(); j++) {
                if(result[i][k] != 1e8 && result[k][j]!= 1e8)
                result[i][j] = min(result[i][j], result[i][k]+result[k][j]);
            }
        }
    }
    
    for(int i=0; i < q; i++){
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2;

        int ind1 = node_map[{y1-1, x1-1}];
        int ind2 = node_map[{y2-1, x2-1}];
        
        int res_val = result[ind1][ind2];
        if(res_val == 1e8){
            cout << -1 << "\n";
            continue;
        }
        cout << res_val << "\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: RUNTIME ERROR

Test 7

Group: 2, 5

Verdict: RUNTIME ERROR

Test 8

Group: 2, 5

Verdict: RUNTIME ERROR

Test 9

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

Test 15

Group: 5

Verdict: RUNTIME ERROR

Test 16

Group: 5

Verdict: RUNTIME ERROR

Test 17

Group: 5

Verdict: RUNTIME ERROR

Test 18

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5

Verdict: ACCEPTED

Test 20

Group: 5

Verdict: TIME LIMIT EXCEEDED

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

Test 27

Group: 5

Verdict: ACCEPTED