結果
問題 | No.2333 Slime Structure |
ユーザー | 👑 hitonanode |
提出日時 | 2023-05-28 14:43:02 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 208 ms / 3,000 ms |
コード長 | 9,024 bytes |
コンパイル時間 | 3,263 ms |
コンパイル使用メモリ | 193,472 KB |
実行使用メモリ | 69,336 KB |
最終ジャッジ日時 | 2023-08-27 10:28:39 |
合計ジャッジ時間 | 13,586 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 95 ms
35,320 KB |
testcase_03 | AC | 122 ms
39,364 KB |
testcase_04 | AC | 135 ms
40,584 KB |
testcase_05 | AC | 109 ms
36,740 KB |
testcase_06 | AC | 153 ms
40,996 KB |
testcase_07 | AC | 194 ms
68,512 KB |
testcase_08 | AC | 185 ms
68,296 KB |
testcase_09 | AC | 187 ms
67,656 KB |
testcase_10 | AC | 186 ms
68,100 KB |
testcase_11 | AC | 189 ms
68,404 KB |
testcase_12 | AC | 188 ms
68,828 KB |
testcase_13 | AC | 181 ms
67,992 KB |
testcase_14 | AC | 184 ms
68,100 KB |
testcase_15 | AC | 188 ms
67,692 KB |
testcase_16 | AC | 192 ms
67,496 KB |
testcase_17 | AC | 187 ms
67,932 KB |
testcase_18 | AC | 185 ms
67,788 KB |
testcase_19 | AC | 193 ms
68,184 KB |
testcase_20 | AC | 187 ms
68,188 KB |
testcase_21 | AC | 191 ms
68,108 KB |
testcase_22 | AC | 197 ms
68,108 KB |
testcase_23 | AC | 201 ms
67,548 KB |
testcase_24 | AC | 204 ms
68,060 KB |
testcase_25 | AC | 202 ms
68,040 KB |
testcase_26 | AC | 205 ms
69,336 KB |
testcase_27 | AC | 202 ms
68,288 KB |
testcase_28 | AC | 207 ms
68,820 KB |
testcase_29 | AC | 208 ms
67,656 KB |
testcase_30 | AC | 204 ms
68,396 KB |
testcase_31 | AC | 203 ms
68,080 KB |
testcase_32 | AC | 174 ms
67,912 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/segtree> constexpr lint inf = 1LL << 60; struct S { lint sum = 0; lint lmax = 0; lint rmax = 0; lint inmax = 0; lint single_max = -inf; static S init(lint val, lint len) { return S{val * len, max(val, 0LL) * len, max(val, 0LL) * len, max(val, 0LL) * len, val}; } }; S op(S l, S r) { return { l.sum + r.sum, max(l.lmax, l.sum + r.lmax), max(r.rmax, r.sum + l.rmax), max({l.inmax, r.inmax, l.rmax + r.lmax}), max(l.single_max, r.single_max), }; } S e() { return S(); } int main() { int N; cin >> N; vector<int> A(N), B(N); vector<lint> xs; lint r = 0; xs.push_back(r); REP(i, N) { cin >> A.at(i) >> B.at(i); r += B.at(i); xs.push_back(r); } dbg(xs); const auto heads = xs; int Q; cin >> Q; vector<tuple<int, lint, lint>> qs; REP(q, Q) { int tp; cin >> tp; if (tp == 1) { lint x, y; cin >> x >> y; --x; xs.push_back(x); xs.push_back(x + 1); qs.emplace_back(tp, x, y); } else { lint l, r; cin >> l >> r; --l; xs.push_back(l), xs.push_back(r); qs.emplace_back(tp, l, r); } } dbg(qs); xs = sort_unique(xs); dbg(xs); dbg(heads); vector<S> init; FOR(i, 1, xs.size()) { const lint xl = xs.at(i - 1), xr = xs.at(i); const int d = argub(heads, xl) - 1; dbg(make_tuple(xl, xr, d, A.at(d))); init.push_back(S::init(A.at(d), xr - xl)); } atcoder::segtree<S, op, e> tree(init); for (auto [tp, l, r] : qs) { if (tp == 1) { int p = arglb(xs, l); assert(xs.at(p) == l and xs.at(p + 1) == l + 1); tree.set(p, S::init(r, 1)); } else { auto p = tree.prod(arglb(xs, l), arglb(xs, r)); if (p.single_max < 0) { cout << p.single_max << '\n'; } else { cout << p.inmax << '\n'; } } } }