結果
問題 | No.2311 [Cherry 5th Tune] Cherry Month |
ユーザー | hitonanode |
提出日時 | 2023-05-20 00:21:00 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 12,299 bytes |
コンパイル時間 | 2,829 ms |
コンパイル使用メモリ | 202,588 KB |
実行使用メモリ | 92,624 KB |
最終ジャッジ日時 | 2024-12-20 03:34:29 |
合計ジャッジ時間 | 23,200 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 3 ms
6,816 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 260 ms
52,948 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 306 ms
52,064 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 289 ms
43,548 KB |
testcase_25 | WA | - |
testcase_26 | AC | 300 ms
54,504 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | AC | 329 ms
84,520 KB |
testcase_45 | AC | 332 ms
84,180 KB |
testcase_46 | AC | 270 ms
49,552 KB |
testcase_47 | AC | 468 ms
84,280 KB |
testcase_48 | AC | 267 ms
78,620 KB |
testcase_49 | AC | 363 ms
78,680 KB |
testcase_50 | AC | 383 ms
78,836 KB |
ソースコード
#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<int> 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; 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<lint> ret(Q); REP(t, T + 1) { if (t < T) { if (tp.at(t) == 1) { to_all.at(X.at(t)).push_back(Y.at(t)); to_all.at(Y.at(t)).push_back(X.at(t)); if (last_deg.at(Y.at(t)) >= B) to_heavy.at(X.at(t)).push_back(Y.at(t)); if (last_deg.at(X.at(t)) >= B) to_heavy.at(Y.at(t)).push_back(X.at(t)); REP(iter, 2) { if (last_deg.at(X.at(t)) < B and last_deg.at(Y.at(t)) >= B) single_add.at(X.at(t)) -= adj_add.at(Y.at(t)); swap(X.at(t), Y.at(t)); } } 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 [i, q] : qs.at(t)) { lint ans = A.at(i) - single_add.at(i) - tree.get(et.subtree_begin.at(i)); if (last_deg.at(i) < B) { for (int j : to_heavy.at(i)) ans -= adj_add.at(j); } ret.at(q) = max(0LL, ans); } } for (auto x : ret) cout << x << '\n'; }