Hypyt

input/code.c: In function 'main':
input/code.c:10:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d%d%d",&n,&m,&q);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:11:26: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for(int i=0;i<n;i++) scanf("%s",grid[i]);
      |                          ^~~~~~~~~~~~~~~~~~~
input/code.c:14:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         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],visit[MAXN][MAXM];
int quey[MAXN*MAXM],quex[MAXN*MAXM];
int main() {
    scanf("%d%d%d",&n,&m,&q);
    for(int i=0;i<n;i++) scanf("%s",grid[i]);
    for(int ti=0;ti<q;ti++) {
        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;
        }
        memset(dist,-1,sizeof(dist));
        memset(visit,0,sizeof(visit));
        int qs=0,qe=0;
        dist[y1][x1]=0;
        visit[y1][x1]=1;
        quey[qe]=y1; quex[qe++]=x1;

        while(qs<qe) {
            int cy=quey[qs],cx=quex[qs++];
            if(cy==y2 && cx==x2) break;
            for(int j=0;j<m;j++) {
                if(grid[cy][j]=='.'&&!visit[cy][j]) {
                    visit[cy][j]=1;
                    dist[cy][j]=dist[cy][cx]+1;
                    quey[qe]=cy; quex[qe++]=j;
                }
            }
            for(int i=0;i<n;i++) {
                if(grid[i][cx]=='.'&&!visit[i][cx]) {
                    visit[i][cx]=1;
                    dist[i][cx]=dist[cy][cx]+1;
                    quey[qe]=i; quex[qe++]=cx;
                }
            }
        }
        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