Hypyt

input/code.cpp: In function 'std::unordered_map<int, int> bfs(int, int, std::vector<std::vector<Node> >&, std::vector<std::vector<Node> >&, Node&)':
input/code.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             for(int c=0; c<rows[current.pos.second].size(); c++){
      |                          ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:51:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |             for(int c=0; c<columns[current.pos.first].size(); c++){
      |                          ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
 
struct Node {
  char type; // n = cell, r = row, c = column
  pair<int, int> pos;
};
 
int id(Node& node, int n, int m){
    if(node.type == 'r'){
        return n*m+node.pos.second;
    }
    else if(node.type == 'c'){
        return n*m+n+node.pos.first;
    }
    else{
        return m*node.pos.second+node.pos.first;
    }
}
 
unordered_map<int, int> bfs(int n, int m, vector<vector<Node>>& rows, vector<vector<Node>>& columns, Node& start){
    vector<bool> visited (n*m+n+m, false);
    
    queue<pair<Node, int>> q; // {current, move_count}
    q.push({start, 0});
 
    visited[id(start, n, m)] = true;
    
    unordered_map<int, int> table;
    
    while (q.size() > 0){
        Node current = q.front().first;
        int move_count = q.front().second;
        q.pop();
        
 
        if(current.type == 'r'){
            table[id(current, n, m)] = move_count+1;
            
            for(int c=0; c<rows[current.pos.second].size(); c++){
                Node v = rows[current.pos.second][c];
                
                if(!visited[id(v, n, m)]){
                    q.push({v, move_count+1});
                    visited[id(v, n, m)] = true;
                }
            }
        }
        if(current.type == 'c'){
            table[id(current, n, m)] = move_count+1;
            for(int c=0; c<columns[current.pos.first].size(); c++){
                Node v = columns[current.pos.first][c];
                
                if(!visited[id(v, n, m)]){
                    q.push({v, move_count+1});
                    visited[id(v, n, m)] = true;
                }
            }
        }
        if(current.type == 'n'){
            Node row = {'r', {-1, current.pos.second}};
            if(!visited[id(row, n, m)]){
                q.push({row, move_count});
                visited[id(row, n, m)] = true;
            }
 
            Node column = {'c', {current.pos.first, -1}};
            if(!visited[id(column, n, m)]){
                q.push({column, move_count});
                visited[id(column, n, m)] = true;
            }
        }
 
    }
 
    return table;
}
 
int main() {
    ios_base::sync_with_stdio (false);
    cin.tie(NULL);
    
    int n, m, q;
    cin >> n >> m >> q;
   
    vector<vector<char>> grid(n, vector<char>(m, 0));
    
    vector<vector<Node>> rows;
    vector<vector<Node>> columns;
    
    for(int i=0; i < n; i++){
        vector<Node> row = {};
        for(int j=0; j < m; j++){
            cin >> grid[i][j];
            if(grid[i][j] == '*') continue;
            Node node = {'n', {j, i}};
            row.push_back(node);
        }
        rows.push_back(row);
    }
 
    for(int j=0; j < m; j++){
        vector<Node> column = {};
        for(int i=0; i < n; i++){
            if(grid[i][j] == '*') continue;
            Node node = {'n', {j, i}};
            column.push_back(node);
        }
        columns.push_back(column);
    }
    

    vector<unordered_map<int, int>> table(n+m);
    for(int i=0; i < n; i++){
        Node start_row = {'r', {-1, i}};
        table[i] = bfs(n, m, rows, columns, start_row);
    }
    for(int j=0; j < m; j++){
        Node start_col = {'c', {j, -1}};
        table[n+j] = bfs(n, m, rows, columns, start_col);
    }
 
    
    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 p1 = table[y1-1][n*m+(y2-1)];
        if(p1 == 0){
            cout << -1 << "\n";
            continue;
        }
        
        int p2 = table[y1-1][n*m+n+(x2-1)];
        if(p2 == 0){
            cout << -1 << "\n";
            continue;
        }
        
        int p3 = table[n+(x1-1)][n*m+(y2-1)];
        if(p3 == 0){
            cout << -1 << "\n";
            continue;
        }
        
        int p4 = table[n+(x1-1)][n*m+n+(x2-1)];
        if(p4 == 0){
            cout << -1 << "\n";
            continue;
        }

        cout << min(min(p1, p2), min(p3, p4)) << "\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: ACCEPTED

Test 7

Group: 2, 5

Verdict: ACCEPTED

Test 8

Group: 2, 5

Verdict: ACCEPTED

Test 9

Group: 3, 4, 5

Verdict: ACCEPTED

Test 10

Group: 3, 4, 5

Verdict: ACCEPTED

Test 11

Group: 3, 4, 5

Verdict: ACCEPTED

Test 12

Group: 4, 5

Verdict: ACCEPTED

Test 13

Group: 4, 5

Verdict: ACCEPTED

Test 14

Group: 4, 5

Verdict: ACCEPTED

Test 15

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 5

Verdict: ACCEPTED

Test 17

Group: 5

Verdict: ACCEPTED

Test 18

Group: 5

Verdict: ACCEPTED

Test 19

Group: 5

Verdict: ACCEPTED

Test 20

Group: 5

Verdict: ACCEPTED

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

Test 27

Group: 5

Verdict: ACCEPTED