Hypyt

input/code.c: In function 'main':
input/code.c:40:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     scanf("%d %d %d", &n, &m, &q);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:41:33: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     for (int i = 0; i < n; i++) scanf("%s", grid[i]);
      |                                 ^~~~~~~~~~~~~~~~~~~~
input/code.c:44:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf("%d %d %d %d", &y1, &x1, &y2, &x2);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <stdio.h>
#include <string.h>
#define MAXN 251
#define MAXM 251
int n, m, q;
char grid[MAXN][MAXM];
int dist[MAXN][MAXM], vis[MAXN][MAXM];
int quey[MAXN*MAXM], quex[MAXN*MAXM], qs, qe;
void bfs(int sy, int sx, int ey, int ex) {
    memset(dist, -1, sizeof(dist));
    memset(vis, 0, sizeof(vis));
    qs = qe = 0;
    dist[sy][sx] = 0;
    vis[sy][sx] = 1;
    quey[qe] = sy;
    quex[qe++] = sx;
    while (qs < qe) {
        int y = quey[qs];
        int x = quex[qs++];
        if (y == ey && x == ex) return;
        for (int i = 0; i < m; i++) {
            if (!vis[y][i] && grid[y][i] == '.') {
                vis[y][i] = 1;
                dist[y][i] = dist[y][x] + 1;
                quey[qe] = y;
                quex[qe++] = i;
            }
        }
        for (int i = 0; i < n; i++) {
            if (!vis[i][x] && grid[i][x] == '.') {
                vis[i][x] = 1;
                dist[i][x] = dist[y][x] + 1;
                quey[qe] = i;
                quex[qe++] = x;
            }
        }
    }
}
int main() {
    scanf("%d %d %d", &n, &m, &q);
    for (int i = 0; i < n; i++) scanf("%s", grid[i]);
    for (int k = 0; k < q; k++) {
        int y1, x1, y2, x2;
        scanf("%d %d %d %d", &y1, &x1, &y2, &x2);
        y1--; x1--; y2--; x2--;
        if (grid[y1][x1] != '.' || grid[y2][x2] != '.') {
            printf("-1\n");
            continue;
        }
        if (y1 == y2 && x1 == x2) {
            printf("0\n");
            continue;
        }
        bfs(y1, x1, y2, x2);
        printf("%d\n", dist[y2][x2]);
    }
    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