結果

問題 No.2423 Merge Stones
ユーザー siganaisiganai
提出日時 2023-08-12 15:12:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,194 bytes
コンパイル時間 3,411 ms
コンパイル使用メモリ 226,512 KB
実行使用メモリ 73,076 KB
最終ジャッジ日時 2024-11-20 00:37:54
合計ジャッジ時間 104,483 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,824 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2,431 ms
32,128 KB
testcase_12 AC 1,199 ms
14,592 KB
testcase_13 AC 1,220 ms
14,720 KB
testcase_14 AC 1,267 ms
14,720 KB
testcase_15 AC 1,285 ms
14,592 KB
testcase_16 AC 1,234 ms
14,592 KB
testcase_17 AC 1,235 ms
14,592 KB
testcase_18 AC 1,275 ms
14,592 KB
testcase_19 AC 1,254 ms
14,848 KB
testcase_20 AC 1,203 ms
14,848 KB
testcase_21 AC 1,252 ms
14,592 KB
testcase_22 AC 1,219 ms
14,720 KB
testcase_23 AC 1,260 ms
14,592 KB
testcase_24 AC 1,251 ms
14,720 KB
testcase_25 AC 1,232 ms
14,720 KB
testcase_26 AC 1,238 ms
14,592 KB
testcase_27 AC 1,198 ms
14,592 KB
testcase_28 AC 1,185 ms
14,848 KB
testcase_29 AC 1,212 ms
14,592 KB
testcase_30 AC 1,233 ms
14,720 KB
testcase_31 AC 1,243 ms
14,592 KB
testcase_32 AC 1,225 ms
14,592 KB
testcase_33 AC 1,193 ms
14,720 KB
testcase_34 AC 1,194 ms
14,592 KB
testcase_35 AC 1,241 ms
14,720 KB
testcase_36 AC 1,217 ms
14,592 KB
testcase_37 AC 1,208 ms
14,592 KB
testcase_38 AC 1,210 ms
14,720 KB
testcase_39 AC 1,225 ms
14,720 KB
testcase_40 AC 1,257 ms
14,720 KB
testcase_41 AC 1,200 ms
14,848 KB
testcase_42 AC 1,218 ms
14,592 KB
testcase_43 AC 1,227 ms
14,848 KB
testcase_44 AC 1,197 ms
14,592 KB
testcase_45 AC 1,240 ms
14,592 KB
testcase_46 AC 1,207 ms
14,592 KB
testcase_47 AC 1,227 ms
14,592 KB
testcase_48 AC 1,228 ms
14,720 KB
testcase_49 AC 1,582 ms
14,720 KB
testcase_50 AC 1,459 ms
14,592 KB
testcase_51 AC 1,519 ms
32,256 KB
testcase_52 AC 1,500 ms
32,128 KB
testcase_53 AC 1,500 ms
32,256 KB
testcase_54 AC 1,470 ms
32,128 KB
testcase_55 AC 1,517 ms
32,128 KB
testcase_56 AC 1,232 ms
14,592 KB
testcase_57 AC 1,231 ms
14,848 KB
testcase_58 AC 1,276 ms
15,104 KB
testcase_59 AC 1,264 ms
14,848 KB
testcase_60 AC 1,267 ms
14,592 KB
testcase_61 AC 1,402 ms
32,128 KB
testcase_62 AC 1,972 ms
32,256 KB
testcase_63 AC 2,013 ms
32,000 KB
testcase_64 AC 2,282 ms
32,128 KB
testcase_65 AC 2,240 ms
32,128 KB
testcase_66 AC 1,916 ms
32,256 KB
testcase_67 AC 1,813 ms
32,128 KB
testcase_68 AC 2,506 ms
32,256 KB
testcase_69 AC 2,202 ms
32,128 KB
testcase_70 AC 2,365 ms
30,848 KB
testcase_71 TLE -
testcase_72 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;

int dp[601][601][50];
int main() {
    INT(n,k);
    vi a(2*n),c(2*n);
    ll ans = 0;
    rep(i,n) {
        cin >> a[i];
        chmax(ans,(ll)a[i]);
    }
    rep(i,n) {
        cin >> c[i];
        c[i]--;
    }
    rep(i,n,2*n) {
        a[i] = a[i-n];
        c[i] = c[i-n];
    }
    vl cs(2*n+1);
    rep(i,2*n) cs[i+1] = cs[i] + a[i];
    rep(i,2*n) dp[i][i+1][c[i]] = 1;
    rep(wid,2,n+1) {
        rep(l,2*n+1-wid) {
            int r = l + wid;
            if(n <= l) {
                rep(j,50) dp[l][r][j] = dp[l-n][r-n][j];
                continue;
            }
            int f = 0;
            rep(j,50) {
                int flg = 0;
                if(dp[l][r][j] == 0) {
                    rep(mid,l+1,r) {
                        if(dp[l][mid][j] == 1) {
                            rep(x,-k,k+1) {
                                int j2 = j + x;
                                if(0 <= j2 && j2 < 50) {
                                    if(dp[mid][r][j2] == 1) {
                                        f = 1;
                                        flg = 1;
                                        dp[l][r][j] = dp[l][r][j2] = 1;
                                        break;
                                    }
                                }
                            }
                        }
                        if(dp[mid][r][j] == 1) {
                            rep(x,-k,k+1) {
                                int j2 = j + x;
                                if(0 <= j2 && j2 < 50) {
                                    if(dp[l][mid][j2] == 1) {
                                        f = 1;
                                        flg = 1;
                                        dp[l][r][j] = dp[l][r][j2] = 1;
                                        break;
                                    }
                                }
                            }
                        }
                        if(flg) break;
                    }
                }
            }
            if(f) chmax(ans,cs[r] - cs[l]);
        }
    }
    cout << ans << '\n';
}
0