#797718 (C++17) No.2072 Anatomy

• 問題: No.2072 Anatomy
• ユーザー: Forested
• 提出日時: 2022-09-16 21:25:07
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 48 ms / 2,000 ms
• コード長: 3,562 bytes
• コンパイル時間: 1,578 ms
• コンパイル使用メモリ: 132,584 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-01 11:55:09
• 合計ジャッジ時間: 4,571 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	2 ms; 6,940 KB
testcase_08	AC	42 ms; 6,940 KB
testcase_09	AC	42 ms; 6,940 KB
testcase_10	AC	42 ms; 6,940 KB
testcase_11	AC	44 ms; 6,940 KB
testcase_12	AC	34 ms; 6,944 KB
testcase_13	AC	47 ms; 6,940 KB
testcase_14	AC	30 ms; 6,940 KB
testcase_15	AC	26 ms; 6,944 KB
testcase_16	AC	46 ms; 6,940 KB
testcase_17	AC	44 ms; 6,940 KB
testcase_18	AC	23 ms; 6,940 KB
testcase_19	AC	48 ms; 6,940 KB
testcase_20	AC	47 ms; 6,940 KB
testcase_21	AC	45 ms; 6,944 KB
testcase_22	AC	48 ms; 6,940 KB
testcase_23	AC	46 ms; 6,940 KB
testcase_24	AC	44 ms; 6,940 KB
testcase_25	AC	48 ms; 6,940 KB
testcase_26	AC	2 ms; 6,940 KB
testcase_27	AC	45 ms; 6,940 KB
testcase_28	AC	45 ms; 6,944 KB

ソースコード

#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void) 0
#endif

// ============

#include <cassert>
#include <utility>
#include <vector>

class UnionFind {
    std::vector<int> par;

    int _root(int v) {
        if (par[v] < 0) {
            return v;
        } else {
            return par[v] = _root(par[v]);
        }
    }

public:
    UnionFind(int n) : par(n, -1) {}

    int root(int v) {
        assert(v >= 0 && v < (int) par.size());
        return _root(v);
    }

    int size(int v) {
        assert(v >= 0 && v < (int) par.size());
        return -par[_root(v)];
    }

    bool unite(int u, int v) {
        assert(u >= 0 && u < (int) par.size() && v >= 0 && v < (int) par.size());
        u = _root(u);
        v = _root(v);
        if (u == v) {
            return false;
        }
        if (par[u] < par[v]) {
            std::swap(u, v);
        }
        par[v] += par[u];
        par[u] = v;
        return true;
    }

    bool same(int u, int v) {
        assert(u >= 0 && u < (int) par.size() && v >= 0 && v < (int) par.size());
        return _root(u) == _root(v);
    }
};

// ============

int main() {
    i32 n, m;
    cin >> n >> m;
    Vec<i32> u(m), v(m);
    REP(i, m) {
        cin >> u[i] >> v[i];
        --u[i];
        --v[i];
    }
    
    UnionFind uf(n);
    Vec<i32> mx(n, 0);
    PER(i, m) {
        i32 ru = uf.root(u[i]);
        i32 rv = uf.root(v[i]);
        if (ru == rv) {
            ++mx[ru];
        } else {
            i32 m = max(mx[ru], mx[rv]) + 1;
            uf.unite(ru, rv);
            mx[uf.root(ru)] = m;
        }
    }
    cout << *max_element(ALL(mx)) << '\n';
}