Hypyt

input/code.c: In function 'main':
input/code.c:55:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     scanf("%d %d %d", &n, &m, &q);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:57:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         scanf("%s", grid[i]);
      |         ^~~~~~~~~~~~~~~~~~~~
input/code.c:62:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         scanf("%d %d %d %d", &y1, &x1, &y2, &x2);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAXN 250
#define MAXM 250
#define MAXQ 200000

char grid[MAXN][MAXM + 1];
int visited[MAXN][MAXM];
int n, m, q;

typedef struct {
    int y, x, d;
} Node;

Node queue[MAXN * MAXM];
int front, back;

int bfs(int sy, int sx, int ty, int tx) {
    if (sy == ty && sx == tx) return 0;

    memset(visited, 0, sizeof(visited));
    front = back = 0;

    queue[back++] = (Node){sy, sx, 0};
    visited[sy][sx] = 1;

    while (front < back) {
        Node cur = queue[front++];

        // Move along row
        for (int j = 0; j < m; j++) {
            if (grid[cur.y][j] == '.' && !visited[cur.y][j]) {
                if (cur.y == ty && j == tx) return cur.d + 1;
                visited[cur.y][j] = 1;
                queue[back++] = (Node){cur.y, j, cur.d + 1};
            }
        }

        // Move along column
        for (int i = 0; i < n; i++) {
            if (grid[i][cur.x] == '.' && !visited[i][cur.x]) {
                if (i == ty && cur.x == tx) return cur.d + 1;
                visited[i][cur.x] = 1;
                queue[back++] = (Node){i, cur.x, cur.d + 1};
            }
        }
    }

    return -1;
}

int main() {
    scanf("%d %d %d", &n, &m, &q);
    for (int i = 0; i < n; i++) {
        scanf("%s", grid[i]);
    }

    while (q--) {
        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;
        }

        int dist = bfs(y1, x1, y2, x2);
        printf("%d\n", dist);
    }

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