| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 977093 | 2024-05-07T11:29:37 Z | Amaarsaa | Split the sequence (APIO14_sequence) | C++14 | 2000 ms | 32092 KB |
#include<bits/stdc++.h>
using namespace std;
using ll = long long ;
int main() {
// freopen("moocast.in", "r", stdin);
// freopen("moocast.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(NULL);
ll t, n, m, ans, s, mx, mx_cnt, x, y, r, p, i, j;
cin >> n >> m;
ll a[n + 2], dp[m + 2][n + 2], sum[n + 2];
sum[0] = 0;
for (i = 1; i <= n; i ++) {
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
dp[0][0] = 0;
ll Comes[m +2][n + 2];
for (i = 1; i <= n; i ++) dp[1][i] = sum[i] * (sum[n] - sum[i]), Comes[1][i] = 0;
for (i = 2; i <= m + 1; i ++) {
for (j = 1; j <= n; j ++) {
Comes[i][j] = 0;
dp[i][j] = 0;
for ( r = 1; r < j; r ++) {
if ( dp[i][j] <= dp[i - 1][r] + (sum[j] - sum[r]) * (sum[n] - sum[j])) {
Comes[i][j] = r;
dp[i][j] = dp[i - 1][r] + (sum[j] - sum[r]) * (sum[n] - sum[j]);
}
}
}
}
vector < ll > v;
cout << dp[m + 1][n] << endl;
i = m + 1;
j = n;
while (j != 0) {
v.push_back(j);
j = Comes[i][j];
i --;
}
reverse(v.begin(), v.end());
v.pop_back();
for ( ll X : v) cout << X << " ";
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | contestant found the optimal answer: 108 == 108 |
| 2 | Correct | 0 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 | 0 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 | 0 ms | 348 KB | contestant found the optimal answer: 1 == 1 |
| 8 | Correct | 1 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 | 0 ms | 348 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 | Correct | 0 ms | 348 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 | Correct | 1 ms | 348 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 | 600 KB | contestant found the optimal answer: 805 == 805 |
| 16 | Correct | 1 ms | 348 KB | contestant found the optimal answer: 900189994 == 900189994 |
| 17 | Correct | 0 ms | 348 KB | contestant found the optimal answer: 999919994 == 999919994 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | contestant found the optimal answer: 1093956 == 1093956 |
| 2 | Correct | 0 ms | 344 KB | contestant found the optimal answer: 302460000 == 302460000 |
| 3 | Correct | 0 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 | 0 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 | 348 KB | contestant found the optimal answer: 610590000 == 610590000 |
| 2 | Correct | 1 ms | 348 KB | contestant found the optimal answer: 311760000 == 311760000 |
| 3 | Correct | 5 ms | 860 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 | Correct | 0 ms | 348 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 | Correct | 3 ms | 860 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 | Correct | 4 ms | 860 KB | contestant found the optimal answer: 107630884 == 107630884 |
| 7 | Correct | 6 ms | 1080 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 | Correct | 1 ms | 348 KB | contestant found the optimal answer: 193556962 == 193556962 |
| 9 | Correct | 1 ms | 348 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 | Correct | 2 ms | 636 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 348 KB | contestant found the optimal answer: 21503404 == 21503404 |
| 2 | Correct | 2 ms | 536 KB | contestant found the optimal answer: 140412195 == 140412195 |
| 3 | Correct | 92 ms | 3600 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 | Correct | 2 ms | 344 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 | Correct | 94 ms | 3608 KB | contestant found the optimal answer: 679388326 == 679388326 |
| 6 | Correct | 82 ms | 3136 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 | Correct | 94 ms | 3416 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 | Correct | 94 ms | 3612 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 | Correct | 19 ms | 1116 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 | Correct | 39 ms | 1728 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 139 ms | 1372 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 | Correct | 139 ms | 1368 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 | Execution timed out | 2053 ms | 32092 KB | Time limit exceeded |
| 4 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 2053 ms | 9820 KB | Time limit exceeded |
| 2 | Halted | 0 ms | 0 KB | - |