# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
158396 | 2019-10-17T00:08:24 Z | mhy908 | 수열 (APIO14_sequence) | C++14 | 511 ms | 85320 KB |
#include <bits/stdc++.h> #define F first #define S second #define pb push_back #define llinf 8987654321987654321 using namespace std; typedef long long LL; typedef pair<int, int> pii; typedef pair<LL, LL> pll; int n, k; LL arr[100010], sum[100010], dp[2][100010]; int pass[210][100010]; struct LinearFunc{ LL a, b; int c; double s; LinearFunc(): LinearFunc(1, 0, 0){} LinearFunc(LL a1, LL b1, int c1): a(a1), b(b1), s(0), c(c1){} }f[100010]; double cross(LinearFunc &f, LinearFunc &g){ return (g.b-f.b)/(f.a-g.a); } int pv; void print(int num, int x){ if(num<=1)return; print(num-1, pass[num][x]); printf("%d ", pass[num][x]); } int main() { scanf("%d %d", &n, &k); for(int i=1; i<=n; i++)scanf("%lld", &arr[i]), sum[i]=sum[i-1]+arr[i]; for(int i=1; i<=n; i++)dp[0][i]=290000000000000LL; for(int j=1; j<=k+1; j++){ int top=0, fpos=0; for(int i=1; i<j; i++)dp[j%2][i]=dp[j%2][i-1]+arr[i]*arr[i]; for(int i=j; i<=n; i++){ LinearFunc g(-2*sum[i-1], dp[(j+1)%2][i-1]+sum[i-1]*sum[i-1], i-1); while(top>0){ if(f[top-1].a!=g.a){ g.s=cross(f[top-1], g); if(f[top-1].s<g.s)break; if(--top==fpos)fpos--; } else{ if(f[top-1].b<=g.b)break; if(--top==fpos)fpos--; } } f[top++]=g; LL x=sum[i]; while(fpos+1<top&&f[fpos+1].s<x)fpos++; dp[j%2][i]=f[fpos].a*x+f[fpos].b+sum[i]*sum[i]; pass[j][i]=f[fpos].c; } } printf("%lld\n", (sum[n]*sum[n]-dp[(k+1)%2][n])/2); print(k+1, n); } /* 5 1 0 1 0 0 1 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3576 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 4 ms | 3448 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 4 ms | 3448 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 4 ms | 3576 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 4 ms | 3448 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Incorrect | 5 ms | 3448 KB | contestant didn't find the optimal answer: 0 < 1 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3576 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 4 ms | 3448 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 5 ms | 3704 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 4 ms | 3448 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 4 ms | 3576 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 4 ms | 3576 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3576 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 4 ms | 3448 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 6 ms | 4472 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 4 ms | 3580 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 5 ms | 4216 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Correct | 6 ms | 4344 KB | contestant found the optimal answer: 107630884 == 107630884 |
7 | Correct | 6 ms | 4472 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
8 | Correct | 5 ms | 3704 KB | contestant found the optimal answer: 193556962 == 193556962 |
9 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
10 | Correct | 5 ms | 3832 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 10 ms | 5240 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 5 ms | 3576 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 11 ms | 5240 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Incorrect | 10 ms | 4984 KB | contestant didn't find the optimal answer: 4699030107 < 4699030287 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 3964 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 7 ms | 3960 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Correct | 60 ms | 12484 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 | Incorrect | 7 ms | 3988 KB | declared answer doesn't correspond to the split scheme: declared = 4852988702336376, real = 2998396850440 |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 8184 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 27 ms | 8184 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Incorrect | 511 ms | 85320 KB | declared answer doesn't correspond to the split scheme: declared = 499655008954339381, real = 1997178908434923 |
4 | Halted | 0 ms | 0 KB | - |