Hypyt

input/code.cpp: In function 'int bfs(int, int, Node, Node)':
input/code.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int c=0; c<current_node.connections.size(); c++){
      |                      ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:56:59: error: no matching function for call to 'std::vector<Node>::vector(int&, <brace-enclosed initializer list>)'
   56 |     vector<vector<Node>> nodes(n, vector<Node>(m, {-1, -1}));
      |                                                           ^
In file included from /usr/include/c++/11/vector:67,
                 from /usr/include/c++/11/queue:61,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:86,
                 from input/code.cpp:1:
/usr/include/c++/11/bits/stl_vector.h:653:9: note: candidate: 'template<class _InputIterator, clas...

#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){
    bool visited[n][m];
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            visited[i][j] = false;
        }
    }
    
    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();
        
        visited[current_node.y][current_node.x] = true;
        //cout << current_node.x << " " << current_node.y << " Connections:" << current_node.connections.size() << "\n";
        //for(int i=0; i < n; i++){
        //    for(int j=0; j < m; j++){
        //        cout << visited[i][j];
        //    }
        //    cout << "\n";
        //}
        if(current_node.x == end_node.x && current_node.y == end_node.y){
            return move_count;
        }
        
        for(int c=0; c<current_node.connections.size(); c++){
            Node connection_node = *current_node.connections[c];
            if(!visited[connection_node.y][connection_node.x]){
                q.push({connection_node, move_count+1});
                visited[connection_node.y][connection_node.x] = true;
            }
        }
    }
    
    return -1;
}

int main() {
   
    int n, m, q;
    cin >> n >> m >> q;
   
    vector<vector<Node>> nodes(n, vector<Node>(m, {-1, -1}));
    vector<pair<pair<int, int>, pair<int, int>>> tasks;
    
    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]);
            }
        }
    }
    
    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;
}