Hypyt

input/code.cpp: In function 'int main()':
input/code.cpp:43:14: warning: comparison of integer expressions of different signedness: 'uint' {aka 'unsigned int'} and 'int' [-Wsign-compare]
   43 |       if (tn < h) {
      |           ~~~^~~
input/code.cpp:45:44: warning: comparison of integer expressions of different signedness: 'uint' {aka 'unsigned int'} and 'int' [-Wsign-compare]
   45 |         for (uin fi = tr._Find_first(); fi < w; fi = tr._Find_next(fi)) {
      |                                         ~~~^~~
input/code.cpp:54:44: warning: comparison of integer expressions of different signedness: 'uint' {aka 'unsigned int'} and 'int' [-Wsign-compare]
   54 |         for (uin fi = tr._Find_first(); fi < h; fi = tr._Find_next(fi)) {
      |                                         ~~~^~~

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

#define row bitset<250>
#define uin uint

static int h, w, qc;
static std::array<std::bitset<250>, 250> xopt, yopt;

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);

  cin >> h >> w >> qc;

  string line;
  getline(cin, line);

  for (int y = 0; y < h && std::getline(cin, line); y++) {
    if (line.size() == 0)
      continue;
    for (int x = 0; x < w; x++) {
      if (line[x] == 46) {
        xopt[y][x] = 1;
        yopt[x][y] = 1;
      }
    }
  }

  array<array<uint, 500>, 500> dist;
  for (auto &r : dist)
    r.fill(500);

  for (int sn = 0; sn < w + h; sn++) {
    dist[sn][sn] = 0;
    queue<uin> nq;
    nq.push(sn);

    while (!nq.empty()) {
      uin tn = nq.front();
      nq.pop();
      if (tn < h) {
        auto &tr = xopt[tn];
        for (uin fi = tr._Find_first(); fi < w; fi = tr._Find_next(fi)) {
          uin nn = h + fi;
          if (dist[sn][nn] == 500) {
            dist[sn][nn] = dist[sn][tn] + 1;
            nq.push(nn);
          }
        }
      } else {
        auto &tr = yopt[tn - h];
        for (uin fi = tr._Find_first(); fi < h; fi = tr._Find_next(fi)) {
          if (dist[sn][fi] == 500) {
            dist[sn][fi] = dist[sn][tn] + 1;
            nq.push(fi);
          }
        }
      }
    }
  }

  int sx, sy, dx, dy;
  for (int i = 0; i < qc; i++) {
    cin >> sy >> sx >> dy >> dx;
    sx--;
    sy--;
    dx--;
    dy--;

    if (sx == dx || sy == dy) {
      if (sx == dx && sy == dy) {
        std::cout << 0 << "\n";
	continue;
      }
      std::cout << 1 << "\n";
      continue;
    }

    int cs = 500;
    if (int s = dist[sy][dy]; s < cs)
      cs = s;
    if (int s = dist[sy][dx+h]; s < cs)
      cs=s;
    if (int s = dist[sx+h][dx+h]; s < cs)
      cs=s;
    if (int s = dist[sx+h][dy]; s < cs)
      cs=s;
    if (cs == 500) {
      std::cout << -1 << "\n";
      continue;
    }
    std::cout << cs+1 << "\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: ACCEPTED

Test 10

Group: 3, 4, 5

Verdict: ACCEPTED

Test 11

Group: 3, 4, 5

Verdict: ACCEPTED

Test 12

Group: 4, 5

Verdict: ACCEPTED

Test 13

Group: 4, 5

Verdict: ACCEPTED

Test 14

Group: 4, 5

Verdict: ACCEPTED

Test 15

Group: 5

Verdict: ACCEPTED

Test 16

Group: 5

Verdict: ACCEPTED

Test 17

Group: 5

Verdict: ACCEPTED

Test 18

Group: 5

Verdict: ACCEPTED

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

Test 27

Group: 5

Verdict: ACCEPTED