# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
337492 | 2020-12-21T02:15:36 Z | tjrwodnjs999 | 수열 (APIO14_sequence) | C++11 | 842 ms | 85356 KB |
#include <bits/stdc++.h> #define ll long long #define x first #define y second using namespace std; int n,m,arr[100005],pv[100005][205]; ll DP[100005][2],sum[100005]; struct cht{ int s=0,e=0,num[100005]; pair<ll,ll> p[100005]; void clear(){ s=0,e=0; } long double cross(pair<ll,ll> a,pair<ll,ll> b){ return 1.0*(a.y-b.y)/(b.x-a.x); } ll f(int a,ll b){ return p[a].x*b+p[a].y; } pair<ll,int> qry(ll x){ while(s+1<e&&cross(p[s],p[s+1])<=x) s++; return {f(s,x),num[s]}; } void udt(ll a,ll b,int k){ p[e]={a,b}; num[e]=k; while(s<e&&p[e-1].x==p[e].x&&p[e-1].y<=p[e].y){ p[e-1]=p[e],num[e-1]=num[e]; e--; } while(s+1<e&&cross(p[e-2],p[e-1])>=cross(p[e-1],p[e])) num[e-1]=num[e],p[e-1]=p[e--]; e++; } } cht; int main() { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i]; for(int j=1;j<=m;j++){ cht.clear(); for(int i=1;i<=n;i++){ pair<ll,int> qry=cht.qry(sum[i]); DP[i][j%2]=qry.x; pv[i][j]=qry.y; cht.udt(sum[i],-sum[i]*sum[i]+DP[i][(j+1)%2],i); } } printf("%lld\n",DP[n][m%2]); function<void (int,int)> solve = [&](int a,int b){ if(b==0) return; solve(pv[a][b],b-1); printf("%d ",pv[a][b]); return; }; solve(n,m); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 2 ms | 1900 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 1 ms | 1900 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Incorrect | 1 ms | 1900 KB | contestant didn't find the optimal answer: 933701 < 933702 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2028 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 1 ms | 2028 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 2 ms | 2028 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 1 ms | 2028 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Incorrect | 2 ms | 2028 KB | contestant didn't find the optimal answer: 1019625808 < 1019625819 |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2796 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 2 ms | 2796 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 7 ms | 2796 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 2 ms | 2796 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Incorrect | 8 ms | 2796 KB | declared answer doesn't correspond to the split scheme: declared = 679382047, real = 679382223 |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 10220 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Incorrect | 7 ms | 10220 KB | contestant didn't find the optimal answer: 1301400195 < 1326260195 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 61 ms | 85260 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 60 ms | 85228 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Correct | 647 ms | 85356 KB | contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 | Correct | 60 ms | 85228 KB | contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 | Incorrect | 842 ms | 85228 KB | declared answer doesn't correspond to the split scheme: declared = 35767879537, real = 35913174759 |
6 | Halted | 0 ms | 0 KB | - |