結果
問題 | No.2423 Merge Stones |
ユーザー |
|
提出日時 | 2023-08-12 17:00:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 482 ms / 4,000 ms |
コード長 | 3,753 bytes |
コンパイル時間 | 3,647 ms |
コンパイル使用メモリ | 254,216 KB |
最終ジャッジ日時 | 2025-02-16 07:17:49 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 72 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#define SELECTER(_1,_2,_3,SELECT,...) SELECT#define rep1(i,n) for(int i=0;i<(int)n;++i)#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define fi first#define se second#define PrintR LogOutput#ifdef _DEBUG#define Log(...) LogOutput(__VA_ARGS__)#else#define Log(...)#endifusing namespace std;using namespace atcoder;using ll=long long;using pii=pair<int,int>;using pll=pair<long long,long long>;using pdd=pair<long double,long double>;using veci=vector<int>;using vecpii=vector<pair<int,int>>;using vecll=vector<long long>;using vecpll=vector<pair<long long,long long>>;using vecpdd=vector<pair<long double,long double>>;using vecs=vector<string>;using vecb=vector<bool>;using vecd=vector<double>;using tp=tuple<int,int,int>;using tpll=tuple<ll,ll,ll>;using mint=modint998244353;using mint10=modint1000000007;template<typename T, typename S>istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}template<typename T, typename S>ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}ostream& operator<<(ostream& out, const mint& a){return out << a.val();}ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}ostream& operator<<(ostream& out, const modint& a){return out << a.val();}template<typename T>ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}template<typename T, typename S>pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}template<typename T, typename S>pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}constexpr ll INF=numeric_limits<ll>::max() / 4;constexpr ll MOD=998244353;const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};template<typename... Args>void LogOutput(Args&&... args){stringstream ss;((ss << args << ' '), ...);cout << ss.str().substr(0, ss.str().length() - 1) << endl;}template<typename T>void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}int main(){ios::sync_with_stdio(false);std::cin.tie(nullptr);int n, k;cin>>n>>k;veci a(n), c(n);rep(i, n) cin>>a[i];rep(i, n) cin>>c[i];vector dp(n, vecll(n + 1, 0));rep(i, n - 1) dp[i][i + 1] = 1LL << c[i];dp[n - 1][0] = 1LL << c[n - 1];auto f = [&](int l, int r, int m){rep(i, 1, m){rep(j, k + 1){dp[l][r] |= dp[l][(l + i) % n] & (dp[(l + i) % n][r] << j);dp[l][r] |= dp[l][(l + i) % n] & (dp[(l + i) % n][r] >> j);dp[l][r] |= (dp[l][(l + i) % n] << j) & dp[(l + i) % n][r];dp[l][r] |= (dp[l][(l + i) % n] >> j) & dp[(l + i) % n][r];}}};rep(w, 1, n + 1){rep(l, n){int r = (l + w) % n;f(l, r, w);}}vecll s(2 *n);rep(i, 2 * n) s[i] = a[i % n] + (i > 0 ? s[i - 1] : 0);ll ans = 0;rep(i, n) rep(j, n + 1) if(dp[i][j]){if(i < j) chmax(ans, (j > 0 ? s[j - 1] : 0) - (i > 0 ? s[i - 1] : 0));else chmax(ans, s[n + j - 1] - (i > 0 ? s[i - 1] : 0));}cout<<ans<<endl;}