結果
問題 | No.1247 ブロック登り |
ユーザー |
![]() |
提出日時 | 2020-10-02 23:11:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,852 ms / 3,000 ms |
コード長 | 3,720 bytes |
コンパイル時間 | 2,404 ms |
コンパイル使用メモリ | 214,080 KB |
最終ジャッジ日時 | 2025-01-15 01:13:12 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;inline int my_getchar_unlocked(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread_unlocked(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(int &x){int k;int m=0;x=0;for(;;){k = my_getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite_unlocked(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar_unlocked(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar_unlocked(a);}inline void wt_L(long long x){int s=0;int m=0;char f[20];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar_unlocked('-');}while(s--){my_putchar_unlocked(f[s]+'0');}}template<class S, class T> inline S chmax(S &a, T b){if(a<b){a=b;}return a;}int N;int K;int A[300];long long dp[2][301][300][300];long long solve(int f, int r, int a, int b){if(r > K){return -4611686016279904256LL;}long long&res = dp[f][r][a][b];if(res != 4611686016279904256LL){return res;}res = -4611686016279904256LL;if(r==K && a==b){chmax(res, A[a] * K);}if(a != b){chmax(res, solve(f, r+2, a, b));}if(a != b){chmax(res, solve(f^1, r+(b-a), a, b));}if(f==0 && a != b){chmax(res, solve(f, r+1, a+1, b) + A[a] * r);}if(f==1 && a != b){chmax(res, solve(f, r+1, a, b-1) + A[b] * r);}return res;}int main(){int i;long long res;rd(N);rd(K);{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){rd(A[Lj4PdHRW]);}}for(i=(0);i<(2);i++){int j;for(j=(0);j<(K+1);j++){int k;for(k=(0);k<(N);k++){int l;for(l=(0);l<(N);l++){dp[i][j][k][l] = 4611686016279904256LL;}}}}for(i=(0);i<(N);i++){int j;res = -4611686016279904256LL;for(j=(0);j<(N);j++){int k;for(k=(j);k<(N);k++){if(j <= i && i <= k){chmax(res, solve(0, i-j, j, k));chmax(res, solve(1, k-i, j, k));}}}wt_L(res);wt_L('\n');}return 0;}// cLay varsion 20200926-1// --- original code ---// int N, K, A[300];// ll dp[2][301][300][300];//// ll solve(int f, int r, int a, int b){// if(r > K) return -ll_inf;//// ll &res = dp[f][r][a][b];// if(res != ll_inf) return res;// res = -ll_inf;//// if(r==K && a==b) res >?= A[a] * K;//// if(a != b) res >?= solve(f, r+2, a, b);// if(a != b) res >?= solve(f^1, r+(b-a), a, b);//// if(f==0 && a != b) res >?= solve(f, r+1, a+1, b) + A[a] * r;// if(f==1 && a != b) res >?= solve(f, r+1, a, b-1) + A[b] * r;//// return res;// }//// {// ll res;// rd(N,K,A(N));// rep(i,2) rep(j,K+1) rep(k,N) rep(l,N) dp[i][j][k][l] = ll_inf;//// rep(i,N){// res = -ll_inf;// rep(j,N) rep(k,j,N) if(j <= i <= k){// res >?= solve(0, i-j, j, k);// res >?= solve(1, k-i, j, k);// }// wt(res);// }// }