Submission #162164

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
162164	2019-11-06T19:09:29 Z	kostia244	Split the sequence (APIO14_sequence)	C++14	0 / 100	41 ms	6600 KB

sequence

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MK = 220, MN = 1e5 + 3;
ll n, a[MN], pref[MN], dp[MK][MN], p[MK][MN];
ll f(ll l, ll r, ll i) {
	ll a = pref[i] - pref[l - 1];
	ll b = pref[r] - pref[i];
	return a * b;
}
void bt(int a, int b) {
	if (b > n)
		exit(-1);
	cout << b << " ";
	if (a > 1)
		bt(a - 1, p[a][b]);
}
#define val(j) (dp[a - 1][(j) - 1] + f(j, n, i))
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		cin >> a[i], pref[i] = pref[i - 1] + a[i];
	ll ans = -1, g = n - 1;
	for (int a = 1; a <= k; a++) {
		for (int i = 1; i < n; i++) {
			int j =1;
			while(val(j+1) >= val(j)) {
				for(int k= 1<<17; k; k>>=1)
					if(j+k+1<=i&&val(j+k+1)>=val(j+k))
						j+=k;
				j++;
			}
			dp[a][i] = val(j);
			p[a][i] = j - 1;
			ans = max(ans, dp[a][i]);
			if (ans == dp[a][i])
				g = i;
		}
	}

	cout << ans << '\n';
	bt(k, g);
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	contestant found the optimal answer: 108 == 108
2	Correct	2 ms	376 KB	contestant found the optimal answer: 999 == 999
3	Correct	2 ms	376 KB	contestant found the optimal answer: 0 == 0
4	Correct	2 ms	376 KB	contestant found the optimal answer: 1542524 == 1542524
5	Correct	2 ms	504 KB	contestant found the optimal answer: 4500000000 == 4500000000
6	Correct	2 ms	376 KB	contestant found the optimal answer: 1 == 1
7	Incorrect	18 ms	376 KB	declared answer doesn't correspond to the split scheme: declared = 1, real = 0
8	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	contestant found the optimal answer: 1093956 == 1093956
2	Correct	7 ms	376 KB	contestant found the optimal answer: 302460000 == 302460000
3	Correct	2 ms	1016 KB	contestant found the optimal answer: 122453454361 == 122453454361
4	Correct	2 ms	376 KB	contestant found the optimal answer: 93663683509 == 93663683509
5	Incorrect	2 ms	504 KB	contestant didn't find the optimal answer: 1005304583 < 1005304678
6	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	2 ms	376 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	7 ms	3192 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Correct	2 ms	376 KB	contestant found the optimal answer: 1499437552673 == 1499437552673
5	Incorrect	6 ms	2296 KB	contestant didn't find the optimal answer: 1019625814 < 1019625819
6	Halted	0 ms	0 KB	-