Hypyt

#include <cstring>
#include <iostream>
#include <vector>
#include <chrono>

using namespace std;

using in = unsigned char;
using pi = pair<in, in>;

vector<in> *rows;
vector<in> *columns;
bool **checked;

int min;

// 127 ms
// 101 ms

bool find(vector<pi>& next, pi pos, pi end) {
    if (end.first == pos.first || end.second == pos.second) return false;

    if (checked[static_cast<int>(pos.second)][static_cast<int>(pos.first)]) return false;
    checked[static_cast<int>(pos.second)][static_cast<int>(pos.first)] = true;

    for (in x : rows[static_cast<int>(pos.second)]) {
        if (x == end.first) return 2;
        next.push_back({ x, pos.second });
    }

    for (in y : columns[static_cast<int>(pos.first)]) {
        if (y == end.second) return 2;
        next.push_back({ pos.first, y });
    }

    return false;
}

int search(pi start, pi end, int height, int width) {
    if (start.first == end.first && start.second == end.second) return 0;

    std::vector<pi> next{start};
    int depth = 0;

    for (int i = 0; i < height; i++) 
        memset((void*)checked[i], 0, width);

    while (next.size()) {
        std::vector<pi> copy;
        copy.reserve(next.size() * 4);

        for (pi pos : next) {
            int sus = find(copy, pos, end);
            if (sus) return depth + sus;
        }

        next = copy;
        depth++;
    }

    return -1;
}

int main(int argc, char *argv[]) {
    int height, width, count; cin >> height >> width >> count;

    rows = new vector<in>[height];
    columns = new vector<in>[width];
 
    for (int y = 0; y < height; y++) {
        for (int x = 0; x < width; x++) {
            char c; cin >> c;
            if (c == '.') {
                rows[y].push_back(x);
                columns[x].push_back(y);
            }
        }
    }

    checked = new bool*[height];
    for (int i = 0; i < height; i++) checked[i] = new bool[width];

    vector<pair<pi, pi>> queries;
    
    for (int i = 0; i < count; i++) {
        int y1, x1, y2, x2; cin >> y1 >> x1 >> y2 >> x2;
        queries.push_back({{ x1 - 1, y1 - 1 }, { x2 - 1, y2 - 1 }});
    }

    for (auto [start, end] : queries) {
        int sus = search(start, end, height, width);
        cout << sus << endl;
    }
}

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

Test 10

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 12

Group: 4, 5

Verdict: WRONG ANSWER

Test 13

Group: 4, 5

Verdict: WRONG ANSWER

Test 14

Group: 4, 5

Verdict: WRONG ANSWER

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