結果

問題 No.2333 Slime Structure
ユーザー 👑 rin204rin204
提出日時 2023-06-11 20:34:40
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 270 ms / 3,000 ms
コード長 11,234 bytes
コンパイル時間 3,734 ms
コンパイル使用メモリ 271,632 KB
実行使用メモリ 74,620 KB
最終ジャッジ日時 2024-06-11 01:09:09
合計ジャッジ時間 14,126 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 120 ms
39,324 KB
testcase_03 AC 171 ms
63,768 KB
testcase_04 AC 180 ms
66,448 KB
testcase_05 AC 136 ms
61,052 KB
testcase_06 AC 203 ms
68,288 KB
testcase_07 AC 221 ms
72,348 KB
testcase_08 AC 217 ms
72,352 KB
testcase_09 AC 216 ms
72,348 KB
testcase_10 AC 213 ms
72,352 KB
testcase_11 AC 218 ms
72,352 KB
testcase_12 AC 213 ms
72,352 KB
testcase_13 AC 245 ms
72,344 KB
testcase_14 AC 217 ms
72,352 KB
testcase_15 AC 237 ms
72,344 KB
testcase_16 AC 219 ms
72,352 KB
testcase_17 AC 219 ms
72,348 KB
testcase_18 AC 244 ms
72,348 KB
testcase_19 AC 223 ms
72,344 KB
testcase_20 AC 244 ms
72,316 KB
testcase_21 AC 245 ms
72,476 KB
testcase_22 AC 268 ms
74,496 KB
testcase_23 AC 245 ms
74,508 KB
testcase_24 AC 268 ms
74,620 KB
testcase_25 AC 270 ms
74,492 KB
testcase_26 AC 237 ms
74,620 KB
testcase_27 AC 235 ms
74,496 KB
testcase_28 AC 235 ms
74,620 KB
testcase_29 AC 239 ms
74,496 KB
testcase_30 AC 237 ms
74,496 KB
testcase_31 AC 242 ms
74,488 KB
testcase_32 AC 193 ms
73,272 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// start A.cpp
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using ll  = long long;
using ull = unsigned long long;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));

#ifndef RIN__LOCAL
#define endl "\n"
#endif
#define spa ' '
#define len(A) A.size()
#define all(A) begin(A), end(A)

#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}

#define INT(...)                                                                                                                                                                                       \
    int __VA_ARGS__;                                                                                                                                                                                   \
    inp(__VA_ARGS__);
#define LL(...)                                                                                                                                                                                        \
    ll __VA_ARGS__;                                                                                                                                                                                    \
    inp(__VA_ARGS__);
#define STRING(...)                                                                                                                                                                                    \
    string __VA_ARGS__;                                                                                                                                                                                \
    inp(__VA_ARGS__);
#define CHAR(...)                                                                                                                                                                                      \
    char __VA_ARGS__;                                                                                                                                                                                  \
    inp(__VA_ARGS__);
#define VEC(T, A, n)                                                                                                                                                                                   \
    vector<T> A(n);                                                                                                                                                                                    \
    inp(A);
#define VVEC(T, A, n, m)                                                                                                                                                                               \
    vector<vector<T>> A(n, vector<T>(m));                                                                                                                                                              \
    inp(A);

const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

void FLUSH() {
    cout << flush;
}
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(forward<Tail>(tail)...);
}
template <typename T>
void print(vector<T> &A) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << ' ';
    }
    cout << endl;
}
template <typename T>
void print(vector<vector<T>> &A) {
    for (auto &row : A) print(row);
}
template <typename T, typename S>
void print(pair<T, S> &A) {
    cout << A.first << spa << A.second << endl;
}
template <typename T, typename S>
void print(vector<pair<T, S>> &A) {
    for (auto &row : A) print(row);
}
template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void priend(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}
template <class... T>
void inp(T &... a) {
    (cin >> ... >> a);
}
template <typename T>
void inp(vector<T> &A) {
    for (auto &a : A) cin >> a;
}
template <typename T>
void inp(vector<vector<T>> &A) {
    for (auto &row : A) inp(row);
}
template <typename T, typename S>
void inp(pair<T, S> &A) {
    inp(A.first, A.second);
}
template <typename T, typename S>
void inp(vector<pair<T, S>> &A) {
    for (auto &row : A) inp(row.first, row.second);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}
template <typename T>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// start data_structure/segTree.hpp

template <class S, S (*op)(S, S), S (*e)()>
struct segtree {
  public:
    segtree(vector<S> &v) : _n(int(v.size())) {
        size = 1;
        log  = 0;
        while (size < _n) {
            log++;
            size <<= 1;
        }
        d = 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);
    }

    segtree(int n) : segtree(vector<S>(n, e())){};

    void set(int p, S x) {
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        return d[p + size];
    }

    S prod(int l, int r) {
        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);
    }

  private:
    int _n, size, log;
    vector<S> d;
    void update(int k) {
        d[k] = op(d[2 * k], d[2 * k + 1]);
    }
};

// end data_structure/segTree.hpp
// restart A.cpp
struct S {
    ll len;
    ll sum;
    ll max;
    ll lmax;
    ll rmax;
};

S e() {
    return S{0, 0, 0, 0, 0};
}

S op(S l, S r) {
    if (l.len == 0) return r;
    if (r.len == 0) return l;
    S ret;
    ret.len  = l.len + r.len;
    ret.sum  = l.sum + r.sum;
    ret.max  = max({l.max, r.max, l.rmax + max(0LL, r.lmax), max(0LL, l.rmax) + r.lmax});
    ret.lmax = max(l.lmax, l.sum + r.lmax);
    ret.rmax = max(r.rmax, r.sum + l.rmax);
    return ret;
}

void solve() {
    INT(n);
    vec(ll, X, 1, 0);
    vec(ll, A, n);
    vec(ll, B, n);
    ll tot = 0;
    fori(i, n) {
        inp(B[i], A[i]);
        tot += A[i];
        A[i] = tot;
        X.push_back(tot);
    }
    INT(Q);
    vvec(ll, query, Q, 3);
    fori(i, Q) {
        LL(t, x, y);
        query[i] = {t, x, y};
        if (t == 1) {
            X.push_back(x - 1);
            X.push_back(x);
            X.push_back(x + 1);
        } else {
            X.push_back(x - 1);
            X.push_back(x);
            X.push_back(y);
            X.push_back(y + 1);
        }
    }
    X      = compression(X);
    int p  = 0;
    int le = len(X);
    ll add = B[0];

    vec(S, ini, le);
    fori(i, le - 1) {
        if (X[i] == A[p]) {
            p++;
            add = B[p];
        }
        ini[i].len = X[i + 1] - X[i];
        ini[i].sum = add * ini[i].len;
        ini[i].max = ini[i].lmax = ini[i].rmax = max(add, ini[i].sum);

        ll x = X[i];
    }
    segtree<S, op, e> seg(ini);
    auto res = seg.prod(0, le);

    fori(i, Q) {
        if (query[i][0] == 1) {
            ll x = query[i][1];
            ll y = query[i][2];
            x    = lower_bound(all(X), x) - X.begin();
            seg.set(x - 1, S{1, y, y, y, y});

        } else {
            ll l     = query[i][1];
            ll r     = query[i][2];
            l        = lower_bound(all(X), l) - X.begin();
            r        = lower_bound(all(X), r) - X.begin();
            auto res = seg.prod(l - 1, r);
            print(res.max);
        }
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}

// end A.cpp
0