| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 135202 | 2019-07-23T19:46:28 Z | pedro_sponchiado | Split the sequence (APIO14_sequence) | C++17 | 2000 ms | 25372 KB |
#include<bits/stdc++.h>
using namespace std;
const long long int INF=112345678912345678;
const int maxn=10010;
const int maxk=210;
int n, d;
int a[maxn];
long long int parc[maxn], parc_2[maxn];
long long int s_2[maxn];
long long int S_2(int i, int j){
return s_2[j]-s_2[i-1]-parc[i-1]*(parc[j]-parc[i-1]);
}
long long int dp[maxn][maxk];
int opt[maxn][maxk];
int main(){
scanf("%d %d", &n, &d);
for(int i=1; i<=n; i++){
scanf("%d", &a[i]);
parc[i]=parc[i-1]+a[i];
parc_2[i]=parc_2[i-1]+a[i]*a[i];
s_2[i]=(parc[i]*parc[i]-parc_2[i])/2;
}
for(int i=1; i<=n; i++) dp[i][0]=s_2[i];
for(int k=1; k<=d; k++){
for(int i=1; i<=n; i++){
dp[i][k]=INF;
if(k>=i)continue;
for(int l=1; l<i; l++){
if(dp[i][k]>dp[l][k-1]+S_2(l+1, i)){
dp[i][k]=dp[l][k-1]+S_2(l+1, i);
opt[i][k]=l;
}
}
// printf("dp[%d][%d]=%lld\n", i, k, dp[i][k]);
}
}
printf("%lld\n", s_2[n]-dp[n][d]);
int at=n;
vector<int> aux;
for(int i=d; i>=1; i--){
aux.push_back(opt[at][i]);
at=opt[at][i];
}
for(int i=d-1; i>=0; i--) printf("%d ", aux[i]);
return 0;
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 380 KB | contestant found the optimal answer: 108 == 108 |
| 2 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 999 == 999 |
| 3 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 0 == 0 |
| 4 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 1542524 == 1542524 |
| 5 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 1 == 1 |
| 7 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 1 == 1 |
| 8 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 1 == 1 |
| 9 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 100400096 == 100400096 |
| 10 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 900320000 == 900320000 |
| 11 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 | Correct | 2 ms | 380 KB | contestant found the optimal answer: 140072 == 140072 |
| 14 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 376041456 == 376041456 |
| 15 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 805 == 805 |
| 16 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 900189994 == 900189994 |
| 17 | Correct | 2 ms | 380 KB | contestant found the optimal answer: 999919994 == 999919994 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 1093956 == 1093956 |
| 2 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 302460000 == 302460000 |
| 3 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 933702 == 933702 |
| 7 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 687136 == 687136 |
| 9 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 888 KB | contestant found the optimal answer: 610590000 == 610590000 |
| 2 | Correct | 3 ms | 888 KB | contestant found the optimal answer: 311760000 == 311760000 |
| 3 | Correct | 8 ms | 888 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 | Correct | 2 ms | 888 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 | Correct | 8 ms | 888 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 | Correct | 8 ms | 888 KB | contestant found the optimal answer: 107630884 == 107630884 |
| 7 | Correct | 8 ms | 888 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 | Correct | 4 ms | 888 KB | contestant found the optimal answer: 193556962 == 193556962 |
| 9 | Correct | 4 ms | 888 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 | Correct | 5 ms | 888 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 7 ms | 2808 KB | contestant found the optimal answer: 21503404 == 21503404 |
| 2 | Correct | 7 ms | 2912 KB | contestant found the optimal answer: 140412195 == 140412195 |
| 3 | Correct | 211 ms | 2908 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 | Correct | 7 ms | 2808 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 | Correct | 309 ms | 2808 KB | contestant found the optimal answer: 679388326 == 679388326 |
| 6 | Correct | 277 ms | 2808 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 | Correct | 209 ms | 2940 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 | Correct | 208 ms | 3012 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 | Correct | 54 ms | 2812 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 | Correct | 114 ms | 2936 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 856 ms | 25352 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 | Correct | 764 ms | 25336 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 | Execution timed out | 2061 ms | 25372 KB | Time limit exceeded |
| 4 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 3 ms | 632 KB | declared answer doesn't correspond to the split scheme: declared = 96, real = 2757000 |
| 2 | Halted | 0 ms | 0 KB | - |