Hypyt

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:134:28: error: no match for 'operator<<' (operand types are 'std::basic_ostream<char>' and 'std::common_type<std::chrono::duration<long int, std::ratio<1, 1000000000> >, std::chrono::duration<long int, std::ratio<1, 1000000000> > >::type' {aka 'std::chrono::duration<long int, std::ratio<1, 1000000000> >'})
  134 |         cout << min << " " << endTime - startTime << '\n';
      |         ~~~~~~~~~~~~~~~~~~ ^~ ~~~~~~~~~~~~~~~~~~~
      |                     |                 |
      |                     |                 std::common_type<std::chrono::duration<long int, std::ratio<1, 1000000000> >, std::chrono::duration<long int, std::ratio<1, 1000000000> > >::type {aka std::chrono::duration<long int, std::ratio<1, 1000000000> >}
      |                     std::basic_ostream<char>
In file included from /usr/include/c++/11/iostream:39,
                 from input/code.cpp:6:
/usr/include/c++/11/ostream:108:7: note: cand...

#include <algorithm>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <unistd.h>
#include <vector>

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

vector<int> *baseRows;
vector<int> *baseColumns;

int *reverseRows;
int *reverseColumns;

constexpr int NOT_FOUND = 10000;

bool findPath(int **path, int depth, pi pos, bool row, pi target, int *min) {
    path[pos.first][pos.second] = depth;

    int rev1 = reverseRows[pos.second];
    int rev2 = reverseColumns[pos.first];

    if (rev1) {
        if (rev2) *min = depth - 1 + std::min(rev1, rev2);
        else *min = depth + rev1 - 1;
        return true;
    } else if (rev2) {
        *min = depth + rev2 - 1;
        return true;
    }

    if (depth + 1 >= *min) return false;

    if (row) {
        for (int i : baseRows[pos.second]) {
            int found = path[i][pos.second];
            if (found <= depth + 1) continue;

            if (findPath(path, depth + 1, { i, pos.second }, false, target, min)) return false;
        }
    } else {
        for (int i : baseColumns[pos.first]) {
            int found = path[pos.first][i];
            if (found <= depth + 1) continue;

            if (findPath(path, depth + 1, { pos.first, i }, true, target, min)) return false;
        }
    }

    return false;
}

void createReverse(pi pos, int depth, int max) {
    if (reverseRows[pos.second] == 0 || depth < reverseRows[pos.second]) reverseRows[pos.second] = depth;
    if (reverseColumns[pos.first] == 0 || depth < reverseColumns[pos.first]) reverseColumns[pos.first] = depth;

    if (depth >= max) return;

    for (int i : baseRows[pos.second]) {
        createReverse({ i, pos.second }, depth + 1, max);
    }

    for (int i : baseColumns[pos.first]) {
        createReverse({ pos.first, i }, depth + 1, max);
    }
}

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

    baseRows = new vector<int>[height];
    baseColumns = new vector<int>[width];

    for (int y = 0; y < height; y++) {
        for (int x = 0; x < width; x++) {
            char c; cin >> c;

            if (c == '.') {
                baseRows[y].push_back(x);
                baseColumns[x].push_back(y);
            }
        }
    }
    
    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 } });
    }

    reverseRows = new int[height];
    reverseColumns = new int[width];
    int **path = new int*[width];

    for (int i = 0; i < width; i++) {
        path[i] = new int[height];
    }

    // auto startTime = chrono::high_resolution_clock::now();
    for (auto [start, end] : queries) {
        int min = NOT_FOUND;

        auto startTime = chrono::high_resolution_clock::now();
        if (start.first == end.first && start.second == end.second) min = 0;
        else {
            for (int i = 0; i < width; i++)
                memset((void*)(path[i]), 127, height * sizeof(int));

            memset((void*)reverseRows, 0, height * sizeof(int));
            memset((void*)reverseColumns, 0, width * sizeof(int));
            
            createReverse(end, 1, 3);

            for (int i = 0; i < height; i++)
                sort(baseRows[i].begin(), baseRows[i].end(), [end](int p1, int p2) -> bool { return abs(p1 - end.first) < abs(p2 - end.first); });

            for (int i = 0; i < width; i++)
                sort(baseColumns[i].begin(), baseColumns[i].end(), [end](int p1, int p2) -> bool { return abs(p1 - end.second) < abs(p2 - end.second); });

            findPath(path, 1, start, true, end, &min);
            findPath(path, 1, start, false, end, &min);

            if (min == NOT_FOUND) min = -1;
        }
        auto endTime = chrono::high_resolution_clock::now();

        cout << min << " " << endTime - startTime << '\n';
    }
    // auto endTime = chrono::high_resolution_clock::now();
    // cout << "totalTime: " << endTime - startTime << endl;
}