結果

問題 No.1054 Union add query
ユーザー 横山緑
提出日時 2025-03-04 09:45:46
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 399 ms / 2,000 ms
コード長 6,411 bytes
コンパイル時間 4,315 ms
コンパイル使用メモリ 288,932 KB
実行使用メモリ 106,828 KB
最終ジャッジ日時 2025-03-04 09:45:54
合計ジャッジ時間 8,004 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "/home/y_midori/cp/test.cpp"
// #include "graph/graph-template.hpp"
#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
    os << "[";
    for (size_t i = 0; i < v.size(); ++i) {
        os << v[i];
        if (i < v.size() - 1) os << ", ";
    }
    os << "]";
    return os;
}
template <typename T>
ostream& debug_print(ostream& os, const T& var) {
    os << var;
    return os;
}
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }
#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }
#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; }
#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }
#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }

#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)
#else
#define debug(...)
#endif

using ll = long long;
using vl = vector<ll>;
using vll = vector<vl>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
void print(const string &s) {
    cout << s << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::value>::type print(const Container& x) {
    if (!x.empty()) {
        auto it = x.begin();
        for (; it != prev(x.end()); ++it) {
            cout << *it << " ";
        }
        cout << *it << "\n";  // 最後の要素を出力して改行
    }
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)

ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 3 "data_structure/union-find.hpp"
struct UnionFind {
    int n;
    vector<int> p;
    UnionFind(int n) : n(n), p(n, -1) {}
    int leader(int x) {
        if(p[x] < 0)
            return x;
        return p[x] = leader(p[x]);
    }
    int merge(int x, int y) {
        x = leader(x), y = leader(y);
        if(x == y)
            return x;
        if(-p[x] < -p[y])
            swap(x, y);
        p[x] += p[y];
        p[y] = x;
        return x;
    }
    int size(int x) { return -p[leader(x)]; }
    bool same(int x, int y) { return leader(x) == leader(y); }
};
#line 4 "/home/y_midori/cp/test.cpp"
// #include "tree/euler-tour.hpp"
#include <atcoder/fenwicktree>
struct query {
    ll t, a, b;
    ll id;
};
void solve() {
    LL(n, q);
    vl p(2 * n - 1);
    iota(all(p), 0);
    vll c(2 * n - 1);
    vector<query> vq(q);
    ll aux = n;
    UnionFind uf(n);
    auto merge = [&](ll a, ll b) {
        a = uf.leader(a), b = uf.leader(b);
        if(a == b)
            return;
        c[aux].push_back(p[a]);
        c[aux].push_back(p[b]);
        p[uf.merge(a, b)] = aux++;
    };
    rep(i, q) {
        LL(t, a, b);
        --a;
        if(t == 1) {
            b--;
            merge(a, b);
        }
        vq[i] = query(t, a, b, p[uf.leader(a)]);
    }
    rep(i, 1, n) merge(0, i);
    atcoder::fenwick_tree<ll> fw(2 * n);
    vl in(2 * n - 1), out(2 * n - 1);
    ll time = 0;
    auto dfs = [&](auto &&dfs, ll cur) -> void {
        in[cur] = time++;
        for(auto nex : c[cur])
            dfs(dfs, nex);
        out[cur] = time;
    };
    dfs(dfs, 2 * n - 2);
    assert(time == aux);
    for(auto qi : vq) {
        if(qi.t == 1)
            continue;
        else if(qi.t == 2) {
            ll idx = qi.id;
            if(idx < n) {
                idx = qi.a;
            }
            fw.add(in[idx], qi.b);
            fw.add(out[idx], -qi.b);
        } else {
            print(fw.sum(0, in[qi.a] + 1));
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    solve();
}
0