結果
| 問題 | No.2333 Slime Structure |
| ユーザー |
 siganai
|
| 提出日時 | 2023-05-28 16:03:16 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 9,315 bytes |
| コンパイル時間 | 3,165 ms |
| コンパイル使用メモリ | 216,176 KB |
| 実行使用メモリ | 52,980 KB |
| 最終ジャッジ日時 | 2024-06-08 09:14:56 |
| 合計ジャッジ時間 | 17,920 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
ソースコード
#line 1 "main.cpp"
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
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... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
F f;
REC(F &&f_) : f(forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;
#line 2 "library/segtree/segtree.hpp"
template <typename T, typename OP>
struct segtree {
int N;
int size;
vector<T> seg;
const OP op;
const T I;
segtree(OP _op, const T &I_) : N(0), size(0), op(_op), I(I_) {}
segtree(int _N, OP _op, const T &I_) : op(_op), I(I_) { init(_N); }
segtree(const vector<T> &v, OP _op, T I_) : op(_op), I(I_) {
init(v.size());
for (int i = 0; i < (int)v.size(); i++) {
seg[i + size] = v[i];
}
build();
}
void init(int _N) {
N = _N;
size = 1;
while (size < N) size <<= 1;
seg.assign(2 * size, I);
}
void build() {
for (int k = size - 1; k > 0; k--) {
seg[k] = op(seg[2 * k], seg[2 * k + 1]);
}
}
void set(int p, T x) {
assert(0 <= p && p < N);
p += size;
seg[p] = x;
while (p >>= 1) {
seg[p] = op(seg[2 * p], seg[2 * p + 1]);
}
}
void add(int p, T x) {
assert(0 <= p && p < N);
p += size;
seg[p] += x;
while (p >>= 1) {
seg[p] = op(seg[2 * p], seg[2 * p + 1]);
}
}
T get(int p) const {
assert(0 <= p && p < N);
return seg[p + size];
}
// query to [l, r)
T prod(int l, int r) {
assert(0 <= l && l <= r && r <= N);
T L = I, R = I;
for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
if (l & 1) L = op(L, seg[l++]);
if (r & 1) R = op(seg[--r], R);
}
return op(L, R);
}
T all_prod() {return seg[1];}
// check(a[l] * ... * a[r-1]) が true となる最大の r
// (右端まですべて true なら N を返す)
template <class C>
int max_right(int l, C check) {
assert(0 <= l && l <= N);
assert(check(I) == true);
if (l == N) return N;
l += size;
T sm = I;
do {
while (l % 2 == 0) l >>= 1;
if (!check(op(sm, seg[l]))) {
while (l < size) {
l = (2 * l);
if (check(op(sm, seg[l]))) {
sm = op(sm, seg[l]);
l++;
}
}
return l - size;
}
sm = op(sm, seg[l]);
l++;
} while ((l & -l) != l);
return N;
}
// check(a[l] * ... * a[r-1]) が true となる最小の l
// (左端まで true なら 0 を返す)
template <typename C>
int min_left(int r, C check) {
assert(0 <= r && r <= N);
assert(check(I) == true);
if (r == 0) return 0;
r += size;
T sm = I;
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!check(op(seg[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (check(op(seg[r], sm))) {
sm = op(seg[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(seg[r], sm);
} while ((r & -r) != r);
return 0;
}
};
#line 86 "main.cpp"
static const ll inf = 1e18;
struct T {
ll MAX,MAX_L,MAX_R,SUM;
};
T e() {return T{-inf,-inf,-inf,-inf};}
T op(T x,T y) {
if(x.MAX == -inf) return y;
if(y.MAX == -inf) return x;
T ret;
ret.SUM = x.SUM + y.SUM;
chmax(ret.MAX,max(x.MAX,y.MAX));
chmax(ret.MAX,x.MAX_R + y.MAX_L);
ret.MAX_L = x.MAX_L;
ret.MAX_R = y.MAX_R;
chmax(ret.MAX_L,x.SUM+y.MAX_L);
chmax(ret.MAX_R,y.SUM+x.MAX_R);
return ret;
}
int main() {
INT(n);
vl a(n),b(n);
vl tmp;
ll L = 0;
rep(i,n) {
cin >> a[i] >> b[i];
tmp.emplace_back(L);
L += b[i];
}
tmp.emplace_back(L);
INT(q);
vl cmd(q),lx(q),ry(q);
rep(i,q) {
cin >> cmd[i] >> lx[i] >> ry[i];
lx[i]--;
if(cmd[i] == 1) {
tmp.emplace_back(lx[i]);
tmp.emplace_back(lx[i]+1);
}
if(cmd[i] == 2) {
tmp.emplace_back(lx[i]);
tmp.emplace_back(ry[i]);
}
}
sort(all(tmp));
tmp.erase(unique(all(tmp)),tmp.end());
vector<T> init((int)tmp.size() - 1);
L = 0;
int now = 0;
rep(i,n) {
while(tmp[now + 1] - L <= b[i]) {
if(a[i] >= 0) {
init[now].SUM = init[now].MAX_L = init[now].MAX_R = init[now].MAX = a[i] * (tmp[now + 1] - tmp[now]);
}
else {
init[now].SUM = a[i] * (tmp[now + 1] - tmp[now]);
init[now].MAX_L = init[now].MAX_R = init[now].MAX = a[i];
}
now++;
}
L += b[i];
}
debug(L,now);
segtree<T,decltype(&op)> seg(init,op,e());
rep(i,q) {
if(cmd[i] == 1) {
int id = lower_bound(all(tmp),lx[i]) - tmp.begin();
seg.set(id,T{ry[i],ry[i],ry[i],ry[i]});
}
else {
int id1 = lower_bound(all(tmp),lx[i]) - tmp.begin();
int id2 = lower_bound(all(tmp),ry[i]) - tmp.begin();
cout << seg.prod(id1,id2).MAX << '\n';
}
}
}