| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 158356 | 2019-10-16T16:37:40 Z | arnold518 | Split the sequence (APIO14_sequence) | C++14 | 2000 ms | 87908 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
const int MAXK = 200;
int N, K;
ll A[MAXN+10], dp[MAXN+10], dp2[MAXN+10];
int memo[MAXN+10][MAXK+10];
struct CHT
{
void init()
{
S.clear();
pos=0;
}
struct Line { ll a, b, c; };
double cross(const Line &p, const Line &q) { return (double)(q.b-p.b)/(p.a-q.a); }
vector<Line> S;
void update(Line p)
{
while(S.size()>1 && ((S[S.size()-1].a==p.a && S[S.size()-1].b<=p.b) || (S[S.size()-1].a!=p.a && cross(S[S.size()-1], p)<=cross(S[S.size()-2], S[S.size()-1])))) S.pop_back();
S.push_back(p);
}
int pos=0;
pll query(ll x)
{
if(S.size()<=pos) pos=S.size()-1;
else while(pos+1<S.size() && cross(S[pos], S[pos+1])<=x) pos++;
return {S[pos].a*x+S[pos].b, S[pos].c};
}
};
CHT cht;
int main()
{
int i, j;
scanf("%d%d", &N, &K);
for(i=1; i<=N; i++) scanf("%lld", &A[i]), A[i]+=A[i-1];
for(j=1; j<=K; j++)
{
cht.init();
cht.update({0, -987654321, -1});
for(i=1; i<=N; i++)
{
pll t=cht.query(A[i]);
dp[i]=t.first;
memo[i][j]=t.second;
cht.update({A[i], dp2[i]-A[i]*A[i], i});
}
for(i=1; i<=N; i++) dp2[i]=dp[i];
//for(i=1; i<=N; i++) printf("%lld ", dp[i]); printf("\n");
}
printf("%lld\n", dp[N]);
int now=N;
for(i=K; i>=1; i--)
{
now=memo[now][i];
printf("%d ", now);
}
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 108 == 108 |
| 2 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 999 == 999 |
| 3 | Incorrect | 2 ms | 376 KB | Integer -1 violates the range [1, 1] |
| 4 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 380 KB | contestant found the optimal answer: 1093956 == 1093956 |
| 2 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 302460000 == 302460000 |
| 3 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 933702 == 933702 |
| 7 | Correct | 2 ms | 376 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 | Runtime error | 7 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 9 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 610590000 == 610590000 |
| 2 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 311760000 == 311760000 |
| 3 | Correct | 4 ms | 504 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 | Correct | 2 ms | 504 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 | Correct | 3 ms | 504 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 | Correct | 3 ms | 504 KB | contestant found the optimal answer: 107630884 == 107630884 |
| 7 | Correct | 4 ms | 504 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 | Incorrect | 3 ms | 504 KB | Integer -1 violates the range [1, 199] |
| 9 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 1272 KB | contestant found the optimal answer: 21503404 == 21503404 |
| 2 | Correct | 3 ms | 1272 KB | contestant found the optimal answer: 140412195 == 140412195 |
| 3 | Correct | 9 ms | 1272 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 | Correct | 3 ms | 1272 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 | Correct | 9 ms | 1272 KB | contestant found the optimal answer: 679388326 == 679388326 |
| 6 | Correct | 8 ms | 1272 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 | Correct | 9 ms | 1272 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 | Incorrect | 8 ms | 1272 KB | Integer -1 violates the range [1, 999] |
| 9 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 11 ms | 9116 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 | Correct | 10 ms | 9144 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 | Correct | 102 ms | 9204 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 | Correct | 11 ms | 9200 KB | contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 | Correct | 71 ms | 9144 KB | contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 | Correct | 77 ms | 9144 KB | contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 | Correct | 89 ms | 9204 KB | contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 | Runtime error | 80 ms | 18420 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 9 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 126 ms | 86948 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 | Correct | 106 ms | 87144 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 | Execution timed out | 2013 ms | 87908 KB | Time limit exceeded |
| 4 | Halted | 0 ms | 0 KB | - |