//Dost SEFEROĞLU
#pragma GCC optimize("O3,unroll-loops,Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define vi vector<int>
const int N = 1e5+1, K = 2e2+1,inf = 1e18;
int dp[N][K];
bool Q;
struct Line {
mutable int a,b,p;
bool operator < (const Line& o) const{
return Q ? p < o.p : a < o.a;
};
};
struct CHT : multiset<Line> {
int div(int a,int b) {
return a/b - ((a^b) < 0 && a%b);
}
bool intersect(iterator x,iterator y) {
if (y == end()) return x->p = inf,0;
if (x->a == y->a) x->p = x->b <= y->b ? -inf : inf;
else x->p = div(y->b-x->b,x->a-y->a);
return x->p >= y->p;
}
void add(int a,int b) {
auto z = insert({a,b,0}),y = z++,x = y;
while (intersect(y,z)) z = erase(z);
if (x != begin() && intersect(--x,y)) intersect(x,y = erase(y));
while ((y = x) != begin() && (--x)->p >= y->p) intersect(x,erase(y));
}
int query(int x) {
Q = 1;
auto it = *lower_bound({0,0,x});
Q = 0;
return it.a*x+it.b;
}
};
void solve() {
int n,k;
cin >> n >> k;
vi a(n+1),p(n+1,0);
for (int i=1;i<=n;i++) cin >> a[i];
for (int i=1;i<=n;i++) p[i] = p[i-1]+a[i];
for (int j=1;j<=k;j++) {
CHT cht;
cht.add(0,0);
for (int i=1;i<=n;i++) {
dp[i][j] = cht.query(p[i]);
cht.add(p[i],dp[i][j-1]-(p[i]*p[i]));
}
}
cout << dp[n][k] << endl;
vi cuts;
int ptr = n,ptr2 = k;
while (ptr2) {
for (int j=1;j<=n;j++) {
if (dp[j][ptr2-1]+(p[ptr]-p[j])*p[j] == dp[ptr][ptr2]) {
cuts.push_back(j);
ptr = j;
ptr2--;
break;
}
}
}
reverse(cuts.begin(),cuts.end());
for (auto it : cuts) cout << it << " ";
cout << endl;
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 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 |
1 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 |
1 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 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 |
1 ms |
344 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 |
344 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 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 |
1 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 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 |
1 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
604 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
632 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
968 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
3 ms |
600 KB |
position 1 occurs twice in split scheme |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1880 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
17 ms |
1880 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1884 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
19 ms |
1884 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
17 ms |
1884 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
19 ms |
1884 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
18 ms |
2116 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
1884 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
1996 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
16704 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
16732 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
330 ms |
16988 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
13 ms |
16984 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
164 ms |
16732 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
201 ms |
16856 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
205 ms |
17008 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
172 ms |
16984 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
189 ms |
16732 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
242 ms |
16984 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
75 ms |
131072 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
