Hypyt

input/code.cpp: In function 'long long int bfs(long long int, long long int, long long int, long long int, std::vector<std::vector<char> >&, std::vector<std::unordered_set<int> >&, std::vector<std::unordered_set<int> >&)':
input/code.cpp:33:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   33 |         auto [cy, cx] = q.front();
      |              ^

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

#define fastio               \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define ll long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x).size()

const int MOD = 1e9 + 7;
const ll INF = 1e18;

ll y;
ll x;

ll bfs(ll y1, ll x1, ll y2, ll x2, vector<vector<char> > &grid, vector<unordered_set<int> > &unvisited_x, vector<unordered_set<int> > &unvisited_y)
{
    queue<pair<int, int> > q;
    q.push(make_pair(y2, x2));

    unvisited_x[x2].erase(y2);
    unvisited_y[y2].erase(x2);

    vector<vector<int> > dist(y + 1, vector<int>(x + 1, -1));
    dist[y2][x2] = 0;

    while (!q.empty())
    {
        auto [cy, cx] = q.front();
        q.pop();

        if (cy == y1 && cx == x1)
        {
            return dist[cy][cx];
        }
        vector<int> to_remove_y;
        for (ll y_test : unvisited_x[cx])
        {
            if (grid[y_test][cx] == '.' && dist[y_test][cx] == -1)
            {
                dist[y_test][cx] = dist[cy][cx] + 1;
                q.push(make_pair(y_test, cx));
                to_remove_y.push_back(y_test);

                if (grid[y_test][cx] == '#') {
                    to_remove_y.push_back(y_test);
                }
            }
        }
        for (ll t : to_remove_y)
            unvisited_x[cx].erase(t);

        vector<int> to_remove_x;
        for (ll x_test : unvisited_y[cy])
        {
            if (grid[cy][x_test] == '.' && dist[cy][x_test] == -1)
            {
                dist[cy][x_test] = dist[cy][cx] + 1;
                q.push(make_pair(cy, x_test));
                to_remove_x.push_back(x_test);
            }
            if (grid[cy][x_test] == '#') {
                to_remove_x.push_back(x_test);
            }
        }
        for (ll t : to_remove_x)
            unvisited_y[cy].erase(t);
    }

    return -1; 
}

int main()
{
    fastio
        ll q;
    cin >> y >> x >> q;

    vector<vector<char> > grid(y + 1, vector<char>(x + 1));
    for (ll i = 0; i < y; i++)
    {
        for (ll j = 0; j < x; j++)
        {
            cin >> grid[i][j];
        }
    }

    for (ll i = 0; i < q; i++)
    {
        vector<unordered_set<int> > unvisited_x(x + 1);
        vector<unordered_set<int> > unvisited_y(y + 1);

        for (int i = 0; i <= x; i++)
            for (int j = 0; j <= y; j++)
                unvisited_x[i].insert(j);

        for (int j = 0; j <= y; j++)
            for (int i = 0; i <= x; i++)
                unvisited_y[j].insert(i);

        ll y1, x1, y2, x2;
        cin >> y1 >> x1 >> y2 >> x2;
        y1--;
        x1--;
        y2--;
        x2--;

        if (y1 == y2 && x1 == x2)
        {
            cout << 0 << "\n";
        }
        else
        {
            ll res = bfs(y1, x1, y2, x2, grid, unvisited_x, unvisited_y);

            cout << res << " ";
        }
    }
}

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