Hypyt

input/code.cpp: In function 'int bfs(std::map<int, std::vector<int> >, int, int)':
input/code.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for(int i=0; i<table[current_point].size(); i++){
      |                      ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:62:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for(int k=0; k < row.size(); k++){
      |                          ~~^~~~~~~~~~~~
input/code.cpp:75:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             for(int k=0; k < column.size(); k++){
      |                          ~~^~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;

int bfs(map<int, vector<int>> table, int start, int end){
    unordered_set<int> visited;
    
    queue<pair<int, int>> q; // {point, move_count}
    q.push({start, 0});
    visited.insert(start);
    
    while (q.size() > 0){
        int current_point = q.front().first;
        int move_count = q.front().second;
        q.pop();
        

        if(current_point == end){
            return move_count;
        }
        

        for(int i=0; i<table[current_point].size(); i++){
            int v = table[current_point][i];
            if(visited.find(v) == visited.end()){
                q.push({v, move_count+1});
                visited.insert(v);
            }
        }
    }
    
    return -1;
}



int main() {
   
    int n, m, q;
    cin >> n >> m >> q;
   
    vector<vector<char>> grid(n, vector<char>(m, 0));

    map<int, vector<int>> rows;
    map<int, vector<int>> columns;
    
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            cin >> grid[i][j];
            if(grid[i][j] == '*') continue;
        }
    }
 
    
    for(int i=0; i < n; i++){
        vector<int> row = {};
        for(int j=0; j < m; j++){
            if(grid[i][j] == '*') continue;
            row.push_back(j);
        }
        for(int j=0; j < m; j++){
            if(grid[i][j] == '*') continue;
            for(int k=0; k < row.size(); k++){
                rows[j].push_back(row[k]);
            }
        }
    }
    for(int j=0; j < m; j++){
        vector<int> column = {};
        for(int i=0; i < n; i++){
            if(grid[i][j] == '*') continue;
            column.push_back(i);
        }
        for(int i=0; i < n; i++){
            if(grid[i][j] == '*') continue;
            for(int k=0; k < column.size(); k++){
                columns[i].push_back(column[k]);
            }
        }
    }

    for(int i=0; i < q; i++){
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2;

        int x = bfs(rows, x1-1, x2-1);
        int y = bfs(columns, y1-1, y2-1);

        if(x == -1 || y == -1){
            cout << -1 << "\n";
        }
        else{
            cout << x+y << "\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: WRONG ANSWER

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

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

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

Test 20

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 5

Verdict: TIME LIMIT EXCEEDED

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

Test 25

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: ACCEPTED