# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331027 | 2020-11-27T04:41:46 Z | leinad2 | Split the sequence (APIO14_sequence) | C++14 | 845 ms | 87388 KB |
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll n, i, j, k, t, a, A[100010], dp[100010][2]; struct line { ll a, b, index; }; vector<line>V; double cross(const line &p, const line &q) { return (double)(q.b-p.b)/(p.a-q.a); } void push(line x) { if(V.size()&&V.back().a==x.a) { if(V.back().b<x.b)V.back().b=x.b; return; } while(V.size()>=2) { if(cross(V.back(), V[V.size()-2])>cross(V.back(), x))V.pop_back(); else break; } V.push_back(x); } pair<ll, ll>query(ll x) { if(V.size()<=a)a=V.size()-1; else while(a+1<V.size()&&cross(V[a+1], V[a])<=x)a++; return {V[a].a*x+V[a].b, V[a].index}; } int backtrack[100010][210]; int main() { for(scanf("%lld %lld", &n, &k);i++<n;) { scanf("%lld", &A[i]); A[i]+=A[i-1]; } for(j=0;j++<k;) { for(a=i=0;i++<n;) { push({A[i], dp[i][0]-A[i]*A[i], i}); pair<ll, ll>p=query(A[i]); dp[i][1]=p.first; backtrack[i][j]=p.second; dp[i][0]=dp[i][1]; } V.clear(); } printf("%lld\n", dp[n][1]); i=n; j=k; vector<int>ans; while(j>0) { i=backtrack[i][j]; j--; ans.push_back(i); } while(ans.size()) { if(ans.back()>=n)ans.back()--; printf("%d ", ans.back()); ans.pop_back(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 1 ms | 364 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 1 ms | 492 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 2 ms | 492 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 1 ms | 492 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 1 ms | 492 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Incorrect | 2 ms | 492 KB | position 199 occurs twice in split scheme |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1260 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 1 ms | 1260 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 8 ms | 1260 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 1 ms | 1260 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 8 ms | 1260 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Correct | 7 ms | 1260 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
7 | Correct | 9 ms | 1260 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 | Correct | 7 ms | 1260 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
9 | Correct | 3 ms | 1260 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 | Correct | 4 ms | 1260 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 9132 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 7 ms | 9132 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Correct | 70 ms | 9192 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 | Correct | 7 ms | 9192 KB | contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 | Correct | 47 ms | 9132 KB | contestant found the optimal answer: 1085432199 == 1085432199 |
6 | Correct | 52 ms | 9132 KB | contestant found the optimal answer: 514790755404 == 514790755404 |
7 | Correct | 65 ms | 9192 KB | contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 | Correct | 55 ms | 9192 KB | contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 | Correct | 51 ms | 9096 KB | contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 | Correct | 64 ms | 9064 KB | contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 67 ms | 86876 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 68 ms | 86916 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Correct | 834 ms | 87388 KB | contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 | Correct | 70 ms | 87388 KB | contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 | Correct | 845 ms | 86876 KB | contestant found the optimal answer: 36183271951 == 36183271951 |
6 | Correct | 589 ms | 86876 KB | contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 | Correct | 720 ms | 87388 KB | contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 | Correct | 552 ms | 87388 KB | contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 | Correct | 573 ms | 87132 KB | contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 | Correct | 715 ms | 87132 KB | contestant found the optimal answer: 124309619349406845 == 124309619349406845 |