結果
問題 | No.2686 商品券の使い道 |
ユーザー | sgfc |
提出日時 | 2024-03-20 21:22:42 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 813 ms / 3,000 ms |
コード長 | 4,139 bytes |
コンパイル時間 | 10,000 ms |
コンパイル使用メモリ | 465,036 KB |
実行使用メモリ | 19,708 KB |
最終ジャッジ日時 | 2024-03-20 21:23:12 |
合計ジャッジ時間 | 28,759 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 27 ms
7,420 KB |
testcase_03 | AC | 28 ms
7,420 KB |
testcase_04 | AC | 28 ms
7,420 KB |
testcase_05 | AC | 28 ms
7,420 KB |
testcase_06 | AC | 27 ms
7,420 KB |
testcase_07 | AC | 27 ms
7,420 KB |
testcase_08 | AC | 28 ms
7,420 KB |
testcase_09 | AC | 27 ms
7,420 KB |
testcase_10 | AC | 28 ms
7,420 KB |
testcase_11 | AC | 175 ms
7,420 KB |
testcase_12 | AC | 125 ms
7,420 KB |
testcase_13 | AC | 192 ms
7,420 KB |
testcase_14 | AC | 161 ms
7,420 KB |
testcase_15 | AC | 109 ms
7,420 KB |
testcase_16 | AC | 171 ms
7,420 KB |
testcase_17 | AC | 94 ms
7,420 KB |
testcase_18 | AC | 171 ms
7,420 KB |
testcase_19 | AC | 174 ms
7,420 KB |
testcase_20 | AC | 167 ms
7,420 KB |
testcase_21 | AC | 193 ms
7,420 KB |
testcase_22 | AC | 49 ms
7,420 KB |
testcase_23 | AC | 57 ms
7,420 KB |
testcase_24 | AC | 167 ms
7,420 KB |
testcase_25 | AC | 40 ms
7,420 KB |
testcase_26 | AC | 166 ms
7,420 KB |
testcase_27 | AC | 167 ms
7,420 KB |
testcase_28 | AC | 166 ms
7,420 KB |
testcase_29 | AC | 155 ms
19,708 KB |
testcase_30 | AC | 788 ms
19,708 KB |
testcase_31 | AC | 781 ms
19,708 KB |
testcase_32 | AC | 775 ms
19,708 KB |
testcase_33 | AC | 769 ms
19,708 KB |
testcase_34 | AC | 785 ms
19,708 KB |
testcase_35 | AC | 764 ms
19,708 KB |
testcase_36 | AC | 788 ms
19,708 KB |
testcase_37 | AC | 801 ms
19,708 KB |
testcase_38 | AC | 770 ms
19,708 KB |
testcase_39 | AC | 813 ms
19,708 KB |
testcase_40 | AC | 691 ms
19,708 KB |
testcase_41 | AC | 780 ms
19,708 KB |
testcase_42 | AC | 737 ms
19,708 KB |
testcase_43 | AC | 791 ms
19,708 KB |
testcase_44 | AC | 776 ms
19,708 KB |
testcase_45 | AC | 789 ms
19,708 KB |
testcase_46 | AC | 778 ms
19,708 KB |
evil_random20_1.txt | AC | 106 ms
19,708 KB |
evil_random20_2.txt | AC | 105 ms
19,708 KB |
evil_random20_3.txt | AC | 106 ms
19,708 KB |
ソースコード
#include "bits/stdc++.h" #include <stdio.h> #include <math.h> #include "atcoder/all" #include <float.h> #include <boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) #define TCASE() ll _ttt; cin >> _ttt; while(_ttt--) using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; #define VL(a, n) vector<ll> a; a.assign(n, 0); #define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x; #define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init); using vd = vector<double>; using pl = pair<ll, ll>; struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template <class T = long long> using pql = priority_queue<T>; template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>; using vm = vector<mint>; using vvm = vector<vm>; void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; }; template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 auto gmax(const auto& a, const auto& b) { return a > b ? a : b; }; auto gmin(const auto& a, const auto& b) { return a < b ? a : b; }; bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; } bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; } template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); }; template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); }; template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); }; template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); } long long ceil(const long long a, const long long b) { return (a + b - 1) / b; } struct mq { ll m = 0; ll q = 0; bool operator<(const mq& r) const { if (q == 0 && r.q == 0) return m < r.m; if (q == 0) return true; if (r.q == 0) return false; return q < r.q; } bool canbuy(ll x, ll maxm, ll maxq) { if (m + x > maxm || q > 0) { if (q + x > maxq) return false; } return true; } void buy(ll x, ll maxm) { if (m + x > maxm || q > 0) { q += x; } else { m += x; } } }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n, m, q; cin >> n >> m >> q; vl a(n); vl b(n); REP(i, n) { cin >> a[i] >> b[i]; } vector<mq> dp(1LL << n, { llhuge, llhuge }); dp[0] = { 0, 0 }; ll ans = 0; auto ctans = [&](ll i) { ll sum = 0; REP(j, n) { if (i & (1 << j)) { sum += b[j]; } } chmax(ans, sum); }; REPI(i, 1, 1 << n) { REP(j, n) { if (!(i & (1 << j))) continue; const ll old = i - (1 << j); if (dp[old].canbuy(a[j], m, q)) { mq newdp = dp[old]; newdp.buy(a[j], m); if (newdp < dp[i]) dp[i] = newdp; ctans(i); } } } cout << ans << endl; }