SDA - test 6 - 2021-2022 - Път в граф

#include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <queue>

using namespace std;

struct UnionFind {
    vector<int> parents;
public:
    UnionFind(int count) : parents(count) {
        for (int i = 0; i < count; i++)
        {
            parents[i] = i;
        }
    }
    bool areInOneSet(int a, int b) {
        return getParent(a) == getParent(b);
    }

    int getParent(int idx) {
        if (parents[idx] == idx)
        {
            return idx;
        }

        return parents[idx] = getParent(parents[idx]);
    }

    void unite(int a, int b) {
        parents[getParent(a)] = getParent(b);
    }
};

int main()
{
    int n, m, k;
    cin >> n >> m;
    UnionFind graph(n);

    long long a, b;

    for (int i = 0; i < m; i++)
    {
        cin >> a >> b;
        graph.unite(a - 1, b - 1);
    }
    cin >> k;

    for (size_t i = 0; i < k; i++)
    {
        cin >> a >> b;
        cout << graph.areInOneSet(a - 1, b - 1) << " ";
    }

}