Submission #676176

#	Time	Username	Problem	Language	Result	Execution time	Memory
676176		armashka	Cigle (COI21_cigle)	C++17	48 / 100	1082 ms	13340 KiB

cigle

#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define ft first
#define sd second
#define ll int
#define pll pair<ll,ll>
const int N = 2e5 + 5;
const int M = 1e7 + 5;
const ll mod = 1e9 + 7;
const ll inf = 1e9;

ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x);x=binmul(x,x);ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }

ll n, a[5005], dp[5005][5005], pr[5005];
bool used[5005][5005];

void check(ll l, ll r) {
	if (used[l][r]) return;
	used[l][r] = 1;

	int j = l, cnt = 0, sum = 0;
	for (int i = l - 1; i >= 1; -- i) {
		while (pr[l - 1] - pr[i - 1] > sum && j <= r) sum += a[j++];
		if (!used[i][l - 1]) check(i, l - 1);
		dp[l][r] = max(dp[l][r], dp[i][l - 1] + cnt);
		if (pr[l - 1] - pr[i - 1] == sum && j <= r) ++ cnt;			
	}
}

const void solve() {
	cin >> n;
	for (int i = 1; i <= n; ++ i) cin >> a[i], pr[i] = pr[i - 1] + a[i];
	for (int i = 1; i <= n; ++ i) used[1][i] = 1;
	ll ans = 0;
	for (int i = 1; i <= n; ++ i) {
		if (!used[i][n]) check(i, n);
		ans = max(ans, dp[i][n]);
	} 
	cout << ans;
}

int main() {
   	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	srand(time(NULL));
    
	ll tt = 1;
	// cin >> tt; 

	while (tt --) solve();

	return 0;
}

Compilation message (stderr)

cigle.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization("O3")
      | 
cigle.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization("unroll-loops")
      | 
cigle.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 13 / 13
• Subtask 4: 15 / 15
• Subtask 5: 0 / 52