#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Line{
ll a, b; int i;
Line() = default;
Line(ll a, ll b, int i) : a(a), b(b), i(i) {}
ll f(ll x){ return a * x + b; }
};
struct CHT{
vector<Line> v; int p;
CHT() : v(), p(0) {}
bool check(Line a, Line b, Line c){
return (a.b - c.b) * (b.a - a.a) <= (a.b - b.b) * (c.a - a.a);
}
void add(Line l){
while(p + 1 < v.size() && (v.back().b <= l.b || check(v[v.size()-2], v.back(), l))) v.pop_back();
v.push_back(l);
}
pair<ll, int> get(ll x){
while(p + 1 < v.size() && v[p].f(x) < v[p+1].f(x)) p++;
return {v[p].f(x), v[p].i};
}
};
int N, K, C[101010], P[101010];
ll A[101010];
ll D[101010];
pair<ll, int> Check(ll c){
CHT S;
S.add({0, 0, 0});
for(int i=1; i<=N; i++){
tie(D[i],P[i]) = S.get(A[i]);
D[i] += c; C[i] = C[P[i]] + 1;
S.add({A[i]*2, D[i] - 2*A[i]*A[i], i});
// S.add({A[i], D[i] - A[i]*A[i], i});
}
return {D[N], C[N]};
}
vector<int> Track(ll c){
Check(c); vector<int> ret;
for(int i=N; i; i=P[i]) ret.push_back(i);
ret.push_back(0); reverse(ret.begin(), ret.end());
return ret;
}
// given partition p, q (p.size() >= q.size()), return k partition
// 1-based, p[0] = q[0] = 0, range : ( v[i-1], v[i] ]
vector<int> AliensTrack(int k, vector<int> p, vector<int> q){
if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
vector<int> ret;
for(int i=1, j=1; i<p.size(); i++){
while(j < q.size() && p[i-1] > q[j]) j++;
if(p[i] <= q[j] && i - j == k - (int)q.size() + 1){
ret.insert(ret.end(), p.begin(), p.begin()+i);
ret.insert(ret.end(), q.begin()+j, q.end());
return ret;
}
}
assert(false);
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
cin >> N >> K; K++;
for(int i=1; i<=N; i++) cin >> A[i], A[i] += A[i-1];
ll l = -1e17, r = 1e17;
while(l < r){
ll m = (l + r + 1) / 2;
auto [dp,cnt] = Check(m*2+1);
if(cnt <= K) l = m; else r = m - 1;
}
auto P1 = Track(l*2+1), P2 = Track(l*2+3);
auto V = AliensTrack(K, P2, P1); assert(V.size() == K + 1);
ll R = 0;
for(int i=1; i+1<V.size(); i++) R += (A[V[i]] - A[V[i-1]]) * (A[N] - A[V[i]]);
cout << R << "\n";
for(int i=1; i+1<V.size(); i++) cout << V[i] << " ";
}
Compilation message
sequence.cpp: In member function 'void CHT::add(Line)':
sequence.cpp:19:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
19 | while(p + 1 < v.size() && (v.back().b <= l.b || check(v[v.size()-2], v.back(), l))) v.pop_back();
| ~~~~~~^~~~~~~~~~
sequence.cpp: In member function 'std::pair<long long int, int> CHT::get(ll)':
sequence.cpp:23:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | while(p + 1 < v.size() && v[p].f(x) < v[p+1].f(x)) p++;
| ~~~~~~^~~~~~~~~~
sequence.cpp: In function 'std::vector<int> AliensTrack(int, std::vector<int>, std::vector<int>)':
sequence.cpp:54:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
54 | if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
| ~~~~~~~~~^~~~~~~~
sequence.cpp:54:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
54 | if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
| ^~
sequence.cpp:54:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
54 | if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
| ^~
sequence.cpp:54:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
54 | if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
| ~~~~~~~~~^~~~~~~~
sequence.cpp:56:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | for(int i=1, j=1; i<p.size(); i++){
| ~^~~~~~~~~
sequence.cpp:57:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | while(j < q.size() && p[i-1] > q[j]) j++;
| ~~^~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:75:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
75 | auto [dp,cnt] = Check(m*2+1);
| ^
In file included from /usr/include/c++/10/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
from sequence.cpp:1:
sequence.cpp:79:54: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
79 | auto V = AliensTrack(K, P2, P1); assert(V.size() == K + 1);
| ~~~~~~~~~^~~~~~~~
sequence.cpp:81:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
81 | for(int i=1; i+1<V.size(); i++) R += (A[V[i]] - A[V[i-1]]) * (A[N] - A[V[i]]);
| ~~~^~~~~~~~~
sequence.cpp:83:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
83 | for(int i=1; i+1<V.size(); i++) cout << V[i] << " ";
| ~~~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 6 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 6 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
2 ms |
340 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
2 ms |
340 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
340 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
1044 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
11 ms |
1044 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
24 ms |
1436 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
17 ms |
1204 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
13 ms |
1044 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
11 ms |
1044 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
19 ms |
1404 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
16 ms |
1364 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
18 ms |
1168 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
18 ms |
1396 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
137 ms |
7696 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
145 ms |
7700 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Incorrect |
185 ms |
8164 KB |
contestant didn't find the optimal answer: 496781753454350046 < 497313449256899208 |
4 |
Halted |
0 ms |
0 KB |
- |