結果
問題 | No.2730 Two Types Luggage |
ユーザー | akiaa11 |
提出日時 | 2024-04-20 15:09:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 220 ms / 2,000 ms |
コード長 | 3,574 bytes |
コンパイル時間 | 4,731 ms |
コンパイル使用メモリ | 268,676 KB |
実行使用メモリ | 18,944 KB |
最終ジャッジ日時 | 2024-10-12 10:50:46 |
合計ジャッジ時間 | 11,482 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,248 KB |
testcase_02 | AC | 3 ms
5,248 KB |
testcase_03 | AC | 3 ms
5,248 KB |
testcase_04 | AC | 3 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 | 8 ms
5,248 KB |
testcase_11 | AC | 152 ms
14,976 KB |
testcase_12 | AC | 215 ms
18,748 KB |
testcase_13 | AC | 144 ms
12,436 KB |
testcase_14 | AC | 157 ms
14,848 KB |
testcase_15 | AC | 53 ms
6,272 KB |
testcase_16 | AC | 61 ms
7,424 KB |
testcase_17 | AC | 198 ms
17,920 KB |
testcase_18 | AC | 181 ms
16,884 KB |
testcase_19 | AC | 17 ms
5,248 KB |
testcase_20 | AC | 71 ms
8,576 KB |
testcase_21 | AC | 144 ms
14,140 KB |
testcase_22 | AC | 204 ms
18,688 KB |
testcase_23 | AC | 20 ms
5,248 KB |
testcase_24 | AC | 84 ms
9,612 KB |
testcase_25 | AC | 153 ms
14,976 KB |
testcase_26 | AC | 42 ms
6,400 KB |
testcase_27 | AC | 144 ms
14,208 KB |
testcase_28 | AC | 77 ms
9,216 KB |
testcase_29 | AC | 180 ms
17,024 KB |
testcase_30 | AC | 31 ms
5,248 KB |
testcase_31 | AC | 118 ms
12,400 KB |
testcase_32 | AC | 106 ms
11,392 KB |
testcase_33 | AC | 220 ms
18,816 KB |
testcase_34 | AC | 219 ms
18,816 KB |
testcase_35 | AC | 217 ms
18,944 KB |
testcase_36 | AC | 218 ms
18,944 KB |
testcase_37 | AC | 218 ms
18,816 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #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(...) #endif #define M_PI 3.14159265358979323846 using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; 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<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; 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;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() >> 2; constexpr int inf=numeric_limits<int>::max() >> 1; 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, m; ll w;cin>>n>>m>>w; vecll a(n), b(m), c(m); rep(i, n) cin>>a[i]; rep(i, m) cin>>b[i]; rep(i, m) cin>>c[i]; sort(rall(a)); vecll d(n + 1); rep(i, 1, n + 1) d[i] = d[i - 1] + a[i - 1]; ll ans = 0; rep(i, 1 << m){ ll s = 0, r = 0; rep(j, m) if(i >> j & 1){ s += b[j]; r += c[j]; } if(s <= w) chmax(ans, r + d[min(ll(n), w - s)]); } cout<<ans<<endl; }