Hypyt

#include <cstdlib>
#include <iostream>
#include <map>
#include <memory>
#include <stack>
#include <string>
#include <vector>

using pi = std::pair<int, int>;

std::vector<std::shared_ptr<std::vector<pi>>> rows;
std::vector<std::shared_ptr<std::vector<pi>>> columns;

constexpr int NOT_FOUND = 100000;

int findPath(std::vector<pi> path, pi target) {
    pi pos = path.at(path.size() - 1);

    std::shared_ptr<std::vector<pi>> row = rows[pos.second];
    std::shared_ptr<std::vector<pi>> column = columns[pos.first];

    if (target.first == pos.first && target.second == pos.second) return path.size() - 1;

    int min = NOT_FOUND;
    for (std::size_t i = 0; i < row->size(); i++) {
        pi pos2 = row->at(i);

        bool guh = false;
        for (auto j : path) {
            if (j == pos2) {
                guh = true;
                break;
            }
        }
        if (guh) continue;

        std::vector<pi> path2 = path;
        path2.push_back(pos2);

        min = std::min(min, findPath(path2, target));
    }

    for (std::size_t i = 0; i < column->size(); i++) {
        pi pos2 = column->at(i);

        bool guh = false;
        for (auto j : path) {
            if (j == pos2) {
                guh = true;
                break;
            }
        }
        if (guh) continue;

        std::vector<pi> path2 = path;
        path2.push_back(pos2);

        min = std::min(min, findPath(path2, target));
    }

    return min;
}

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


    for (int i = 0; i < height; i++) rows.push_back(std::make_shared<std::vector<pi>>());
    for (int i = 0; i < width; i++) columns.push_back(std::make_shared<std::vector<pi>>());

    for (int i = 0; i < height; i++) {
        char c;

        for (int j = 0; j < width; j++) {
            std::cin >> c;
            if (c != '.') continue;

            pi pos { j, i };

            columns.at(j)->push_back(pos);
            rows.at(i)->push_back(pos);
        }
    }

    std::vector<int> answers;
    for (int i = 0; i < count; i++) {
        int y1, x1, y2, x2; std::cin >> y1 >> x1 >> y2 >> x2;

        int least = findPath({{x1 - 1, y1 - 1}}, {x2 - 1, y2 - 1});
        if (least == NOT_FOUND) least = -1;
        answers.push_back(least);
    }

    for (auto i : answers) std::cout << i << std::endl;
}

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 2, 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

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

Test 7

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2, 5

Verdict: RUNTIME ERROR

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: RUNTIME ERROR

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

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: ACCEPTED