Hypyt

input/code.cpp: In function 'int main()':
input/code.cpp:116:33: error: 'class std::set<int>' has no member named 'contains'
  116 |                     bool c1 = v.contains(x1-1);
      |                                 ^~~~~~~~
input/code.cpp:117:34: error: 'class std::set<int>' has no member named 'contains'
  117 |                     bool c2 = v2.contains(x2-1);
      |                                  ^~~~~~~~
input/code.cpp:123:46: error: 'class std::set<int>' has no member named 'contains'
  123 |                         bool s1 = pset.first.contains(x1-1);
      |                                              ^~~~~~~~
input/code.cpp:125:51: error: 'class std::set<int>' has no member named 'contains'
  125 |                             bool s2 = pset.second.contains(x2-1);
      |                                                   ^~~~~~~~
input/code.cpp:132:51: error: 'class std::set<int>' has no member named 'contains'
  132 |                             bool s2 = pset.second.c...

#include <bits/stdc++.h>
 
using namespace std;

bool contains(set<int> v, int num) {
    for (auto i : v) {
        if (i == num) {
            return true;
        }
    }
    return false;
}

int main() {
    int n, m, q, ekay, ekax, tokay, tokax;
    string row;
    cin >> n >> m >> q;
    vector<string> grid;
    vector<int> nodesInColumns[m];
    vector<vector<pair<int, pair<set<int>, set<int>>>>> row_kaaret(n);
    vector<vector<pair<int, vector<pair<set<int>,set<int>>>>>> d(n);
    for (int index = 0; index < n; index++) {
        vector<pair<int,pair<set<int>,set<int>>>> v(n, {0, {}});
        row_kaaret[index] = v;
        vector<pair<int, vector<pair<set<int>,set<int>>>>> j(n);
        d[index] = j;
    }

    for (int index = 0; index < n; index++) {
        cin >> row;
        grid.push_back(row);
        for (int col = 0; col < m; col++) {
            if (grid[index][col] == '.') {
                nodesInColumns[col].push_back(index);
            }
        }
    }
    for (int index = 0; index < m; index++) {
        for (auto node : nodesInColumns[index]) {
            for (auto node2 : nodesInColumns[index]) {
                if (node < node2) {
                    row_kaaret[node][node2].first = 1;
                    row_kaaret[node][node2].second.first.insert(index);
                    row_kaaret[node][node2].second.second.insert(index);
                }
            }
        }
    }
    //floyd
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) d[i][j].first = 0;
            else if (i < j && row_kaaret[i][j].first != 0) {
                d[i][j].first = row_kaaret[i][j].first;
                pair<set<int>,set<int>> p = row_kaaret[i][j].second;
                d[i][j].second.push_back(p);
            }
            else d[i][j].first = 1e9;
        }
    }
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = i; j < n; j++) {
                if (d[i][j].first > d[min(i,k)][max(i,k)].first + d[min(k,j)][max(k,j)].first) {
                    d[i][j].first = d[min(i,k)][max(i,k)].first + d[min(k,j)][max(k,j)].first;
                    pair<set<int>,set<int>> p;
                    if (i < k) row_kaaret[i][j].second.first = row_kaaret[i][k].second.first;
                    else row_kaaret[i][j].second.first = row_kaaret[k][i].second.second;
                    if (k < j) row_kaaret[i][j].second.second = row_kaaret[k][j].second.second;
                    else row_kaaret[i][j].second.second = row_kaaret[j][k].second.first;
                    if (i < k) p.first = row_kaaret[i][k].second.first;
                    else p.first = row_kaaret[k][i].second.second;
                    if (k < j) p.second = row_kaaret[k][j].second.second;
                    else p.second = row_kaaret[j][k].second.first;
                    d[i][j].second.clear();
                    if ((int) p.first.size() != 0 && (int) p.second.size() != 0) d[i][j].second.push_back(p);
                } else if (d[i][j].first == d[min(i,k)][max(i,k)].first + d[min(k,j)][max(k,j)].first) {
                    pair<set<int>,set<int>> p;
                    if (i < k) p.first = row_kaaret[i][k].second.first;
                    else p.first = row_kaaret[k][i].second.second;
                    if (k < j) p.second = row_kaaret[k][j].second.second;
                    else p.second = row_kaaret[j][k].second.first;
                    if ((int) p.first.size() != 0 && (int) p.second.size() != 0) {
                        d[i][j].second.push_back(p);
                        if (i < k) row_kaaret[i][j].second.first.insert(row_kaaret[i][k].second.first.begin(), row_kaaret[i][k].second.first.end());
                        else row_kaaret[i][j].second.first.insert(row_kaaret[k][i].second.second.begin(), row_kaaret[k][i].second.second.end());
                        if (k < j) row_kaaret[i][j].second.second.insert(row_kaaret[k][j].second.second.begin(), row_kaaret[k][j].second.second.end());
                        else row_kaaret[i][j].second.second.insert(row_kaaret[j][k].second.first.begin(), row_kaaret[j][k].second.first.end());
                    }
                }
            }
        }
    }
    //kyselyt
    for (int index = 0; index < q; index++) {
        cin >> ekay >> ekax >> tokay >> tokax;
        int y1 = tokay;
        int y2 = ekay;
        int x1 = tokax;
        int x2 = ekax;
        if (ekay < tokay) {
            y1 = ekay;
            y2 = tokay;
            x1 = ekax;
            x2 = tokax;
        }
        if (y1 == y2 && x1 == x2) cout << 0 << endl;
        else if (y1 == y2 || x1 == x2) cout << 1 << endl;
        else {
            pair<int, vector<pair<set<int>,set<int>>>> dist = d[y1-1][y2-1];
            if (dist.first >= 1e9) cout << -1 << endl;
            else {
                if (dist.first == 1) {
                    set<int> v = row_kaaret[y1-1][y2-1].second.first;
                    set<int> v2 = row_kaaret[y1-1][y2-1].second.second;
                    bool c1 = v.contains(x1-1);
                    bool c2 = v2.contains(x2-1);
                    if ((c1 != false || c2 != false)) cout << dist.first + dist.first-1 + 1 << endl;
                    else if (c1 == false && c2 == false) cout << dist.first + dist.first-1 + 2 << endl;
                } else {
                    int a = 0, b = 0;
                    for (auto pset : dist.second) {
                        bool s1 = pset.first.contains(x1-1);
                        if (s1) {
                            bool s2 = pset.second.contains(x2-1);
                            if (s2) {
                                a = 1;
                                break;
                            }
                            b = 1;
                        } else if (b == 0) {
                            bool s2 = pset.second.contains(x2-1);
                            if (s2) b = 1;
                        }
                    }
                    if (a == 1) cout << dist.first + dist.first-1 << endl;
                    else if (b == 1) cout << dist.first + dist.first-1 + 1 << endl;
                    else cout << dist.first + dist.first-1 + 2 << endl;
                }
            }
        }
    }
}