Test/Aizu Online Judge/Problems/problem1649.test.cpp

• View this file on GitHub
• Last update: 2024-05-06 18:57:57+09:00
• Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1649

Depends on

• Union Find (Graph/dsu.hpp)

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1649"

#include <bits/stdc++.h>

#include "Graph/dsu.hpp"

using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    while(true){
        int w, h;
        cin >> w >> h;
        if(w == 0) break;
        dsu uf(w + h);
        for(int i = 0; i < w + h - 1; i++){
            int x, y, v;
            cin >> x >> y >> v;
            uf.merge(--x, --y + w);
        }
        cout << (uf.size() == 1 ? "YES" : "NO") << '\n';
    }
}

#line 1 "Test/Aizu Online Judge/Problems/problem1649.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1649"

#include <bits/stdc++.h>

#line 1 "Graph/dsu.hpp"
struct dsu {
    public:
    dsu() : _n(0) {}
    dsu(int n) : _n(n), num_component(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        num_component--;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size() { 
        return num_component;
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

    private:
    int _n, num_component;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};
#line 5 "Test/Aizu Online Judge/Problems/problem1649.test.cpp"
using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    while(true){
        int w, h;
        cin >> w >> h;
        if(w == 0) break;
        dsu uf(w + h);
        for(int i = 0; i < w + h - 1; i++){
            int x, y, v;
            cin >> x >> y >> v;
            uf.merge(--x, --y + w);
        }
        cout << (uf.size() == 1 ? "YES" : "NO") << '\n';
    }
}

Back to top page