結果
問題 | No.2333 Slime Structure |
ユーザー |
![]() |
提出日時 | 2023-05-28 14:43:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 266 ms / 3,000 ms |
コード長 | 10,330 bytes |
コンパイル時間 | 2,370 ms |
コンパイル使用メモリ | 176,336 KB |
最終ジャッジ日時 | 2025-02-13 11:57:50 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 31 |
ソースコード
#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<unordered_set>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>#include<chrono>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;//ll mod = 1;constexpr ll mod = 998244353;//constexpr ll mod = 1000000007;const int mod17 = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;using ld = long double;typedef pair<ld, ld> LDP;const ld eps = 1e-10;const ld pi = acosl(-1.0);template<typename T>void chmin(T& a, T b) {a = min(a, b);}template<typename T>void chmax(T& a, T b) {a = max(a, b);}template<typename T>vector<T> vmerge(vector<T>& a, vector<T>& b) {vector<T> res;int ida = 0, idb = 0;while (ida < a.size() || idb < b.size()) {if (idb == b.size()) {res.push_back(a[ida]); ida++;}else if (ida == a.size()) {res.push_back(b[idb]); idb++;}else {if (a[ida] < b[idb]) {res.push_back(a[ida]); ida++;}else {res.push_back(b[idb]); idb++;}}}return res;}template<typename T>void cinarray(vector<T>& v) {rep(i, v.size())cin >> v[i];}template<typename T>void coutarray(vector<T>& v) {rep(i, v.size()) {if (i > 0)cout << " "; cout << v[i];}cout << "\n";}ll mod_pow(ll x, ll n, ll m = mod) {if (n < 0) {ll res = mod_pow(x, -n, m);return mod_pow(res, m - 2, m);}if (abs(x) >= m)x %= m;if (x < 0)x += m;//if (x == 0)return 0;ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}//mod should be <2^31struct modint {int n;modint() :n(0) { ; }modint(ll m) {if (m < 0 || mod <= m) {m %= mod; if (m < 0)m += mod;}n = m;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }bool operator<(modint a, modint b) { return a.n < b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }modint operator/=(modint& a, modint b) { a = a / b; return a; }const int max_n = 1 << 20;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}modint combP(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[a - b];}ll gcd(ll a, ll b) {a = abs(a); b = abs(b);if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}template<typename T>void addv(vector<T>& v, int loc, T val) {if (loc >= v.size())v.resize(loc + 1, 0);v[loc] += val;}/*const int mn = 2000005;bool isp[mn];vector<int> ps;void init() {fill(isp + 2, isp + mn, true);for (int i = 2; i < mn; i++) {if (!isp[i])continue;ps.push_back(i);for (int j = 2 * i; j < mn; j += i) {isp[j] = false;}}}*///[,val)template<typename T>auto prev_itr(set<T>& st, T val) {auto res = st.lower_bound(val);if (res == st.begin())return st.end();res--; return res;}//[val,)template<typename T>auto next_itr(set<T>& st, T val) {auto res = st.lower_bound(val);return res;}using mP = pair<modint, modint>;mP operator+(mP a, mP b) {return { a.first + b.first,a.second + b.second };}mP operator+=(mP& a, mP b) {a = a + b; return a;}mP operator-(mP a, mP b) {return { a.first - b.first,a.second - b.second };}mP operator-=(mP& a, mP b) {a = a - b; return a;}LP operator+(LP a, LP b) {return { a.first + b.first,a.second + b.second };}LP operator+=(LP& a, LP b) {a = a + b; return a;}LP operator-(LP a, LP b) {return { a.first - b.first,a.second - b.second };}LP operator-=(LP& a, LP b) {a = a - b; return a;}mt19937 mt(time(0));const string drul = "DRUL";string senw = "SENW";//DRUL,or SENW//int dx[4] = { 1,0,-1,0 };//int dy[4] = { 0,1,0,-1 };//-----------------------------------------template<typename T>struct SegT {private:int sz; vector<T> node;T init_c;function<T(T, T)> f;public:SegT(vector<T> v, T _init_c, function<T(T, T)> _f) {init_c = _init_c; f = _f;int n = v.size();sz = 1;while (sz < n)sz *= 2;node.resize(2 * sz - 1, init_c);rep(i, n) {node[i + sz - 1] = v[i];}per(i, sz - 1) {node[i] = f(node[2 * i + 1], node[2 * i + 2]);}}SegT(int n, T _init_c, function<T(T, T)> _f) {init_c = _init_c; f = _f;sz = 1;while (sz < n)sz *= 2;node.resize(2 * sz - 1, init_c);}void update(int k, T a) {k += sz - 1;node[k] = a;while (k > 0) {k = (k - 1) / 2;node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);}}T query(int a, int b, int k = 0, int l = 0, int r = -1) {if (r < 0)r = sz;if (r <= a || b <= l)return init_c;else if (a <= l && r <= b)return node[k];else {T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);return f(vl, vr);}}//k以上でf(x,node[y+sz-1])をtrueにするような最小のyint searchloc(int le, T x, function<bool(T, T)> comp) {int k = le + sz - 1;if (comp(x, node[k]))return le;x = f(x, node[k]);while (k > 0) {int mem = k;k = (k - 1) / 2;if (2 * k + 1 == mem) {if (comp(x, node[2 * k + 2])) {k = 2 * k + 2; break;}x = f(x, node[2 * k + 2]);}}if (k == 0)return sz;while (k < sz - 1) {if (comp(x, node[2 * k + 1])) {k = 2 * k + 1;}else {x = f(x, node[2 * k + 1]);k = 2 * k + 2;}}return k - (sz - 1);}};struct Data {ll vl, vr, vm;ll sum;ll ma;};void solve() {function<Data(Data, Data)> merge = [&](Data a, Data b) {Data res;res.vl = max(a.vl, a.sum + b.vl);res.vr = max(b.vr, b.sum + a.vr);res.vm = max({ a.vm,b.vm,a.vr + b.vl });res.sum = a.sum + b.sum;res.ma = max(a.ma, b.ma);return res;};int n; cin >> n;vector<int> a(n), b(n);rep(i, n)cin >> a[i] >> b[i];vector<ll> vx;ll sum = 0;rep(i, n) {vx.push_back(sum);sum += b[i];}vx.push_back(sum);int q; cin >> q;vector<int> typ(q);vector<ll> l(q), r(q);rep(i, q) {cin >> typ[i] >> l[i] >> r[i];if (typ[i] == 1) {l[i]--;vx.push_back(l[i]);vx.push_back(l[i] + 1);}else {l[i]--;vx.push_back(l[i]);vx.push_back(r[i]);}}sort(all(vx));vx.erase(unique(all(vx)), vx.end());vector<Data> ori(vx.size()-1);sum = 0;rep(i, n) {int le = lower_bound(all(vx), sum) - vx.begin();sum += b[i];int ri = lower_bound(all(vx), sum) - vx.begin();Rep(j, le, ri) {ll num = vx[j + 1] - vx[j];Data cur;cur.sum = num * a[i];cur.vl = max(0ll, cur.sum);cur.vr = cur.vl;cur.vm = cur.vl;cur.ma = a[i];ori[j] = cur;}}Data e;e.sum = 0;e.vl = 0; e.vr = 0; e.vm = 0; e.ma = -INF;SegT<Data> st(ori, e, merge);rep(i, q) {if (typ[i] == 1) {int loc = lower_bound(all(vx), l[i]) - vx.begin();Data cur;cur.sum = r[i];cur.vl = max(0ll, r[i]);cur.vr = cur.vl;cur.vm = cur.vl;cur.ma = r[i];st.update(loc, cur);}else {int le = lower_bound(all(vx), l[i]) - vx.begin();int ri = lower_bound(all(vx), r[i]) - vx.begin();Data d = st.query(le, ri);ll ans = d.vm;if (d.ma < 0)ans = d.ma;cout << ans << "\n";}}}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(15);//init_f();//init();//while(true)//expr();//int t; cin >> t; rep(i, t)solve();return 0;}