#define wiwihorz
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)
using namespace std;
#define lld long double
#define int long long int
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#ifdef wiwihorz
#define print(a...) cerr << "Line " << __LINE__ <<": ", kout("[" + string(#a) + "] = ", a)
void kout() {cerr << endl;}
void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else
#define print(...) 0
#define vprint(...) 0
#endif
#define a first
#define b second
namespace solver {
int n, k;
vector<int> dp[2], pre, a, pos;
vector<vector<signed>> rec;
vector<signed> ans;
int get_val(pii p, int x) {
return p.a * x + p.b;
}
bool check(pii i, pii j, pii k) {
return (i.a - j.a) * (k.b - i.b) <
(j.b - i.b) * (i.a - k.a);
}
void init_(int _n, int _k) {
n = _n, k = _k;
dp[0].assign(n + 1, 0);
dp[1].assign(n + 1, 0);
pre.assign(n + 1, 0);
a.assign(n + 1, 0);
ans.assign(n + 1, 0);
rec.assign(k + 10, vector<signed>(n + 1, 0));
}
void output(int y, int x) {
if(y != 2) output(y - 1, rec[y][x]);
cout << rec[y][x] << " \n"[y == k + 1];
}
void solve() {
vector<pii> q(n + 5, {0, 0});
pos.assign(n + 5, 0);
rep(i, 1, n) pre[i] = pre[i - 1] + a[i];
rep(l, 1, k + 1) {
int id = l & 1, L = 1, R = 1;
q[1] = {-pre[l - 1], dp[!id][l - 1]};
pos[1] = l - 1;
rep(i, l, n) {
int suf = pre[n] - pre[i];
while(L < R && get_val(q[L], suf) <=
get_val(q[L + 1], suf)) L ++;
dp[id][i] = get_val(q[L], suf) + pre[i] * suf;
rec[l][i] = pos[L];
pii cur = {-pre[i], dp[!id][i]};
while(R > L && !check(q[R - 1], q[R], cur)) R--;
q[++R] = cur, pos[R] = i;
}
}
cout << dp[(k + 1) & 1][n] << "\n";
output(k + 1, n);
}
};
using namespace solver;
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
int n, k;
cin >> n >> k;
init_(n, k);
rep(i, 1, n) cin >> a[i];
solve();
return 0;
}
Compilation message
sequence.cpp:3: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
3 | #pragma loop-opt(on)
|
sequence.cpp:25:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
25 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
| ^~~~
sequence.cpp:25:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
25 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
292 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
312 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 ms |
1100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
5 ms |
1200 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
972 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
4 ms |
1100 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
1100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
32 ms |
9116 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
29 ms |
5964 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
29 ms |
6812 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
31 ms |
7116 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
20 ms |
6092 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
24 ms |
6824 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
30 ms |
8368 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
11268 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
19 ms |
11272 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
277 ms |
88680 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
19 ms |
11204 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
445 ms |
88676 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
288 ms |
65104 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
315 ms |
69076 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
204 ms |
58036 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
227 ms |
65236 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
289 ms |
80840 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
