Hypyt

input/code.cpp: In function 'int bfs(int, int, std::vector<std::vector<int> >, std::vector<std::vector<int> >, std::pair<int, int>, std::pair<int, int>)':
input/code.cpp:24:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |             for(int i=0; i<rows[current_point.second].size(); i++){
      |                          ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |             for(int i=0; i<columns[current_point.first].size(); i++){
      |                          ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
 
int bfs(int n, int m, vector<vector<int>> rows, vector<vector<int>> columns, pair<int, int> p1, pair<int, int> p2){
    unordered_set<int> visited_rows;
    unordered_set<int> visited_columns;
    unordered_set<int> visited;
    
    queue<pair<pair<int, int>, int>> q; // {point, move_count}
    q.push({p1, 0});
    visited.insert(p1.first + p1.second * m);
    
    while (q.size() > 0){
        pair<int, int> current_point = q.front().first;
        int move_count = q.front().second;
        q.pop();
        
        if(current_point == p2){
            return move_count;
        }
        
        if(visited_rows.find(current_point.second) == visited_rows.end()){
            visited_rows.insert(current_point.second);
            for(int i=0; i<rows[current_point.second].size(); i++){
                int v = rows[current_point.second][i] + current_point.second * m;
                if(visited.find(v) == visited.end()){
                    q.push({{rows[current_point.second][i], current_point.second}, move_count+1});
                    visited.insert(v);
                }
            }
        }
        if(visited_columns.find(current_point.first) == visited_columns.end()){
            visited_columns.insert(current_point.first);
            for(int i=0; i<columns[current_point.first].size(); i++){
                int v = current_point.first + columns[current_point.first][i] * m;
                if(visited.find(v) == visited.end()){
                    q.push({{current_point.first, columns[current_point.first][i]}, 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));
    
    vector<vector<int>> rows;
    vector<vector<int>> columns;
    
    for(int i=0; i < n; i++){
        vector<int> row = {};
        for(int j=0; j < m; j++){
            cin >> grid[i][j];
            if(grid[i][j] == '*') continue;
            row.push_back(j);
        }
        rows.push_back(row);
    }

    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);
        }
        columns.push_back(column);
    }
 
    vector<int> results;
    for(int i=0; i < q; i++){
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2;
        
        results.push_back(bfs(n, m, rows, columns, {x1-1, y1-1}, {x2-1, y2-1}));
    }

    for(int i=0; i<q; i++){
        cout << results[i] << "\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: 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