Hypyt

input/code.cpp: In function 'void getNums(std::string, int**, uint)':
input/code.cpp:19:41: warning: comparison of integer expressions of different signedness: 'uint' {aka 'unsigned int'} and 'int' [-Wsign-compare]
   19 |   while (getline(iss, s, ' ') && vcount != ccount) {
      |                                  ~~~~~~~^~~~~~~~~

#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <sys/types.h>
#include <unordered_set>

#define MONS 65535
#define UNIN 65534
#define uin uint8_t

void getNums(const std::string in, int **values, uint vcount) {
  int ccount = 0;
  std::istringstream iss(in);
  std::string s;
  while (getline(iss, s, ' ') && vcount != ccount) {
    *values[ccount] = std::stoi(s);
    ccount++;
  }
}

struct ivec2 {
  uint16_t x, y = 0;
  ivec2(int x, int y) : x(x), y(y) {}
  ivec2() {}
  ivec2 operator+(const ivec2 &other) const {
    return ivec2(x + other.x, y + other.y);
  }
  ivec2 operator*(const int &value) const {
    return ivec2(x * value, y * value);
  }
  ivec2 operator/(const int &value) const {
    return ivec2(x / value, y / value);
  }
  friend std::ostream &operator<<(std::ostream &os, const ivec2 &v) {
    return os << "(" << v.x << ", " << v.y << ")";
  }

  bool operator<(const ivec2 &other) const {
    return (x < other.x) || (x == other.x && y < other.y);
  }
  bool operator>(const ivec2 &other) const {
    return (x > other.x) || (x == other.x && y > other.y);
  }
  bool operator<=(const ivec2 &other) const {
    return *this < other || *this == other;
  }
  bool operator>=(const ivec2 &other) const {
    return *this > other || *this == other;
  }
  bool operator==(const ivec2 &other) const {
    return (x == other.x && y == other.y) ? true : false;
  }
};

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

  int w, h, c, z;
  int **vals;
  vals = new int *[4];
  vals[0] = &h;
  vals[1] = &w;
  vals[2] = &c;
  vals[3] = &z;

  std::string line;

  std::getline(std::cin, line);
  getNums(line, vals, 3);

  std::map<uint8_t, std::set<uint8_t>> xopt, yopt;

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

  std::map<ivec2, std::map<ivec2, int16_t>> distances;

  auto solve = [&](uin sx, uin sy, uin dx, uin dy) {
#define SOLUTION 0;
    if (dx == sx && dy == sy)
      return 0;
    else if (dx == sx || dy == sy)
      return 1;

    std::unordered_set<uint8_t> vx, vy;
    std::set<ivec2> nindices;
    std::set<ivec2> cindices;
    nindices.insert({dx, dy});
    int step = 1;

    while (!nindices.empty()) {
      cindices = std::move(nindices);

      for (auto p : cindices) {
        for (auto xpos : xopt[p.y]) {
          if (vx.count(xpos))
            continue;
          if (xpos == sx) {
            return step + 1;
          }
          nindices.insert({xpos, p.y});
        }

        for (auto ypos : yopt[p.x]) {
          if (vy.count(ypos))
            continue;
          if (ypos == sy) {
            return step + 1;
          }
          nindices.insert({p.x, ypos});
        }
        // yopt.erase(p.x);
        vx.insert(p.x);
        vy.insert(p.y);
      }
      cindices.clear();
      step++;
    }

    return -1;
  };

  for (auto list : xopt) {
    uin ypos = list.first;
    for (auto xpos : list.second) {
      ivec2 fpos(xpos, ypos);

      for (auto list2 : xopt) {
        uin ypos2 = list2.first;
        for (auto xpos2 : list2.second) {
          ivec2 npos(xpos2, ypos2);
          if (npos == fpos)
	    continue;
	  distances[fpos][npos]=solve(fpos.x, fpos.y, npos.x, npos.y);
        }
      }
    }
  }

  std::cout << distances.size() << " \n";
  for (int i = 0; std::getline(std::cin, line); i++) {
    getNums(line, vals, 4);

    std::cout << distances[ivec2(w - 1, h - 1)][ivec2(z - 1, c - 1)] << "\n"; /// INCREDIBLE OPTIMIZATION!!!! THIS'LL SURELY PASS :)
    // std::cout << grid.solve(w - 1, h - 1, z - 1, c - 1) << "\n";
  }
}

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

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: TIME LIMIT EXCEEDED

Test 7

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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: WRONG ANSWER

Test 23

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 24

Group: 5

Verdict: WRONG ANSWER

Test 25

Group: 5

Verdict: WRONG ANSWER

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: WRONG ANSWER