Hypyt

input/code.cpp: In function 'void bfs(int, int)':
input/code.cpp:45:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int i=0;i<to[now.x][now.y].size();++i){
      |                     ~^~~~~~~~~~~~~~~~~~~~~~~~

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

const int N=255;
int n,m,q;

char grid[N][N];

int ans[200005];

struct Query{
    int x1,y1;
    int x2,y2;
    int id;
};

Query qe[200005];
bool cmp(const Query&q1,const Query&q2){
    return q1.x1<q2.x1||(q1.x1==q2.x1&&q1.y1<q2.y1);
}

struct Node{
    int x,y,tp;
};
vector<Node>to[N][N];

void addedge(int x1,int y1,int x2,int y2,int t){
    to[x1][y1].push_back({x2,y2,t});
    to[x2][y2].push_back({x1,y1,t});
}

const int INF=250*250;
int dst[N][N];
int cx,cy;

void bfs(int x,int y){
    memset(dst,0x4f4f4f,sizeof(dst));
    queue<Node>Q;
    dst[x][y]=0;
    Q.push(Node{x,y,0});
    Q.push(Node{x,y,1});
    while(!Q.empty()){
        Node now=Q.front();
        Q.pop();
        for(int i=0;i<to[now.x][now.y].size();++i){
            int nx=to[now.x][now.y][i].x;
            int ny=to[now.x][now.y][i].y;
            int tp=to[now.x][now.y][i].tp;
            if(dst[nx][ny]<=INF)continue;
            if(now.tp!=tp)continue;
            dst[nx][ny]=dst[now.x][now.y]+1;
            Q.push(Node{nx,ny,1-now.tp});
        }
    }
    // for(int i=1;i<=n;++i){
    //     for(int j=1;j<=m;++j){
    //         cout<<(dst[i][j]>INF?-1:dst[i][j])<<" ";
    //     }
    //     cout<<endl;
    // }
}

int main(){
    cin>>n>>m>>q;
    for(int i=1;i<=n;++i){
        for(int j=1;j<=m;++j){
            cin>>grid[i][j];
            if(grid[i][j]=='*')continue;
            for(int k=1;k<i;++k){
                if(grid[k][j]=='.')addedge(i,j,k,j,0);
            }
            for(int k=1;k<j;++k){
                if(grid[i][k]=='.')addedge(i,j,i,k,1);
            }
        }
    }
    for(int i=1;i<=q;++i){
        cin>>qe[i].x1>>qe[i].y1>>qe[i].x2>>qe[i].y2;
        if(qe[i].x1>qe[i].x2||(qe[i].x1==qe[i].x2&&qe[i].y1>qe[i].y2)){
            swap(qe[i].x1,qe[i].x2);
            swap(qe[i].y1,qe[i].y2);
        }
        qe[i].id=i;
    }
    sort(qe+1,qe+q+1,cmp);
    for(int i=1;i<=q;++i){
        int nx=qe[i].x1;
        int ny=qe[i].y1;
        // cout<<qe[i].id<<": "<<qe[i].x1<<","<<qe[i].y1<<" "<<qe[i].x2<<","<<qe[i].y2<<endl;
        if(qe[i].x1==qe[i].x2&&qe[i].y1==qe[i].y2){
            ans[qe[i].id]=0;
            continue;
        }
        if(nx!=cx||ny!=cy){
            cx=nx;
            cy=ny;
            bfs(nx,ny);
        }
        ans[qe[i].id]=dst[qe[i].x2][qe[i].y2];
    }
    for(int i=1;i<=q;++i)
        cout<<(ans[i]>INF?-1:ans[i])<<endl;
    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: ACCEPTED

Test 10

Group: 3, 4, 5

Verdict: ACCEPTED

Test 11

Group: 3, 4, 5

Verdict: ACCEPTED

Test 12

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4, 5

Verdict: ACCEPTED

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

Test 20

Group: 5

Verdict: ACCEPTED

Test 21

Group: 5

Verdict: ACCEPTED

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