# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
700266 | 2023-02-19T04:42:41 Z | nguyentunglam | Split the sequence (APIO14_sequence) | C++17 | 879 ms | 81472 KB |
#include<bits/stdc++.h> #define fi first #define se second #define endl "\n" #define ii pair<int, int> using namespace std; const int N = 1e5 + 2; long long f[N], g[N], s[N]; int used[210][N]; struct line { long long m, c; int trace; long long eval(long long x) { return m * x + c; } long long calcx (line l) { return (c - l.c) / (l.m - m); } }; int main() { #define task "" cin.tie(0) -> sync_with_stdio(0); if (fopen ("task.inp", "r")) { freopen ("task.inp", "r", stdin); freopen ("task.out", "w", stdout); } if (fopen (task".inp", "r")) { freopen (task".inp", "r", stdin); freopen (task".out", "w", stdout); } int n, k; cin >> n >> k; ++k; for(int i = 1; i <= n; i++) { cin >> s[i]; s[i] += s[i - 1]; } for(int j = 1; j <= k; j++) { deque<line> dq; dq.push_back({0, 0, 0}); for(int i = 1; i <= n; i++) { while (dq.size() >= 2 && dq.back().eval(s[i]) <= dq[dq.size() - 2].eval(s[i])) dq.pop_back(); f[i] = dq.back().eval(s[i]) + s[i] * s[n] - s[i] * s[i]; used[j][i] = dq.back().trace; line cur = {s[i], g[i] - s[i] * s[n], i}; if (!dq.empty() && dq.front().m == cur.m) { if (cur.c >= dq.front().c) dq.pop_front(); else continue; } while (dq.size() >= 2 && cur.calcx(dq[0]) <= dq[0].calcx(dq[1])) dq.pop_front(); dq.push_front(cur); } for(int i = 1; i <= n; i++) g[i] = f[i]; } cout << g[n] << endl; int cur = n, j = k; for(int j = k; j >= 2; j--) { cur = used[j][cur]; cout << cur << " "; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 1 ms | 388 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 1 ms | 596 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 1 ms | 464 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 1 ms | 468 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 2 ms | 1364 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 2 ms | 1108 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Correct | 2 ms | 1364 KB | contestant found the optimal answer: 107630884 == 107630884 |
7 | Correct | 3 ms | 1408 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
8 | Correct | 1 ms | 596 KB | contestant found the optimal answer: 193556962 == 193556962 |
9 | Correct | 1 ms | 468 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
10 | Correct | 2 ms | 596 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 1 ms | 340 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 6 ms | 2004 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 0 ms | 340 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 7 ms | 2016 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Correct | 6 ms | 1748 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
7 | Correct | 7 ms | 2004 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 | Correct | 5 ms | 2132 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
9 | Correct | 2 ms | 724 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 | Correct | 3 ms | 980 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 852 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 2 ms | 852 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Correct | 67 ms | 9428 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 | Correct | 3 ms | 852 KB | contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 | Correct | 57 ms | 5924 KB | contestant found the optimal answer: 1085432199 == 1085432199 |
6 | Correct | 54 ms | 6740 KB | contestant found the optimal answer: 514790755404 == 514790755404 |
7 | Correct | 73 ms | 7220 KB | contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 | Correct | 41 ms | 6024 KB | contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 | Correct | 57 ms | 6764 KB | contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 | Correct | 66 ms | 8588 KB | contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 4784 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 20 ms | 4960 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Correct | 697 ms | 81408 KB | contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 | Correct | 29 ms | 5144 KB | contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 | Correct | 879 ms | 81472 KB | contestant found the optimal answer: 36183271951 == 36183271951 |
6 | Correct | 566 ms | 57956 KB | contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 | Correct | 623 ms | 61908 KB | contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 | Correct | 486 ms | 50876 KB | contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 | Correct | 487 ms | 58068 KB | contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 | Correct | 637 ms | 73628 KB | contestant found the optimal answer: 124309619349406845 == 124309619349406845 |