Hypyt

input/code.cpp: In member function 'std::pair<bool, std::vector<Space*> > Space::checkHorizontal(int, int, int)':
input/code.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Space*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < horizontal.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~
input/code.cpp: In member function 'std::pair<bool, std::vector<Space*> > Space::checkVertical(int, int, int)':
input/code.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Space*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0; i < vertical.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:71:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Space*>::size_type' {aka 'long unsigned int'} [-Wsign-c...

#include <iostream>
#include <string>
#include <vector>
#include <utility>
using namespace std;

struct Space {
  int posX, posY;
  vector<Space*> horizontal;
  vector<Space*> vertical;
  int lastChecked = -1;

  Space(int x, int y) {
    posX = x;
    posY = y;
  }

  void addHorizontal(Space* s) {
    horizontal.push_back(s);
  }

  void addVertical(Space* s) {
    vertical.push_back(s);
  }

  pair<bool, vector<Space*>> checkHorizontal(int x, int y, int check) {
    // put output to vertical list thing and other schenanigans; shoud work better than that ugly recursion.
    vector<Space*> targetList;
    if (posX == x && posY == y) {
      return {true, targetList};
    }
    for (int i = 0; i < horizontal.size(); i++) {
      if (horizontal[i]->lastChecked == check) continue;
      horizontal[i]->lastChecked = check;
      targetList.push_back(horizontal[i]);
    }
    return {false, targetList};
  }

  pair<bool, vector<Space*>> checkVertical(int x, int y, int check) {
    vector<Space*> targetList;
    if (posX == x && posY == y) {
      return {true, targetList};
    }
    for (int i = 0; i < vertical.size(); i++) {
      if (vertical[i]->lastChecked == check) continue;
      vertical[i]->lastChecked = check;
      targetList.push_back(vertical[i]);
    }
    return {false, targetList};
  }
};

int main() {
  // freopen("input.txt", "r", stdin);
  int n, m, q;
  cin >> n >> m >> q;

  Space* spaces[250][250];
  vector<Space*>* columns = new vector<Space*>[m];
  for (int i = 0; i < n; i++) {
    string row;
    cin >> row;
    
    vector<Space*> rowSpaces;
    for (int j = 0; j < m; j++) {
      if (row[j] != '.') continue;
      Space* newSpace = new Space(i, j);
      spaces[i][j] = newSpace;

      for (int k = 0; k < rowSpaces.size(); k++) {
        rowSpaces[k]->addHorizontal(newSpace);
        newSpace->addHorizontal(rowSpaces[k]);
      }
      rowSpaces.push_back(newSpace);

      for (int k = 0; k < columns[j].size(); k++) {
        columns[j][k]->addVertical(newSpace);
        newSpace->addVertical(columns[j][k]);
      }
      columns[j].push_back(newSpace);
    }
  }

  int* results = new int[q];
  for (int i = 0; i < q; i++) {
    int y1, x1, y2, x2;
    cin >> y1 >> x1 >> y2 >> x2;
    --y1; --x1;
    --y2; --x2;

    vector<Space*> toCheckX = {spaces[y1][x1]};
    vector<Space*> toCheckY = {spaces[y1][x1]};
    bool found = false;
    int steps = 0;
    while (toCheckX.size() > 0 || toCheckY.size() > 0) {
      vector<Space*> newCheckX = toCheckX;
      vector<Space*> newCheckY = toCheckY;
      toCheckX.clear();
      toCheckY.clear();
      for (int j = 0; j < newCheckX.size(); j++) {
        pair<bool, vector<Space*>> result = newCheckX[j]->checkHorizontal(y2, x2, i);
        if (result.first) {
          found = true;
          break;
        }
        toCheckY = result.second;
      }
      if (found) break;
      // if (newCheckY.size() == 0) break;
      for (int j = 0; j < newCheckY.size(); j++) {
        pair<bool, vector<Space*>> result = newCheckY[j]->checkVertical(y2, x2, i);
        if (result.first) {
          found = true;
          break;
        }
        toCheckX = result.second;
      }
      if (found) break;
      ++steps;
    }
    results[i] = found ? steps : -1;
  }

  for (int i = 0; i < q; i++) {
    cout << results[i] << '\n';
  }

  return 0;
}

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 6

Group: 2, 5

Verdict: WRONG ANSWER

Test 7

Group: 2, 5

Verdict: WRONG ANSWER

Test 8

Group: 2, 5

Verdict: WRONG ANSWER

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

Test 25

Group: 5

Verdict: ACCEPTED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: ACCEPTED