# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282638 | 2020-08-24T16:30:45 Z | jainbot27 | Split the sequence (APIO14_sequence) | C++17 | 2000 ms | 32632 KB |
#include <bits/stdc++.h> using namespace std; #define int int64_t signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; vector<int> a(n+1), p(n+1); for(int i=0; i < n; i++){ cin >> a[i+1]; p[i+1] = p[i] + a[i+1]; } vector<vector<int64_t>> dp(n+1, vector<int64_t>(k+1, 0)); vector<vector<int64_t>> par(n + 1, vector<int64_t>(k + 1, 0)); int besti, bestj; int64_t ans = -1; for(int i=1; i <= n; i++){ for(int j=1; j <= k; j++){ for(int l = 0; l < i; l++){ if(dp[i][j] < dp[l][j-1] + (p[i]-p[l]) * (p[n]-p[i]) && !(j>1&&l==0)){ dp[i][j] = dp[l][j-1] + (p[i] - p[l]) * (p[n] - p[i]); par[i][j] = l; } if(j==k){ if(ans < dp[i][j]){ ans = dp[i][j]; besti = i; bestj = j; } } //cerr << "I: " << i << " J: " << j << " K: " << k << " P[i]: " << p[i] << " P[l-1] " << p[l-1] << "\n"; } //cerr << "(" << i << "," << j << ") " << dp[i][j] << "\n"; } } cout << ans << "\n"; assert(bestj == k); vector<int> res; for(int i=0; i < k; i++){ res.push_back(besti); besti = par[besti][bestj]; bestj--; } reverse(res.begin(), res.end()); for(int i : res){ cout << i << " "; } cout << "\n"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 0 ms | 384 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 15 ms | 1024 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 1 ms | 384 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 14 ms | 768 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Correct | 17 ms | 896 KB | contestant found the optimal answer: 107630884 == 107630884 |
7 | Correct | 14 ms | 1024 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
8 | Correct | 3 ms | 512 KB | contestant found the optimal answer: 193556962 == 193556962 |
9 | Correct | 3 ms | 384 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
10 | Correct | 6 ms | 512 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 512 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 3 ms | 512 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 344 ms | 3584 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 4 ms | 640 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 515 ms | 3616 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Correct | 460 ms | 3072 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
7 | Correct | 339 ms | 3584 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 | Correct | 338 ms | 3704 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
9 | Correct | 87 ms | 1024 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 | Correct | 184 ms | 1668 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 508 ms | 1960 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 261 ms | 2040 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Execution timed out | 2080 ms | 32632 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2088 ms | 15992 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |