#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <algorithm>
#include <deque>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair < ll, ll > pll;
const int N = 1e5 + 500;
const int K = 215;
inline bool ccw(const pll &A, const pll &B, const pll &C){
return (ld)A.X * (B.Y - C.Y) + (ld)B.X * (C.Y - A.Y) + (ld)C.X * (A.Y - B.Y) <= 0;
}
int ind[N], a[N];
pll hl[N];
int cur = 0, n, k;
ll P[N], lst[N], dp[N];
int rek[N], cur_k, sz, cnt[N];
ll cost, lo = 0, hi = 1e15;
inline void add(const pll &X,const int &i){
for(;sz >= 2 && ccw(X, hl[sz - 1], hl[sz - 2]); sz--);
hl[sz] = X; ind[sz++] = i;
cur = min(cur, sz - 1);
}
inline ll get(const int &i,const ll &x){
return hl[i].X * x + hl[i].Y;
}
inline int query(const ll &x){
if(sz == 0) return -1;
for(; cur + 1 < sz && get(cur, x) < get(cur + 1, x); cur++);
return cur;
}
inline int dinamika(){
sz = 0; cur = 0;
add({0, 0}, 0);
for(int i = 1;i <= n;i++){
int r = query(P[i]);
rek[i] = ind[r];
cnt[i] = cnt[ind[r]] + 1;
dp[i] = get(r, P[i]) - cost;
add({P[i], dp[i] - P[i] * P[i]}, i);
//printf("%lld ", dp[i]);
}
// printf("\n");
cur_k++;
return cnt[n] <= k;
}
int main(){
scanf("%d%d", &n, &k);
//if(n > 50000 && k > 150) return 0;
for(int i = 0;i < n;i++){
scanf("%d", a + i);
P[i + 1] = a[i] + P[i];
}
//lo = hi = 12;
cost = (lo + hi) / 2;
for(int i = 0;i < 60;i++){
if(dinamika()){
hi = cost;
}
else{
lo = cost;
}
cost = (lo + hi) / 2;
//if(lo == hi) break;
}
printf("%lld\n", dp[n] + cnt[n] * cost);
vector < int > fin;
int cur = n;
for(int i = 0;i < k;i++){
cur = rek[cur];
fin.PB(cur);
}
reverse(fin.begin(), fin.end());
for(int x : fin)
printf("%d ", x);
printf("\n");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &k);
~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + i);
~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
2 ms |
384 KB |
Integer 0 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 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 |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 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 |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Incorrect |
2 ms |
384 KB |
declared answer doesn't correspond to the split scheme: declared = 1019625839, real = 919185629 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Incorrect |
3 ms |
384 KB |
declared answer doesn't correspond to the split scheme: declared = 679388374, real = 579388374 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
640 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
11 ms |
868 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
13 ms |
768 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
13 ms |
768 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
15 ms |
768 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
13 ms |
768 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
13 ms |
768 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
12 ms |
768 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
109 ms |
4088 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
106 ms |
4088 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
84 ms |
5112 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Incorrect |
86 ms |
4856 KB |
declared answer doesn't correspond to the split scheme: declared = 477081933399915962, real = 123922369978600009 |
| 5 |
Halted |
0 ms |
0 KB |
- |
