Submission #497746

#	Time	Username	Problem	Language	Result	Execution time	Memory
497746		mansur	Bigger segments (IZhO19_segments)	C++14	100 / 100	79 ms	15956 KiB

segments

#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e14, N = 1e6 + 1, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
pii dp[N];

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n;
	cin >> n;
	int a[n + 1], pref[n + 1];
	pref[0] = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		pref[i] = pref[i - 1] + a[i];
	}
	dp[1] = {1, 1};
	for (int i = 1; i <= n; i++) {
		int sum = pref[i] - pref[dp[i].ss - 1] + pref[i];
		int l = i + 1, r = n, pos = 0;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (pref[mid] >= sum) {
				r = mid - 1;
				pos = mid;
			}else l = mid + 1;
		}
		if (pos) {
			if (dp[pos].ff < dp[i].ff + 1) {
				dp[pos] = {dp[i].ff + 1, i + 1};    
			}else if (dp[pos].ff == dp[i].ff + 1 && dp[pos].ss < i + 1) {
				dp[pos] = {dp[i].ff + 1, i + 1};
			}
		}
		pos = i + 1;
		if (dp[pos].ff < dp[i].ff) {
			dp[pos] = {dp[i].ff, dp[i].ss};    
		}else if (dp[pos].ff == dp[i].ff && dp[pos].ss < dp[i].ss) {
			dp[pos] = {dp[i].ff, dp[i].ss};
		}
	}
	cout << dp[n].ff;
} 

Compilation message (stderr)

segments.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
segments.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
segments.cpp:37:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   37 | main() {
      | ^~~~

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