#616691 (C++17) No.1390 Get together

提出ソース

結果

問題	No.1390 Get together
ユーザー	r1933
提出日時	2021-02-12 21:43:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	96 ms / 2,000 ms
コード長	6,049 bytes
コンパイル時間	2,802 ms
コンパイル使用メモリ	224,484 KB
実行使用メモリ	28,168 KB
最終ジャッジ日時	2024-07-19 20:49:31
合計ジャッジ時間	5,449 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	3 ms 5,376 KB
testcase_04	AC	3 ms 5,376 KB
testcase_05	AC	3 ms 5,376 KB
testcase_06	AC	3 ms 5,376 KB
testcase_07	AC	3 ms 5,376 KB
testcase_08	AC	3 ms 5,376 KB
testcase_09	AC	3 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	58 ms 21,976 KB
testcase_17	AC	82 ms 28,168 KB
testcase_18	AC	51 ms 20,440 KB
testcase_19	AC	91 ms 26,240 KB
testcase_20	AC	84 ms 27,520 KB
testcase_21	AC	88 ms 27,432 KB
testcase_22	AC	71 ms 24,468 KB
testcase_23	AC	74 ms 24,284 KB
testcase_24	AC	74 ms 24,292 KB
testcase_25	AC	83 ms 26,240 KB
testcase_26	AC	88 ms 26,092 KB
testcase_27	AC	90 ms 26,236 KB
testcase_28	AC	95 ms 26,368 KB
testcase_29	AC	96 ms 26,280 KB
testcase_30	AC	88 ms 26,240 KB
testcase_31	AC	88 ms 26,208 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
    for (auto &v: vs) is >> v;
    return is;
}

template <class T, class U>
inline istream& operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << " ";
    output(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
    static constexpr const char *delim[] = {" ", ""};
    for (auto it = begin(vs); it != end(vs); ++it) {
        os << delim[it == begin(vs)] << *it;
    }
    return os;
}

template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
    for (auto it = Begin; it != End; ++it) {
        cout << ((it == Begin) ? "" : delim) << *it;
    }
    cout << last;
}

template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
    return vector<T>(sz, init_value);
}

template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}

void operator|=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs | rhs;
}

void ioinit() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
    clog << fixed << setprecision(10);
}
// }}} End Header

// DisjointSet {{{
struct DisjointSet {
    const size_t n;
    mutable vector<int> c;
    explicit DisjointSet(const size_t n) : n(n), c(n, -1) {}

    size_t size(size_t v) const {
        assert(v < n);
        return -c[root(v)];
    }

    size_t root(size_t v) const {
        assert(v < n);
        return (c[v] < 0) ? v : c[v] = root(c[v]);
    }

    bool connected(size_t u, size_t v) const {
        assert(u < n);
        assert(v < n);
        return root(u) == root(v);
    }

    size_t unite(size_t u, size_t v) {
        assert(u < n);
        assert(v < n);
        u = root(u);
        v = root(v);
        if (u == v) return u;
        if (-c[u] < -c[v]) swap(u, v);
        c[u] += c[v];
        c[v] = u;
        return u;
    }

    vector<vector<size_t>> groups() {
        vector<size_t> roots(n), group_size(n);
        for (size_t i = 0; i < n; ++i) {
            roots[i] = root(i);
            group_size[roots[i]]++;
        }
        vector<vector<size_t>> res(n);
        for (size_t i = 0; i < n; ++i) {
            res[i].reserve(group_size[i]);
        }
        for (size_t i = 0; i < n; ++i) {
            res[roots[i]].emplace_back(i);
        }
        res.erase(
            remove_if(res.begin(), res.end(),
                      [&](const auto& v) { return v.empty(); }),
            res.end());
        return res;
    }
};
// }}}

int main() {
    ioinit();

    var(size_t, N, M);

    vector<vector<int>> box_by_color(N);
    vector<int> bs(N), cs(N);
    rep(i, 0, N) {
        input(bs[i], cs[i]);
        bs[i]--, cs[i]--;
        box_by_color[cs[i]].emplace_back(bs[i]);
    }

    DisjointSet ds(M);
    rep(c, 0, N) {
        rep(i, 1, box_by_color[c].size()) ds.unite(box_by_color[c][i - 1], box_by_color[c][i]);
    }

    const auto gs = ds.groups();
    int res = 0;
    for (const auto g: gs) {
        res += g.size() - 1;
    }

    output(res);
    return 0;
}

yukicoder

結果

テストケース

ソースコード