Hypyt

input/code.cpp: In function 'int bfs(std::vector<std::vector<int> >, std::vector<std::vector<int> >, int, int)':
input/code.cpp:25:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |             for(int c=0; c<d1[current_index].size(); c++){
      |                          ~^~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:35:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |             for(int c=0; c<d2[current_index].size(); c++){
      |                          ~^~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
 
using namespace std;
 
 
int bfs(vector<vector<int>> d1, vector<vector<int>> d2, int start_index, int end_index){
    set<pair<int, int>> visited;
    
    queue<pair<pair<int, int>, int>> q; // {{current, d1 or d2}, move_count}
    q.push({{start_index, 1}, 0});
    visited.insert({start_index, 1});
 
    while (q.size() > 0){
        pair<int, int> current = q.front().first;
        int current_index = current.first;
        int current_type = current.second;
        int move_count = q.front().second;
        q.pop();
        
        if(current_index == end_index && current_type == 2){
            return move_count;
        }

        if(current_type == 1){
            for(int c=0; c<d1[current_index].size(); c++){
                pair<int, int> v = {d1[current_index][c], 2};
     
                if(visited.find(v) == visited.end()){
                    q.push({v, move_count+1});
                    visited.insert(v);
                }
            }
        }
        if(current_type == 2){
            for(int c=0; c<d2[current_index].size(); c++){
                pair<int, int> v = {d2[current_index][c], 1};
     
                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));
    
    vector<vector<int>> rows;
    vector<vector<int>> columns;
    
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            cin >> grid[i][j];
        }
    }
    
    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);
        }
        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);
    }

    for(int i=0; i < q; i++){
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2;
        
        if(y1==y2 && x1==x2){
            cout << 0 << "\n";
            continue;
        }
        
        int row_col = bfs(rows, columns, y1-1, x2-1);
        int col_row = bfs(columns, rows, x1-1, y2-1);
 
        if(row_col == -1 || col_row == -1){
            cout << -1 << "\n";
        }
        else{
            cout << max(row_col, col_row) << "\n";
        }
    }
 
    return 0;
}

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