結果
問題 | No.2730 Two Types Luggage |
ユーザー |
|
提出日時 | 2024-05-05 09:34:24 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 261 ms / 2,000 ms |
コード長 | 2,125 bytes |
コンパイル時間 | 7,361 ms |
コンパイル使用メモリ | 350,200 KB |
実行使用メモリ | 18,880 KB |
最終ジャッジ日時 | 2024-11-27 05:19:03 |
合計ジャッジ時間 | 14,078 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>#include <atcoder/all>using ull = unsigned long long;using namespace std;using namespace atcoder;using vst = vector<string>;using ll = long long;using ld = long double;using pll = pair<ll,ll>;using vll = vector<ll>;using vvll = vector<vll>;using vpl = vector<pll>;#define V(a) vector<a>#define rep(i, n) for (ll i = 0; i < n; i++)#define repp(i,k,n) for (ll i = k; i < n; i++)#define per(i,s,e) for(ll i = s; i >= e; i--)#define all(v) v.begin(),v.end()#define yesno(a) a ? cout << "Yes" << '\n' : cout << "No" << '\n'#define YESNO(a) a ? cout << "YES" << '\n' : cout << "NO" << '\n'#define UNOmap unordered_map#define UNOset unordered_set#define join(G,a,b) G[a].push_back(b);G[b].push_back(a);#define PB(a,b) a.emplace_back(b)#define chmax(a,b) a=max(a,b)#define chmin(a,b) a=min(a,b)template<class... T>void in(T&... a){(cin >> ... >> a);}template<class T, class... Ts>void out(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << '\n';}template<class T> void vin(vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++)in(v[i]);}template<class T> void vout(vector<T> &v){for(ll i = 0; i < (ll)v.size(); i++) cout << v[i] << ' ';cout << "\n";}ll INF = 4611686018427387904;ll MOD =998244353; ll MOD1 =1000000007;/* INF = 2^62 */#define sl(...) ll __VA_ARGS__; in(__VA_ARGS__)using mint = modint998244353;using mint1 = modint1000000007;using mintn = modint;//----------------------------------------------int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);//==============================================ll N,M,W;in(N,M,W);vll A(N),B(M),C(M);vin(A);vin(B);vin(C);vll sum(N+1);sort(all(A),greater<ll>());rep(i,N){sum[i+1] = A[i]+sum[i];}ll ans = 0;rep(mas,1LL<<M){bitset<32> b(mas);ll v = 0,w = 0;rep(i,M){if(b[i] == 0) continue;w += B[i];v += C[i];}if(w > W)continue;v += sum[min(N,W-w)];chmax(ans,v);}out(ans);}