Submission #161883

#	Time	Username	Problem	Language	Result	Execution time	Memory
161883		MvC	Bigger segments (IZhO19_segments)	C++11	0 / 100	4 ms	504 KiB

segments

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=5e5+50;
const int mod=1e9+7;
int n,i,nr,st,j;
ll l,sm,a[nmax];
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)cin>>a[i];
	l=0;
	st=1;
	for(i=1;i<=n;i++)
	{
		sm+=a[i];
		if(sm>=l)
		{
			nr++;
			for(j=st;j<i;j++)
			{
				if(sm-a[j]>=l+a[j])sm-=a[j],l+=a[j];
				else break;
			}
			//cout<<sm<<endl;
			l=sm;
			sm=0;
			st=i+1;
		}
	}
	cout<<nr<<endl;
	return 0;
}

Compilation message (stderr)

segments.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
segments.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

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