結果
問題 | No.1247 ブロック登り |
ユーザー |
![]() |
提出日時 | 2020-10-02 22:27:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 840 ms / 3,000 ms |
コード長 | 4,116 bytes |
コンパイル時間 | 1,875 ms |
コンパイル使用メモリ | 200,888 KB |
最終ジャッジ日時 | 2025-01-15 00:39:42 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;//const int mod = 1e9 + 7;const int mod = 998244353;const int64 infll = (1LL << 62) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename F >struct FixPoint : F {FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint< F >{forward< F >(f)};}int main() {int N, K;cin >> N >> K;vector< int > A(N);cin >> A;int dp[300][300][301][2];for(int i = 0; i < 300; i++) {for(int j = 0; j < 300; j++) {for(int k = 0; k < 301; k++) {for(int l = 0; l < 2; l++) {dp[i][j][k][l] = -inf;}}}}for(int i = 0; i + 1 < N; i++) {dp[i][i + 1][K - 1][0] = A[i + 1] * K + A[i] * (K - 1);dp[i][i + 1][K - 1][1] = A[i + 1] * (K - 1) + A[i] * K;}for(int k = K - 1; k >= 0; k--) {for(int left = 0; left < N; left++) {for(int right = left; right < N; right++) {for(int p = 0; p < 2; p++) {int now = p ? right : left;if(k + 2 < K - 1) {chmax(dp[left][right][k][p], dp[left][right][k + 2][p] - A[now] - A[now]);}if(dp[left][right][k][p] == -inf) {continue;}if(left > 0) {int nxt = left - 1;int time = k - (now - nxt);if(time >= 0) chmax(dp[nxt][right][time][0], dp[left][right][k][p] + A[nxt] * time);}if(right + 1 < N) {int nxt = right + 1;int time = k - (nxt - now);if(time >= 0) chmax(dp[left][nxt][time][1], dp[left][right][k][p] + A[nxt] * time);}}}}}vector< int64 > best(N, -infll);for(int left = 0; left < N; left++) {for(int right = left + 1; right < N; right++) {for(int p = 0; p < 2; p++) {int now = p ? right : left;for(int k = K - 2; k >= 0; k--) {chmax(dp[left][right][k][p], dp[left][right][k + 2][p]);}}}}for(int left = 0; left < N; left++) {for(int right = left + 1; right < N; right++) {for(int p = 0; p < 2; p++) {int now = p ? right : left;for(int pos = left; pos <= right; pos++) {int tap = abs(now - pos);if(tap <= K) {chmax(best[pos], dp[left][right][tap][p]);}}}}}for(auto &p : best) cout << p << "\n";}