Hypyt

input/code.cpp: In function 'int main()':
input/code.cpp:73:41: warning: comparison of integer expressions of different signedness: 'long unsigned int' and 'int' [-Wsign-compare]
   73 |           if(o[l.first][l.second].first == -1)

#include <bits/stdc++.h>
using namespace std;
vector<vector<char>> t;
vector<vector<vector<pair<size_t, size_t>>>> p;
size_t n, m, q;
vector<vector<int>> g;
vector<vector<int>> z;
void dfs(size_t i, size_t j, int gi)
{
  if(z[i][j] || t[i][j] == '*') return;
  z[i][j] = 1;
  g[i][j] = gi;
  for(auto l : p[i][j]) dfs(l.first, l.second, gi);
}
int main()
{
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  cin >> n >> m >> q;
  t = vector<vector<char>>(n, vector<char>(m));
  for(size_t i {}; i < n; ++i)
    for(size_t j {}; j < m; ++j)
      cin >> t[i][j];
  p = vector<vector<vector<pair<size_t, size_t>>>>(n, vector<vector<pair<size_t, size_t>>>(m));
  for(size_t i {}; i < n; ++i)
    for(size_t j {}; j < m; ++j)
    {
      if(t[i][j] == '*') continue;
      for(size_t k = j + 1; k < m; ++k)
      {
        if(t[i][k] == '*') continue;
        p[i][j].emplace_back(i, k);
        p[i][k].emplace_back(i, j);
      }
    }
  for(size_t j {}; j < m; ++j)
    for(size_t i {}; i < n; ++i)
    {
      if(t[i][j] == '*') continue;
      for(size_t k = i + 1; k < n; ++k)
      {
        if(t[k][j] == '*') continue;
        p[i][j].emplace_back(k, j);
        p[k][j].emplace_back(i, j);
      }
    }
  z = vector<vector<int>>(n, vector<int>(m));
  g = vector<vector<int>>(n, vector<int>(m));
  int gi {};
  for(size_t i {}; i < n; ++i)
    for(size_t j {}; j < m; ++j)
      dfs(i, j, gi++);
  for(; q != 0; --q)
  {
    size_t y1, x1, y2, x2;
    cin >> y1 >> x1 >> y2 >> x2;
    --y1;
    --x1;
    --y2;
    --x2;
    if(g[y1][x1] != g[y2][x2]) cout << "-1\n";
    else if(y1 == y2 && x1 == x2) cout << "0\n";
    else
    {
      queue<pair<size_t, size_t>> w;
      vector<vector<pair<size_t, size_t>>> o(n, vector<pair<size_t, size_t>>(m, make_pair(-1, 0)));
      w.push(make_pair(y1, x1));
      while(!w.empty())
      {
        z[w.front().first][w.front().second] = 1;
        int f {};
        for(auto l : p[w.front().first][w.front().second])
          if(o[l.first][l.second].first == -1)
          {
            o[l.first][l.second] = make_pair(w.front().first, w.front().second);
            if(l.first == y2 && l.second == x2)
            {
              f = 1;
              break;
            }
            w.push(make_pair(l.first, l.second));
          }
        if(f) break;
        w.pop();
      }
      int a = 1;
      auto c = o[y2][x2];
      while(c.first != y1 || c.second != x1)
      {
        c = o[c.first][c.second];
        ++a;
      }
      cout << a << '\n';
    }
  }
}

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

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: ACCEPTED