| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1081915 | 2024-08-30T12:52:05 Z | kiethm07 | Split the sequence (APIO14_sequence) | C++11 | 2000 ms | 87896 KB |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define iii pair<int,pii>
#define fi first
#define se second
#define vi vector<int>
#define vii vector<pii>
#define pb(i) push_back(i)
#define all(x) x.begin(),x.end()
#define TEXT "a"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int inf = 1e9 + 7;
const ld eps = 1e-8;
const double pi = acos(-1);
const int N = 1e5 + 5;
const int K = 205;
int n,k;
ll p[N];
ll dp[N][K];
int pre[N][K];
struct line{
ll a,b;
int id;
line(ll _a, ll _b, int _id){
a = _a;
b = _b;
id = _id;
}
ll eval(ll x){
return a * x + b;
}
double isect(const line& F) const{
return 1.0 * (F.b - b) / (a - F.a);
}
};
//struct CHT{
// deque<line> dq;
// void add(line F){
// int n = dq.size();
// while(n >= 2 && ){
// n--;
// }
// }
// pair<ll,int> query()
//};
int main(){
cin.tie(0) -> sync_with_stdio(0);
if (fopen(TEXT".inp","r")){
freopen(TEXT".inp","r",stdin);
freopen(TEXT".out","w",stdout);
}
cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> p[i];
p[i] += p[i - 1];
}
for (int used = 1; used <= k; used++){
for (int i = 1; i <= n; i++){
for (int j = 0; j < i; j++){
dp[i][used] = max(dp[i][used], dp[j][used - 1] + (p[i] - p[j]) * (p[n] - p[i]));
if (dp[i][used] == dp[j][used - 1] + (p[i] - p[j]) * (p[n] - p[i])) pre[i][used] = j;
}
}
}
int best = 0;
for (int i = 1; i <= n; i++){
if (dp[i][k] > dp[best][k]) best = i;
}
cout << dp[best][k] << "\n";
vector<int> v;
for (int used = k; used >= 1; used--){
v.push_back(best);
best = pre[best][used];
}
reverse(all(v));
for (int i : v) cout << i << " ";
return 0;
}
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 | Incorrect | 1 ms | 348 KB | Integer 0 violates the range [1, 1] |
| 4 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | contestant found the optimal answer: 1093956 == 1093956 |
| 2 | Correct | 0 ms | 348 KB | contestant found the optimal answer: 302460000 == 302460000 |
| 3 | Correct | 1 ms | 348 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 | Correct | 0 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 | 0 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 | 1 ms | 348 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 860 KB | contestant found the optimal answer: 610590000 == 610590000 |
| 2 | Correct | 1 ms | 860 KB | contestant found the optimal answer: 311760000 == 311760000 |
| 3 | Correct | 6 ms | 860 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 | Correct | 1 ms | 860 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 | Correct | 4 ms | 860 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 | Correct | 5 ms | 860 KB | contestant found the optimal answer: 107630884 == 107630884 |
| 7 | Correct | 6 ms | 964 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 | Correct | 2 ms | 856 KB | contestant found the optimal answer: 193556962 == 193556962 |
| 9 | Correct | 1 ms | 860 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 | Correct | 3 ms | 860 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 4 ms | 2652 KB | contestant found the optimal answer: 21503404 == 21503404 |
| 2 | Correct | 4 ms | 2648 KB | contestant found the optimal answer: 140412195 == 140412195 |
| 3 | Correct | 145 ms | 2652 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 | Correct | 4 ms | 2648 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 | Correct | 143 ms | 2860 KB | contestant found the optimal answer: 679388326 == 679388326 |
| 6 | Correct | 134 ms | 2864 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 | Correct | 143 ms | 2648 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 | Correct | 141 ms | 2648 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 | Correct | 30 ms | 2648 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 | Correct | 61 ms | 2652 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 424 ms | 24400 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 | Correct | 424 ms | 24544 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 | Execution timed out | 2039 ms | 24400 KB | Time limit exceeded |
| 4 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 2053 ms | 87896 KB | Time limit exceeded |
| 2 | Halted | 0 ms | 0 KB | - |