#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define N 100001
#define K 201
int ps[N];
pii dp[N][K];
struct Frac {
int n, d;
Frac(int num, int den) : n{num}, d{den} { if (d < 0) n = -n, d = -d; }
bool operator < (const Frac &o) const { return __int128_t(n)*__int128_t(o.d) < __int128_t(o.n)*__int128_t(d); }
};
struct Line {
int m, c, i;
Frac isect(const Line &o) const { return {c - o.c, o.m - m}; }
int operator () (const int x) const { return m*x + c; }
};
struct CHT {
deque<Line> hull;
void add(Line l){
while (hull.size() >= 2 && hull[1].isect(l) < hull[1].isect(hull[0]))
hull.pop_front();
hull.push_front(l);
}
pii query(int x){
while (hull.size() >= 2 && hull.back()(x) <= hull[hull.size()-2](x))
hull.pop_back();
return {hull.back()(x), hull.back().i};
}
};
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> ps[i];
ps[i] += ps[i-1];
}
CHT prv;
for (int i = 1; i <= n; i++)
prv.add({ps[i], -ps[i]*ps[i], i});
for (int l = 1; l <= k; l++){
CHT curr;
for (int i = 1; i <= n; i++){
dp[i][l] = prv.query(ps[i]);
curr.add({ps[i], dp[i][l].first - ps[i]*ps[i], i});
}
prv = curr;
}
cout << dp[n][k].first << '\n';
int curr = n;
for (int i = k; i > 0; i--){
cout << dp[curr][i].second << ' ';
curr = dp[curr][i].second;
}
cout << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Incorrect |
0 ms |
348 KB |
Integer 2 violates the range [1, 1] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
756 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
2 ms |
2904 KB |
Integer 200 violates the range [1, 199] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
7 ms |
4700 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
8 ms |
4696 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Incorrect |
6 ms |
4784 KB |
contestant didn't find the optimal answer: 4699030135 < 4699030287 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
33884 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
6 ms |
33884 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
69 ms |
34052 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
7 ms |
33880 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
50 ms |
34036 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Incorrect |
55 ms |
34044 KB |
contestant didn't find the optimal answer: 514786325281 < 514790755404 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
89 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |