Hypyt

input/code.cpp: In function 'int bfs(int, int, Node, Node)':
input/code.cpp:28:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for(int c=0; c<current_node->connections.size(); c++){
      |                      ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
 
using namespace std;
 
struct Node{
    int x;
    int y;
    vector<Node *> connections;
};
 
int bfs(int n, int m, Node start_node, Node end_node){
    unordered_set<int> visited;
    
    queue<pair<Node*, int>> q; // {Node, move_count}
    q.push({&start_node, 0});
    
    while (q.size() > 0){
        Node* current_node = q.front().first;
        int move_count = q.front().second;
        q.pop();
        int current_node_id = current_node->x + current_node->y*m;
        
        if(current_node->x == end_node.x && current_node->y == end_node.y){
            return move_count;
        }
        
        visited.insert(current_node_id);
        for(int c=0; c<current_node->connections.size(); c++){
            int v = (*current_node->connections[c]).x + (*current_node->connections[c]).y * m;
            
            if(visited.find(v) == visited.end()){
                q.push({current_node->connections[c], move_count+1});
                visited.insert(v);
            }
        }
    }
    
    return -1;
}
 
int main() {
   
    int n, m, q;
    cin >> n >> m >> q;
   
    vector<vector<Node>> nodes(n, vector<Node>(m, {-1, -1, {}}));
    
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            char val;
            cin >> val;
            if(val == '*') continue;
            Node node = {j, i};
            nodes[i][j] = node;
        }
    }
 
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            if(nodes[i][j].x == -1) continue;
            // Find connections in this row
            for(int j_2=0; j_2 < m; j_2++){
                if(j_2 == j) continue;
                if(nodes[i][j_2].x == -1) continue;
                nodes[i][j].connections.push_back(&nodes[i][j_2]);
 
            }
            // Find connections in this column
            for(int i_2=0; i_2 < n; i_2++){
                if(i_2 == i) continue;
                if(nodes[i_2][j].x == -1) continue;
                nodes[i][j].connections.push_back(&nodes[i_2][j]);
            }
        }
    }
    
    vector<pair<pair<int, int>, pair<int, int>>> tasks;
    for(int i=0; i < q; i++){
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2;
        tasks.push_back({{x1-1, y1-1}, {x2-1, y2-1}});
    }
 
    vector<int> results;
    for(int i=0; i<q; i++){
        Node start_node = nodes[tasks[i].first.second][tasks[i].first.first];
        Node end_node = nodes[tasks[i].second.second][tasks[i].second.first];
        results.push_back(bfs(n, m, start_node, end_node));
    }
    
    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: ACCEPTED