結果
問題 | No.2333 Slime Structure |
ユーザー | t98slider |
提出日時 | 2023-06-15 22:36:29 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,868 bytes |
コンパイル時間 | 1,876 ms |
コンパイル使用メモリ | 184,616 KB |
実行使用メモリ | 51,760 KB |
最終ジャッジ日時 | 2024-06-23 20:04:35 |
合計ジャッジ時間 | 9,454 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 167 ms
33,408 KB |
testcase_13 | AC | 170 ms
33,492 KB |
testcase_14 | AC | 172 ms
33,456 KB |
testcase_15 | AC | 170 ms
33,340 KB |
testcase_16 | AC | 164 ms
33,448 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { if(vec.empty()) return os; os << vec[0]; for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it; return os; } const ll INF = 1ll << 60; template <class S, S (*op)(S, S), S (*e)()> struct segtree { public: segtree() : segtree(0) {} segtree(int n) : segtree(std::vector<S>(n, e())) {} segtree(const std::vector<S>& v) : _n(int(v.size())) { log = ceil_pow2(_n); size = 1 << log; d = std::vector<S>(2 * size, e()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; d[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } S get(int p) { assert(0 <= p && p < _n); return d[p + size]; } const S operator[](int p) const { return get(p); } S operator[](int p) { return get(p); } S prod(int l, int r) { assert(0 <= l && l <= r && r <= _n); S sml = e(), smr = e(); l += size; r += size; while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() { return d[1]; } template <bool (*f)(S)> int max_right(int l) { return max_right(l, [](S x) { return f(x); }); } template <class F> int max_right(int l, F f) { assert(0 <= l && l <= _n); assert(f(e())); if (l == _n) return _n; l += size; S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!f(op(sm, d[l]))) { while (l < size) { l = (2 * l); if (f(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template <bool (*f)(S)> int min_left(int r) { return min_left(r, [](S x) { return f(x); }); } template <class F> int min_left(int r, F f) { assert(0 <= r && r <= _n); assert(f(e())); if (r == 0) return 0; r += size; S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!f(op(d[r], sm))) { while (r < size) { r = (2 * r + 1); if (f(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } private: int _n, size, log; std::vector<S> d; int ceil_pow2(int n) { int x = 0; while ((1U << x) < (unsigned int)(n)) x++; return x; } void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } }; //最大値, 累積和, 左最大値, 右最大値 using S = array<ll, 4>; S op(S lhs, S rhs){ S res; res[1] = lhs[1] + rhs[1]; res[2] = max(lhs[2], lhs[1] + rhs[2]); res[3] = max(lhs[3] + rhs[1], rhs[3]); res[0] = max({lhs[0], rhs[0], lhs[3] + rhs[2], res[2], res[3]}); return res; } S e(){ return S({-INF, 0, -INF, -INF}); } int main(){ ios::sync_with_stdio(false); cin.tie(0); int n, Q, cmd; cin >> n; vector<ll> a(n), b(n), c = {0}; ll s = 0, l, r; for(int i = 0; i < n; i++){ cin >> a[i] >> b[i]; s += b[i]; c.emplace_back(s); } cin >> Q; vector<tuple<int, ll, ll>> query(Q); for(int i = 0; i < Q; i++){ cin >> cmd >> l >> r; query[i] = {--cmd, --l, r}; if(cmd == 0) c.emplace_back(l); else{ c.emplace_back(l); c.emplace_back(r); } } sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); int m = c.size(); vector<S> tmp(m, e()); s = 0; for(int i = 0, j = -1; i + 1 < m; i++){ if(c[i] == s) s += b[++j]; ll v = a[j] * (c[i + 1] - c[i]); tmp[i] = {max(v, a[j]), v, v, v}; } segtree<S, op, e> seg(tmp); for(int i = 0; i < Q; i++){ tie(cmd, l, r) = query[i]; l = lower_bound(c.begin(), c.end(), l) - c.begin(); if(cmd == 0){ seg.set(l, {r, r, r, r}); }else{ r = lower_bound(c.begin(), c.end(), r) - c.begin(); auto p = seg.prod(l, r); cout << p[0] << '\n'; } } }