/**
* author: hashman
* created:
**/
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
int64_t inf = 1e17;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> p(n + 1);
for (int i = 1; i <= n; i++) {
p[i] = p[i - 1] + a[i];
}
auto cost = [&](int l, int r) {
return ((int64_t) (p[r] - p[l - 1]) * (p[r] - p[l - 1]));
};
k++;
vector<vector<int64_t>> dp(n + 1, vector<int64_t>(k + 1, inf));
dp[0][0] = 0;
vector<vector<int>> pr(n + 1, vector<int>(k + 1));
auto compute = [&](auto&& self, int at, int l, int r, int bl, int br) -> void {
if (l > r) {
return;
}
int m = (l + r) / 2;
pair<int64_t, int> best = make_pair(inf, -1);
for (int i = bl; i <= min(m, br); i++) {
best = min(best, make_pair(dp[i - 1][at - 1] + cost(i, m), i));
}
pr[m][at] = best.second - 1;
dp[m][at] = best.first;
self(self, at, l, m - 1, bl, br);
self(self, at, m + 1, r, bl, br);
};
for (int i = 1; i <= k; i++) {
compute(compute, i, 1, n, 1, n);
}
cout << ((int64_t) p[n] * p[n] - dp[n][k]) / 2 << '\n';
int cur = n;
vector<int> splits;
while (cur != 0) {
cur = pr[cur][k];
k--;
if (cur != 0) {
splits.push_back(cur);
}
}
reverse(splits.begin(), splits.end());
for (int split : splits) {
cout << split << " ";
}
cout << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
452 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
944 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
604 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
1112 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
860 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
604 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
344 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
4 ms |
348 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
140 ms |
2872 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
348 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
146 ms |
2648 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
133 ms |
2392 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
146 ms |
2904 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
139 ms |
2648 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
37 ms |
860 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
58 ms |
1372 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
284 ms |
1780 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
358 ms |
1624 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2024 ms |
24920 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2043 ms |
13660 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
