Hypyt

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

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

char grid[250][251];
int visited[250][250];
int n, m, q;

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

int bfs(int sy, int sx, int ty, int tx) {
    if (sy == ty && sx == tx) return 0;
    Node queue[250 * 250];
    int front = 0, back = 0;


    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            visited[i][j] = 0;

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

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


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


        for (int y = 0; y < n; y++) {
            if (grid[y][cur.x] == '.' && !visited[y][cur.x]) {
                visited[y][cur.x] = 1;
                queue[back++] = (Node){y, cur.x, cur.d + 1};
                if (y == ty && cur.x == tx) return 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]);

    int Q = q;
    int results[Q];

    for (int i = 0; i < Q; i++) {
        int y1, x1, y2, x2;
        scanf("%d %d %d %d", &y1, &x1, &y2, &x2);
        y1--; x1--; y2--; x2--;

        results[i] = bfs(y1, x1, y2, x2);
    }


    for (int i = 0; i < Q; i++) {
        printf("%d\n", results[i]);
    }

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

Test 25

Group: 5

Verdict: ACCEPTED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: ACCEPTED