Hypyt

input/code.cpp: In function 'int query(int, int, int, int)':
input/code.cpp:40:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Pos>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         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];

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

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

struct Node{
    int x,y,tp;
};

int dst[2][N][N];

const int INF=250*250;

int query(int x1,int y1,int x2,int y2){
    memset(dst,0x3f3f3f,sizeof(dst));
    queue<Node>Q;
    Q.push({x1,y1,0});
    Q.push({x2,y2,1});
    dst[0][x1][y1]=0;
    dst[1][x2][y2]=0;
    while(!Q.empty()){
        Node now=Q.front();
        Q.pop();
        if(dst[1-now.tp][now.x][now.y]<=INF){
            return dst[1-now.tp][now.x][now.y]+dst[now.tp][now.x][now.y];
        }
        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;
            if(dst[now.tp][nx][ny]<=INF)continue;
            dst[now.tp][nx][ny]=dst[now.tp][now.x][now.y]+1;
            Q.push({nx,ny,now.tp});
        }
    }
    return -1;
}

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);
            }
            for(int k=1;k<j;++k){
                if(grid[i][k]=='.')addedge(i,j,i,k);
            }
        }
    }
    for(int i=1;i<=q;++i){
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        cout<<query(x1,y1,x2,y2)<<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: 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: TIME LIMIT EXCEEDED