# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
488158 | 2021-11-18T04:09:37 Z | ntabc05101 | Split the sequence (APIO14_sequence) | C++14 | 81 ms | 131076 KB |
#include<bits/stdc++.h> using namespace std; #define taskname "" const long long inf = 1e17; int main() { if (fopen(taskname".inp", "r")) { freopen(taskname".inp", "r", stdin); freopen(taskname".out", "w", stdout); } else { if (fopen(taskname".in", "r")) { freopen(taskname".in", "r", stdin); freopen(taskname".out", "w", stdout); } } cin.tie(0)->sync_with_stdio(0); int n, K; cin >> n >> K; long long a[n + 1]; a[0] = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] += a[i - 1]; } vector<long long> dp[n + 1]; function<bool(int, int, int, int)> chk = [&](int k, int i, int j, int t) { return (dp[i][k] - a[i] * a[i] - dp[j][k] + a[j] * a[j]) <= a[t] * (a[j] - a[i]); }; function<bool(int, int, int, int)> chk2 = [&](int k, int i, int j, int t) { return (dp[i][k] - a[i] * a[i] - dp[j][k] + a[j] * a[j]) * (a[t] - a[j]) >= (dp[j][k] - a[j] * a[j] - dp[t][k] + a[t] * a[t]) * (a[j] - a[i]); }; //K++; int prf[n + 1][K + 1]; memset(prf, 0, sizeof(prf)); long long res = 0; for (int i = 0; i <= n; i++) { dp[i].assign(K + 1, 0); } dp[0][0] = 0; deque<int> deq; for (int k = 1; k <= K; k++) { deq.clear(); deq.push_back(0); for (int i = 1; i <= n; i++) { while (deq.size() > 1 && chk(k - 1, deq[0], deq[1], i)) { deq.pop_front(); } int j = deq.front(); dp[i][k] = dp[j][k - 1] + (a[i] - a[j]) * a[j]; prf[i][k] = j; while (deq.size() > 1 && chk2(k - 1, deq[deq.size() - 2], deq.back(), i)) { deq.pop_back(); } deq.push_back(i); } } cout << dp[n][K] << "\n"; while (K > 0) { cout << prf[n][K] << " "; n = prf[n][K--]; } cout << "\n"; return 0; } /* 7 3 4 1 3 4 0 2 3 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 1 ms | 208 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 0 ms | 336 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 1 ms | 208 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 1 ms | 208 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 0 ms | 316 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 1 ms | 208 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 0 ms | 208 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 2 ms | 720 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 1 ms | 336 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 1 ms | 592 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Correct | 1 ms | 720 KB | contestant found the optimal answer: 107630884 == 107630884 |
7 | Correct | 1 ms | 720 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
8 | Correct | 1 ms | 336 KB | contestant found the optimal answer: 193556962 == 193556962 |
9 | Correct | 1 ms | 336 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
10 | Correct | 1 ms | 444 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 1 ms | 320 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 7 ms | 2640 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 1 ms | 336 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 11 ms | 2768 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Correct | 8 ms | 2256 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
7 | Correct | 9 ms | 2728 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 | Correct | 7 ms | 2640 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
9 | Correct | 2 ms | 828 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 | Correct | 4 ms | 1232 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 1268 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 3 ms | 1232 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Correct | 77 ms | 24272 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 | Correct | 3 ms | 1232 KB | contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 | Correct | 61 ms | 14952 KB | contestant found the optimal answer: 1085432199 == 1085432199 |
6 | Correct | 64 ms | 17232 KB | contestant found the optimal answer: 514790755404 == 514790755404 |
7 | Correct | 70 ms | 18452 KB | contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 | Correct | 54 ms | 15188 KB | contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 | Correct | 63 ms | 17300 KB | contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 | Correct | 81 ms | 21996 KB | contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 9864 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 25 ms | 10064 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Runtime error | 73 ms | 131076 KB | Execution killed with signal 9 |
4 | Halted | 0 ms | 0 KB | - |