Hypyt

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

int bfs(int n, int m, vector<vector<char>> grid, pair<int, int> p1, pair<int, int> p2){
    bool visited[n][m];
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            visited[i][j] = false;
        }
    }
    
    queue<pair<pair<int, int>, int>> q; // {point, move_count}
    q.push({p1, 0});
    

    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;
        }
        
        visited[current_point.second][current_point.first] = true;
        
        for(int x=0; x<m; x++){
            if(!visited[current_point.second][x] && grid[current_point.second][x] != '*'){
                q.push({{x, current_point.second}, move_count+1});
            }
        }
        for(int y=0; y<n; y++){
            if(!visited[y][current_point.first] && grid[y][current_point.first] != '*'){
                q.push({{current_point.first, y}, move_count+1});
            }
        }
    }
    
    return -1;
}

int main() {
   
    int n, m, q;
    cin >> n >> m >> q;
   
    vector<vector<char>> grid(n, vector<char>(m, 0));
    vector<pair<pair<int, int>, pair<int, int>>> points;
    
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            cin >> grid[i][j];
        }
    }
    for(int i=0; i < q; i++){
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2;
        points.push_back({{x1-1, y1-1}, {x2-1, y2-1}});
    }
    
    vector<int> results;
    for(int i=0; i<q; i++){
        results.push_back(bfs(n, m, grid, points[i].first, points[i].second));
    }
    
    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: 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: TIME LIMIT EXCEEDED