Hypyt

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

/*ver 2.0 : virtual row nodes*/
#include <bits/stdc++.h>
using namespace std;

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

bool grid[N][N];

struct Edge;
struct Node{//Node
    int x,y;
    vector<Edge>ed;
};
struct Edge{//Edge
    Node*to;
    int w;
};
struct State{//State
    Node*node;
    Node*last;
    int d;
    bool operator>(const State&s)const{return d>s.d;}
};

Node nd[N][N]; //Basic Nodes
int dst[N][N];//Distance
bool vis[N][N];
bool adj[N][N];

const int INF=0x3f3f3f;

int Dijkstra(int x1,int y1,int x2,int y2){
    memset(dst,0x3f3f3f,sizeof(dst));
    memset(vis,0,sizeof(vis));
    priority_queue<State,vector<State>,greater<State> >Q;
    Q.push({&nd[x1][y1],NULL,0});
    dst[x1][y1]=0;
    while(!Q.empty()){
        State now=Q.top();
        Q.pop();
        int x=now.node->x,y=now.node->y;
        if(vis[x][y])continue;
        // cout<<x<<" "<<y<<endl;
        vis[x][y]=true;
        if(x==x2&&y==0){
            int res=now.d;
            if(grid[x2][y2]&&grid[now.last->x][y2])return res;
            else return res+1;
        }
        for(int i=0;i<now.node->ed.size();++i){
            Node *to=now.node->ed[i].to;
            int nx=to->x,ny=to->y;
            if(vis[nx][ny])continue;
            Q.push({to,now.node,now.d+now.node->ed[i].w});
        }
    }
    return -1;
}

int main(){
    cin>>n>>m>>q;
    char tmpchar;
    for(int i=1;i<=n;++i){
        nd[i][0].x=i;
        nd[i][0].y=0;
        for(int j=1;j<=m;++j){
            cin>>tmpchar;
            if(tmpchar=='.'){
                grid[i][j]=1;
                nd[i][j].x=i;
                nd[i][j].y=j;
                nd[i][j].ed.push_back({&nd[i][0],0});
            }else grid[i][j]=0;
        }//Init grid
    }
    for(int i=1;i<=n;++i)
        for(int j=1;j<i;++j){
            for(int k=1;k<=m;++k){
                if(grid[i][k]&&grid[j][k]){
                    adj[i][j]=true;
                    adj[j][i]=true;
                    nd[i][k].ed.push_back({&nd[j][0],1});
                    nd[j][k].ed.push_back({&nd[i][0],1});
                }
            }
            if(adj[i][j]){
                nd[i][0].ed.push_back({&nd[j][0],2});
                nd[j][0].ed.push_back({&nd[i][0],2});
            }
        }
    //Basic Node +1 jump = Row Node (forall).
    for(int i=1;i<=q;++i){//Queries
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        if(x1==x2&&y1==y2){
            cout<<0<<endl;
            continue;
        }
        else if(x1==x2||y1==y2){
            cout<<1<<endl;
            continue;
        }
        else if (grid[x1][y2]||grid[x2][y1]){
            cout<<2<<endl;
            continue;
        }
        cout<<Dijkstra(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: ACCEPTED

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

Test 27

Group: 5

Verdict: ACCEPTED