Submission #870486

#	Time	Username	Problem	Language	Result	Execution time	Memory
870486		KiaRez	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	348 KiB

segments

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

ll t, n, a[N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n;
	for(int i=1; i<=n; i++) cin>>a[i];
	ll ptr=1, lst=0, sum=0, num=0, ptr2=0;
	while(ptr <= n) {
		sum += a[ptr];
		if(sum>=lst) {
			while(ptr2<=n && lst+a[ptr2+1] <= sum-a[ptr2+1]) {
				sum-=a[ptr2+1];
				lst+=a[ptr2+1];
				ptr2++;
			}
			lst = sum;
			num++; sum = 0;
			ptr2 = ptr;
		}
		ptr++;
	}

	cout<<num<<endl;

	return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27