Submission #423371

---

Source Code Expand

#include <iostream>
#include <vector>

using namespace std;

class UF
{
private:
    int m_size;
    int m_query_num;
    vector<int> m_data;

public:
        UF(int s, int q) : m_size(s), m_query_num(q) {}
    void init();
    void unit(const int a, const int b);
    int find(const int a);
    void checkSame(const int a, const int b);
};


void UF::init(){
    m_data.resize(m_size);

    for (int i = 0; i < m_size; ++i) {
        m_data.at(i) = i;
    }
}


// rootを探す
int UF::find(const int a) {
    if (m_data.at(a) == a) return m_data.at(a);

    return this->find(m_data.at(a));
}


void UF::unit(const int a, const int b) {
    int root_a = find(a);
    int root_b = find(b);

    if (root_a == root_b) return;

    m_data.at(root_a) = root_b;
}



void UF::checkSame(const int a, const int b) {
    int root_a = this->find(m_data.at(a));
    int root_b = this->find(m_data.at(b));

    if (root_a == root_b) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}


int main()
{
    int n, q;

    cin >> n >> q;

    UF uf(n, q);
    uf.init();

    for (int i = 0; i < q; ++i) {
        int q, a, b;
        cin >> q >> a >> b;
        
        switch (q) {
            case 0:
                uf.unit(a, b);
                break;
            case 1:
                uf.checkSame(a, b);
                break;
            default:
                break;
        }
    }
    return 0;
}

Submission Info

Judge Result