Hypyt

input/code.cpp: In function 'int main()':
input/code.cpp:87:25: warning: unused variable 'start' [-Wunused-variable]
   87 |                     int start = j;
      |                         ^~~~~
input/code.cpp:95:25: warning: unused variable 'end' [-Wunused-variable]
   95 |                     int end = j - 1;
      |                         ^~~
input/code.cpp:105:25: warning: unused variable 'start' [-Wunused-variable]
  105 |                     int start = i;
      |                         ^~~~~
input/code.cpp:113:25: warning: unused variable 'end' [-Wunused-variable]
  113 |                     int end = i - 1;
      |                         ^~~

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

struct Node { int y, x; };

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, q;
    cin >> n >> m >> q;
    vector<string> g(n);
    for (int i = 0; i < n; i++) cin >> g[i];

    // mikä tää on, en tiiä kiitä netin ihmettä
    vector<vector<int>> L(n, vector<int>(m)), R(n, vector<int>(m)), U(n, vector<int>(m)), D(n, vector<int>(m));

    for (int i = 0; i < n; i++) {
        int last = -1;
        for (int j = 0; j < m; j++) {
            if (g[i][j] == '*') last = -1;
            else {
                if (last == -1) last = j;
                L[i][j] = last;
            }
        }
        last = -1;
        for (int j = m - 1; j >= 0; j--) {
            if (g[i][j] == '*') last = -1;
            else {
                if (last == -1) last = j;
                R[i][j] = last;
            }
        }
    }
    for (int j = 0; j < m; j++) {
        int last = -1;
        for (int i = 0; i < n; i++) {
            if (g[i][j] == '*') last = -1;
            else {
                if (last == -1) last = i;
                U[i][j] = last;
            }
        }
        last = -1;
        for (int i = n - 1; i >= 0; i--) {
            if (g[i][j] == '*') last = -1;
            else {
                if (last == -1) last = i;
                D[i][j] = last;
            }
        }
    }

    vector<vector<int>> dist(n, vector<int>(m, -1));

    while (q--) {
        int y1, x1, y2, x2;
        cin >> y1 >> x1 >> y2 >> x2;
        --y1; --x1; --y2; --x2;

        if (g[y1][x1] == '*' || g[y2][x2] == '*') {
            cout << -1 << '\n';
            continue;
        }

        for (int i = 0; i < n; i++)
            fill(dist[i].begin(), dist[i].end(), -1);

        queue<Node> qu;
        qu.push({y1, x1});
        dist[y1][x1] = 0;
        vector<bool> rowDone(n, false), colDone(m, false);

        while (!qu.empty()) {
            auto [y, x] = qu.front(); qu.pop();
            int d = dist[y][x];

            if (y == y2 && x == x2) break;

            if (!rowDone[y]) {
                rowDone[y] = true;
                int j = 0;
                while (j < m) {
                    while (j < m && g[y][j] == '*') j++;
                    if (j >= m) break;
                    int start = j;
                    while (j < m && g[y][j] == '.') {
                        if (dist[y][j] == -1) {
                            dist[y][j] = d + 1;
                            qu.push({y, j});
                        }
                        j++;
                    }
                    int end = j - 1;
                }
            }

            if (!colDone[x]) {
                colDone[x] = true;
                int i = 0;
                while (i < n) {
                    while (i < n && g[i][x] == '*') i++;
                    if (i >= n) break;
                    int start = i;
                    while (i < n && g[i][x] == '.') {
                        if (dist[i][x] == -1) {
                            dist[i][x] = d + 1;
                            qu.push({i, x});
                        }
                        i++;
                    }
                    int end = i - 1;
                }
            }
        }

        cout << dist[y2][x2] << '\n';
    }
}

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: 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: ACCEPTED

Test 25

Group: 5

Verdict: ACCEPTED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: TIME LIMIT EXCEEDED