Hypyt

#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
    int n, m, q, y1, x1, y2, x2;
    string row;
    cin >> n >> m >> q;
    vector<string> grid;
    vector<int> nodesInColumns[m];
    set<int> nodesInRows[n];
    vector<vector<int>> v, d;
    vector<pair<int,int>> translate;
    map<pair<int,int>,int> translate2;
    int nodes = 0;

    for (int index = 0; index < n; index++) {
        cin >> row;
        grid.push_back(row);
        for (int col = 0; col < m; col++) {
            if (grid[index][col] == '.') {
		pair<int,int> p = {index, col};
		translate2[p] = nodes;
                nodesInColumns[col].push_back(nodes);
                nodesInRows[index].insert(nodes);
		translate.push_back(p);
		nodes++;
            }
        }
    }
    for (int i = 0; i < nodes; i++) {
	vector<int> b(nodes, 0);
	v.push_back(b);
	d.push_back(b);
    }
    for (int index = 0; index < n; index++) {
        for (int col = 0; col < m; col++) {
            if (grid[index][col] == '.') {
		for (auto node : nodesInColumns[col]) {
		    pair<int,int> p = {index, col};
		    int s = translate2[p]; 
		    v[s][node] = 1;
		}
		for (auto node : nodesInRows[index]) {
		    pair<int,int> p = {index, col};
		    int s = translate2[p]; 
		    v[s][node] = 1;
		}
            }
        }
    }
    //floyd
    for (int i = 0; i < nodes; i++) {
	for (int j = 0; j < nodes; j++) {
	    if (i == j) d[i][j] = 0;
	    else if (v[i][j] == 1) d[i][j] = v[i][j];
	    else d[i][j] = 1e9;
	}
    }
    for (int k = 0; k < nodes; k++) {
	    for (int i = 0; i < nodes; i++) {
		    for (int j = 0; j < nodes; j++) {
			    d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
		    }
	    }
    }
    //kyselyt
    for (int index = 0; index < q; index++) {
	    cin >> y1 >> x1 >> y2 >> x2;
	    if (y1 == y2 && x1 == x2) cout << 0 << endl; 
	    else if (y1 == y2 || x1 == x2) cout << 1 << endl; 
	    else {
		pair<int,int> e = {y1-1,x1-1};
		pair<int,int> f = {y2-1,x2-1};
		int c = translate2[e];
		int g = translate2[f];
		if (d[c][g] == 1e9) cout << -1 << endl;
		else cout << d[c][g]<< endl;
	    }
    }
}

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