結果
問題 | No.783 門松計画 |
ユーザー | kurarrr |
提出日時 | 2019-02-14 21:55:45 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 1,080 ms / 2,000 ms |
コード長 | 3,117 bytes |
コンパイル時間 | 1,399 ms |
コンパイル使用メモリ | 165,548 KB |
実行使用メモリ | 31,896 KB |
最終ジャッジ日時 | 2024-07-23 12:22:21 |
合計ジャッジ時間 | 4,832 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 3 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 396 ms
31,720 KB |
testcase_11 | AC | 1,080 ms
31,896 KB |
testcase_12 | AC | 720 ms
31,888 KB |
testcase_13 | AC | 43 ms
15,304 KB |
testcase_14 | AC | 200 ms
22,580 KB |
testcase_15 | AC | 23 ms
29,348 KB |
testcase_16 | AC | 6 ms
15,876 KB |
testcase_17 | AC | 9 ms
13,956 KB |
testcase_18 | AC | 3 ms
7,568 KB |
testcase_19 | AC | 51 ms
26,420 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 5 ms
13,808 KB |
testcase_22 | AC | 7 ms
18,356 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 72 ms
29,292 KB |
testcase_25 | AC | 15 ms
20,652 KB |
testcase_26 | AC | 22 ms
16,504 KB |
ソースコード
#include "bits/stdc++.h" #define ALL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define RREP(i, x, n) for(int i = x; i >= n; i--) #define rrep(i, n) RREP(i,n,0) #define pb push_back #pragma GCC optimize ("-O3") using namespace std; #define DEBUG_IS_VALID #ifdef DEBUG_IS_VALID #define DEB 1 #else #define DEB 0 #endif #define DUMPOUT cout #define dump(...) if(DEB) DUMPOUT<<" "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<" "; if(DEB) dump_func(__VA_ARGS__) template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;} template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; } template<typename T>ostream& operator << (ostream& os, set<T>& st){cout << "{"; for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;} template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; } void dump_func(){DUMPOUT << endl;} template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);} template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;} template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;} void _main(); int main(){ cin.tie(0); ios::sync_with_stdio(false); _main(); return 0;} using ll = long long; using P = pair<int,int>; using Pl = pair<ll,ll>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; const int mod=1e9+7,INF=1<<29; const double EPS=1e-5,PI=3.1415926535897932384626; const ll lmod = 1e9+7,LINF=1LL<<59; int dp[51][53][53][51]; void _main(){ int N; cin >> N ; int C; cin >> C ; rep(i,N+1) rep(j,N+1) rep(k,N+1) rep(l,51) dp[i][j][k][l] = -INF; vi L(N),W(N); rep(i,N) cin >> L[i] ; rep(i,N) cin >> W[i] ; rep(j,N) rep(k,N) if(W[j]+W[k]<=C && L[j]!=L[k]) dp[0][j][k][W[j]+W[k]] = L[j] + L[k]; int cnt = 0; bool update; int ans = 0; rep(i,50){ update = false; int ma = 0; rep(j,N) rep(k,N) rep(c,C) rep(l,N){ if(L[j]==L[l] || L[k]==L[l] || L[j]==L[k]) continue; if(c+W[l]>C) continue; if(!((L[k]>L[j]&&L[k]>L[l])||(L[k]<L[j]&&L[k]<L[l]))) continue; if(dp[i][j][k][c]==-INF) continue; if(chmax(dp[i+1][k][l][c+W[l]],dp[i][j][k][c]+L[l])){ // cout << i << " " << j << " " << k << " " << l << " " << dp[i+1][k][l][c+W[l]] << endl; update = true; chmax(ans,dp[i+1][k][l][c+W[l]]); } } if(!update){ cnt = i; break; } } cout << ans << endl; }