結果
問題 | No.783 門松計画 |
ユーザー |
|
提出日時 | 2019-01-11 21:55:55 |
言語 | C++11 (gcc 13.3.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,419 bytes |
コンパイル時間 | 926 ms |
コンパイル使用メモリ | 71,320 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 12:16:56 |
合計ジャッジ時間 | 1,642 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 26 WA * 1 |
ソースコード
#include <iostream>#include <algorithm>#include <vector>#include <string.h>#include <iomanip>using namespace std;#define mod (long)(1e9 + 7)#define all(x) (x).begin(), (x).end()#define bitcount(n) __builtin_popcountl(long(n))#define fcout cout << fixed << setprecision(15)#define highest(x) (63 - __builtin_clzl(x))#define long long longtemplate<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){return a / gcd(a, b) * b; }struct combination{ vector<long> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] =fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } longC(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };int N, C;vector<int> L, W;int dp[52][52][52][5];int buy(int cost, int back, int back_back, int count){if(cost > C){return -1e9;}else if(dp[cost][back][back_back][count] != -1){return dp[cost][back][back_back][count];}int ans = -1e9 * (count < 3);for(int i = 0; i < N; i++){if(L[back] != L[i] && L[back_back] != L[i] && (L[back_back] < L[back]) ^ (L[back] < L[i])){ans = max(ans, buy(cost + W[i], i, back, min(count + 1, 4)) + L[i]);}}return dp[cost][back][back_back][count] = ans;}int main(){cin >> N >> C;L.resize(52);cins(L.begin(), L.begin() + N);L[50] = 100, L[51] = -100;W.resize(52);cins(W.begin(), W.begin() + N);memset(dp, -1, sizeof(dp));cout << max(0, buy(0, 50, 51, 0)) << endl;}