#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) static_cast<int>((x).size())
template<class T, size_t D>
struct vec : vector<vec<T, D - 1>> {
template<class... Args>
vec(size_t n = 0, Args... args)
: vector<vec<T, D - 1>>(n, vec<T, D - 1>(args...)) {}
};
template<class T>
struct vec<T, 1> : vector<T> {
template<class... Args>
vec(Args... args)
: vector<T>(args...) {}
};
template<class T>
inline bool Minimize(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T>
inline bool Maximize(T& a, const T& b) { return a < b ? a = b, true : false; }
inline int Next(int i, int n) { return i == n - 1 ? 0 : i + 1; }
inline int Prev(int i, int n) { return !i ? n - 1 : i - 1; }
mt19937 rng(static_cast<uint32_t>(chrono::steady_clock::now().time_since_epoch().count()));
struct Line {
int a;
int64_t b;
int label;
Line(int t_a = 0, int64_t t_b = 0, int t_label = 0)
: a(t_a),
b(t_b),
label(t_label) {}
int64_t y(int x) { return static_cast<int64_t>(a) * x + b; }
};
struct ConvexHullTrick {
vector<Line> lines;
int index_line;
ConvexHullTrick()
: lines(),
index_line(-1) {}
bool Bad(Line line_1, Line line_2, Line line_3) {
return static_cast<double>(line_1.b - line_3.b) / (line_3.a - line_1.a) <= static_cast<double>(line_1.b - line_2.b) / (line_2.a - line_1.a);
}
void AddLine(Line line) {
if (SZ(lines) && line.a == lines.back().a) {
if (line.b <= lines.back().b) {
return;
}
lines.pop_back();
Minimize(index_line, SZ(lines) - 1);
}
while (SZ(lines) > 1 && Bad(lines.rbegin()[1], lines.back(), line)) {
lines.pop_back();
Minimize(index_line, SZ(lines) - 1);
}
lines.emplace_back(line);
}
int Get(int x) {
for (; index_line + 1 < SZ(lines) && (!~index_line || lines[index_line].y(x) < lines[index_line + 1].y(x)); ++index_line);
return index_line;
}
};
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, n_cuts; cin >> n >> n_cuts;
vec<int, 1> prefix_sums(n + 1);
for (int i = 0; i < n; ++i) {
int a; cin >> a;
prefix_sums[i + 1] = prefix_sums[i] + a;
}
vec<int64_t, 1> f(n + 1), next_f(n + 1);
vec<int, 2> trace(n_cuts + 1, n + 1);
for (int i = 1; i <= n_cuts; ++i) {
ConvexHullTrick cht;
for (int j = i + 1; j <= n; ++j) {
cht.AddLine(Line(prefix_sums[j - 1], f[j - 1] - static_cast<int64_t>(prefix_sums[j - 1]) * prefix_sums[j - 1], j - 1));
int index_line = cht.Get(prefix_sums[j]);
assert(~index_line);
next_f[j] = cht.lines[index_line].y(prefix_sums[j]);
trace[i][j] = cht.lines[index_line].label;
}
f.swap(next_f);
}
cout << f[n] << '\n';
vec<int, 1> positions;
for (int i = n_cuts, j = n; i; --i) {
positions.emplace_back((j = trace[i][j]));
}
reverse(ALL(positions));
for (auto& position : positions) {
cout << position << ' ';
}
cout << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1280 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1112 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1112 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
73 ms |
9384 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
1340 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
46 ms |
5992 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
44 ms |
6468 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
74 ms |
7140 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
51 ms |
6040 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
56 ms |
6736 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
71 ms |
8304 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
8824 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
25 ms |
8904 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
877 ms |
87472 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
24 ms |
9876 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
995 ms |
86696 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
377 ms |
61164 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
784 ms |
67620 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
611 ms |
56384 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
630 ms |
63576 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
790 ms |
79316 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
