結果

問題 No.2311 [Cherry 5th Tune] Cherry Month
ユーザー 👑 hitonanodehitonanode
提出日時 2023-05-20 00:28:28
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 448 ms / 4,600 ms
コード長 12,241 bytes
コンパイル時間 3,307 ms
コンパイル使用メモリ 200,164 KB
実行使用メモリ 96,376 KB
最終ジャッジ日時 2023-08-23 02:43:42
合計ジャッジ時間 26,083 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 397 ms
66,800 KB
testcase_03 AC 157 ms
21,536 KB
testcase_04 AC 147 ms
20,160 KB
testcase_05 AC 147 ms
19,148 KB
testcase_06 AC 188 ms
24,216 KB
testcase_07 AC 147 ms
17,856 KB
testcase_08 AC 275 ms
57,212 KB
testcase_09 AC 255 ms
38,924 KB
testcase_10 AC 250 ms
42,156 KB
testcase_11 AC 250 ms
48,744 KB
testcase_12 AC 360 ms
50,412 KB
testcase_13 AC 321 ms
45,508 KB
testcase_14 AC 307 ms
57,896 KB
testcase_15 AC 374 ms
55,332 KB
testcase_16 AC 189 ms
25,004 KB
testcase_17 AC 353 ms
61,472 KB
testcase_18 AC 305 ms
57,124 KB
testcase_19 AC 344 ms
55,444 KB
testcase_20 AC 316 ms
44,548 KB
testcase_21 AC 279 ms
32,976 KB
testcase_22 AC 252 ms
36,088 KB
testcase_23 AC 328 ms
49,036 KB
testcase_24 AC 288 ms
45,032 KB
testcase_25 AC 223 ms
44,504 KB
testcase_26 AC 357 ms
56,900 KB
testcase_27 AC 355 ms
96,280 KB
testcase_28 AC 337 ms
96,376 KB
testcase_29 AC 345 ms
96,284 KB
testcase_30 AC 164 ms
29,600 KB
testcase_31 AC 161 ms
29,456 KB
testcase_32 AC 167 ms
29,440 KB
testcase_33 AC 320 ms
94,580 KB
testcase_34 AC 332 ms
94,296 KB
testcase_35 AC 335 ms
94,516 KB
testcase_36 AC 392 ms
84,092 KB
testcase_37 AC 408 ms
83,676 KB
testcase_38 AC 413 ms
84,292 KB
testcase_39 AC 428 ms
87,240 KB
testcase_40 AC 428 ms
87,252 KB
testcase_41 AC 425 ms
87,708 KB
testcase_42 AC 403 ms
86,504 KB
testcase_43 AC 448 ms
88,184 KB
testcase_44 AC 362 ms
91,484 KB
testcase_45 AC 377 ms
91,432 KB
testcase_46 AC 297 ms
52,792 KB
testcase_47 AC 363 ms
91,660 KB
testcase_48 AC 285 ms
85,820 KB
testcase_49 AC 314 ms
85,976 KB
testcase_50 AC 400 ms
86,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <atcoder/lazysegtree>
using S = lint;
S op(S l, S r) { return max(l, r); }
S e() { return 0; }
using F = lint;
S mapping(F f, S x) { return x + f; }
F composition(F f, F g) { return f + g; }
F id() { return 0; }

// UnionFind Tree (0-indexed), based on size of each disjoint set
struct UnionFind {
    std::vector<int> par, cou;
    UnionFind(int N = 0) : par(N), cou(N, 1) { iota(par.begin(), par.end(), 0); }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    bool unite(int x, int y, bool do_swap) {
        x = find(x), y = find(y);
        if (x == y) return false;
        if (do_swap and cou[x] < cou[y]) std::swap(x, y);
        par[y] = x, cou[x] += cou[y];
        return true;
    }
    int count(int x) { return cou[find(x)]; }
    bool same(int x, int y) { return find(x) == find(y); }
    std::vector<std::vector<int>> groups() {
        std::vector<std::vector<int>> ret(par.size());
        for (int i = 0; i < int(par.size()); ++i) ret[find(i)].push_back(i);
        ret.erase(std::remove_if(ret.begin(), ret.end(),
                                 [&](const std::vector<int> &v) { return v.empty(); }),
                  ret.end());
        return ret;
    }
};

// Preorder Euler Tour
// （行きがけ順，部分木の頂点クエリ等に有用）
struct PreorderEulerTour {
    int V; // # of vertices of tree
    int root;
    std::vector<std::vector<int>> edges;
    std::vector<int> subtree_begin, subtree_end;
    std::vector<int> vis_order;

    void _build_dfs(int now, int prv) {
        subtree_begin[now] = vis_order.size();
        vis_order.push_back(now);
        for (auto nxt : edges[now])
            if (nxt != prv) _build_dfs(nxt, now);
        subtree_end[now] = vis_order.size();
    }
    PreorderEulerTour() = default;
    PreorderEulerTour(const std::vector<std::vector<int>> &to, int root)
        : V(to.size()), root(root), edges(to) {
        assert(root >= 0 and root < V);
        subtree_begin.resize(V);
        subtree_end.resize(V);
        _build_dfs(root, -1);
    }
};




int main() {
    int N;
    cin >> N;
    vector<lint> A(N);
    cin >> A;

    int T;
    cin >> T;

    vector<lint> tp(T), X(T), Y(T), add_at(T, -1);

    vector<int> last_deg(N);

    UnionFind uf1(N * 2);
    vector<vector<int>> ch(N);
    REP(t, T) {
        cin >> tp[t] >> X[t] >> Y[t];
        --X.at(t);
        if (tp.at(t) == 1) {
            --Y.at(t);
            last_deg.at(X.at(t))++;
            last_deg.at(Y.at(t))++;

            if (const int u = uf1.find(X.at(t)), v = uf1.find(Y.at(t)); u != v) {
                int s = ch.size();
                ch.push_back({u, v});
                uf1.unite(s, u, false);
                uf1.unite(s, v, false);

                assert(uf1.find(u) == s);
                assert(uf1.find(v) == s);
            }
        }
        if (tp.at(t) == 4) add_at.at(t) = uf1.find(X.at(t));
    }
    dbg(last_deg);
    dbg(add_at);

    const int root = ch.size();
    ch.push_back({});
    REP(i, N) {
        if (!uf1.same(i, root)) {
            ch.back().push_back(uf1.find(i));
            uf1.unite(root, uf1.find(i), false);
        }
    }

    dbg(ch);
    PreorderEulerTour et(ch, root);
    dbg(et.subtree_begin);
    dbg(et.subtree_end);

    vector<vector<pint>> qs(T + 1);
    int Q;
    cin >> Q;
    REP(q, Q) {
        int s, i;
        cin >> s >> i;
        --i;
        qs.at(s).emplace_back(i, q);
    }

    vector<lint> single_add(N); // type 2, type 3
    vector<lint> adj_add(N);    // type 3, heavy

    UnionFind uf(N);

    // constexpr int B = 300;
    constexpr int B = 300;

    vector<vector<int>> to_all(N);
    vector<vector<int>> to_heavy(N);

    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> tree(ch.size());

    vector<int> is_heavy;
    for (int d : last_deg) is_heavy.push_back(d >= B);

    vector<lint> ret(Q);
    REP(t, T + 1) {
        for (auto [i, q] : qs.at(t)) {
            lint ans = A.at(i) - single_add.at(i) - tree.get(et.subtree_begin.at(i));
            if (!is_heavy.at(i)) {
                for (int j : to_heavy.at(i)) ans -= adj_add.at(j);
            }
            ret.at(q) = max(0LL, ans);
        }

        if (t < T) {
            if (tp.at(t) == 1) {
                int x = X.at(t), y = Y.at(t);
                REP(_, 2) {
                    to_all.at(x).push_back(y);
                    if (is_heavy.at(y)) to_heavy.at(x).push_back(y);
                    if (!is_heavy.at(x) and is_heavy.at(y)) single_add.at(x) -= single_add.at(y);
                    swap(x, y);
                }

            } else if (tp.at(t) == 2) {
                single_add.at(X.at(t)) += Y.at(t);
            } else if (tp.at(t) == 3) {
                single_add.at(X.at(t)) += Y.at(t);

                if (last_deg.at(X.at(t)) >= B) {
                    for (int j : to_heavy.at(X.at(t))) single_add.at(j) += Y.at(t);
                    adj_add.at(X.at(t)) += Y.at(t);
                } else {
                    for (int j : to_all.at(X.at(t))) single_add.at(j) += Y.at(t);
                }
            } else if (tp.at(t) == 4) {
                tree.apply(et.subtree_begin.at(add_at.at(t)), et.subtree_end.at(add_at.at(t)), Y.at(t));
            } else {
                exit(1);
            }
        }
    }
    for (auto x : ret) cout << x << '\n';
}
0