結果

問題 No.2333 Slime Structure
ユーザー woodywoodywoodywoody
提出日時 2023-06-02 19:58:03
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 814 ms / 3,000 ms
コード長 5,370 bytes
コンパイル時間 4,451 ms
コンパイル使用メモリ 244,032 KB
実行使用メモリ 71,428 KB
最終ジャッジ日時 2024-06-08 22:00:34
合計ジャッジ時間 28,420 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 327 ms
37,508 KB
testcase_03 AC 396 ms
45,976 KB
testcase_04 AC 501 ms
45,628 KB
testcase_05 AC 345 ms
40,408 KB
testcase_06 AC 536 ms
48,960 KB
testcase_07 AC 654 ms
71,172 KB
testcase_08 AC 653 ms
71,300 KB
testcase_09 AC 646 ms
71,296 KB
testcase_10 AC 642 ms
71,300 KB
testcase_11 AC 670 ms
71,300 KB
testcase_12 AC 667 ms
71,300 KB
testcase_13 AC 665 ms
71,168 KB
testcase_14 AC 667 ms
71,300 KB
testcase_15 AC 671 ms
71,300 KB
testcase_16 AC 673 ms
71,288 KB
testcase_17 AC 673 ms
71,172 KB
testcase_18 AC 678 ms
71,300 KB
testcase_19 AC 653 ms
71,300 KB
testcase_20 AC 657 ms
71,168 KB
testcase_21 AC 676 ms
71,168 KB
testcase_22 AC 789 ms
71,172 KB
testcase_23 AC 782 ms
71,172 KB
testcase_24 AC 792 ms
71,176 KB
testcase_25 AC 776 ms
71,172 KB
testcase_26 AC 769 ms
71,300 KB
testcase_27 AC 765 ms
71,300 KB
testcase_28 AC 814 ms
71,172 KB
testcase_29 AC 783 ms
71,172 KB
testcase_30 AC 773 ms
71,428 KB
testcase_31 AC 769 ms
71,296 KB
testcase_32 AC 604 ms
71,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

struct state{
	ll l,r,mx,sum;
 
	state(ll l=0,ll r=0,ll mx=0,ll sum=0) : l(l),r(r),mx(mx),sum(sum) {}
 
	// bool operator<(state const &ot) const{
	// 	return r < ot.r;
	// }
};

state op(state a,state b){
	state c;
	c.sum = a.sum+b.sum;
	c.l = max(a.l, a.sum+b.l);
	c.r = max(b.r, b.sum+a.r);
	c.mx = max({a.mx, b.mx, a.r+b.l, a.r, b.l});
	return c;
}

state e(){
	state c(-LINF,-LINF,-LINF,0);
	return c;
}

void solve(){
	int n; cin>>n;
	ll now = 0;
	map<ll,int> mp;
	mp[now] = 0;
	vl a(n),b(n);
	rep(i,n) cin>>a[i]>>b[i];
	rep(i,n){
		now += b[i];
		mp[now] = 0;
	}
	int q; cin>>q;
	vl t(q),x(q),y(q);
	rep(i,q){
		cin>>t[i]>>x[i]>>y[i];
		if (t[i]==1){
			x[i]--;
			mp[x[i]] = 0;
			mp[x[i]+1] = 0;
		}else{
			x[i]--;
			y[i]--;
			mp[x[i]] = 0;
			mp[y[i]+1] = 0;
		}
	}


	vl sum(n);
	rep(i,n){
		// show(i);
		sum[i] = b[i];
		if (i) sum[i] += sum[i-1];
	}
	mp[sum[n-1]] = 0;
	int idx = 0;
	int m = 0;
	vl mpb;
	// test(1);
	fore(y,mp){
		y.se = m++;
		mpb.pb(y.fi);
	}
	// test(2);
	segtree<state,op,e> sg(m-1);
	rep(i,m-1){
		while(mpb[i]>=sum[idx]) idx++;
		ll len = mpb[i+1]-mpb[i];
		state c;
		c.sum = len*a[idx];
		c.l = c.r = c.mx = max(a[idx], c.sum);
		sg.set(i,c);
	}
// test(3);
	vl ans;
	rep(i,q){
		if (t[i]==1){
			int id = mp[x[i]];
			state c;
			c.sum = y[i];
			c.l = c.r = c.mx = c.sum;
			sg.set(id,c);
		}else{
			int lid = mp[x[i]];
			int rid = mp[y[i]+1];
			state c = sg.prod(lid, rid);
			ans.pb(c.mx);
		}
	}
	fore(y , ans) cout << y << endl;

	return;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	//cin>>t;

	rep(i,t){
		solve();
	}

	return 0;
}
0