Submission #781209

#	Time	Username	Problem	Language	Result	Execution time	Memory
781209		AdamGS	Mizuyokan 2 (JOI23_mizuyokan2)	C++17	0 / 100	69 ms	2256 KiB

mizuyokan2

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll INF=1e18+7;
int solve(vector<ll>T) {
	int n=T.size();
	ll ans=0, lst=0, sum=INF;
	rep(i, n) {
		if(sum>T[i] && sum>lst) {
			lst=T[i];
			sum=0;
			++ans;
		} else {
			if(sum<=lst && sum+T[i]>lst) ++ans;
			sum+=T[i];
		}
	}
	ll ans2=0; lst=0; sum=0;
	rep(i, n) {
		if(sum>T[i] && sum>lst) {
			lst=T[i];
			sum=0;
			++ans2;
		} else {
			if(sum<=lst && sum+T[i]>lst) ++ans2;
			sum+=T[i];
		}
	}
	return max(ans, ans2);
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	vector<ll>T(n);
	rep(i, n) cin >> T[i];
	int q;
	cin >> q;
	while(q--) {
		ll x, y, a, b;
		cin >> x >> y >> a >> b; --x; --b;
		T[x]=y;
		vector<ll>P;
		while(a<=b) {
			P.pb(T[a]);
			++a;
		}
		cout << solve(P) << '\n';
	}
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 32
• Subtask 5: 0 / 29
• Subtask 6: 0 / 11