#962585 (C++17) No.2686 商品券の使い道

提出ソース

結果

問題	No.2686 商品券の使い道
ユーザー	dyktr_06
提出日時	2024-03-20 21:58:37
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	187 ms / 3,000 ms
コード長	5,065 bytes
コンパイル時間	4,614 ms
コンパイル使用メモリ	263,032 KB
実行使用メモリ	35,968 KB
最終ジャッジ日時	2024-09-30 07:49:17
合計ジャッジ時間	10,216 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	39 ms 9,472 KB
testcase_03	AC	39 ms 9,344 KB
testcase_04	AC	41 ms 9,472 KB
testcase_05	AC	40 ms 9,472 KB
testcase_06	AC	41 ms 9,472 KB
testcase_07	AC	39 ms 7,424 KB
testcase_08	AC	40 ms 9,344 KB
testcase_09	AC	41 ms 9,344 KB
testcase_10	AC	41 ms 9,472 KB
testcase_11	AC	45 ms 11,392 KB
testcase_12	AC	44 ms 9,600 KB
testcase_13	AC	46 ms 11,392 KB
testcase_14	AC	44 ms 11,392 KB
testcase_15	AC	42 ms 10,240 KB
testcase_16	AC	43 ms 10,880 KB
testcase_17	AC	42 ms 10,112 KB
testcase_18	AC	43 ms 10,368 KB
testcase_19	AC	42 ms 10,240 KB
testcase_20	AC	44 ms 11,392 KB
testcase_21	AC	44 ms 11,392 KB
testcase_22	AC	42 ms 9,856 KB
testcase_23	AC	42 ms 10,880 KB
testcase_24	AC	43 ms 10,880 KB
testcase_25	AC	42 ms 9,600 KB
testcase_26	AC	42 ms 9,728 KB
testcase_27	AC	43 ms 11,392 KB
testcase_28	AC	43 ms 9,344 KB
testcase_29	AC	164 ms 30,336 KB
testcase_30	AC	173 ms 35,968 KB
testcase_31	AC	165 ms 35,960 KB
testcase_32	AC	172 ms 34,904 KB
testcase_33	AC	178 ms 35,968 KB
testcase_34	AC	168 ms 35,968 KB
testcase_35	AC	174 ms 35,968 KB
testcase_36	AC	169 ms 33,664 KB
testcase_37	AC	172 ms 35,124 KB
testcase_38	AC	174 ms 35,928 KB
testcase_39	AC	187 ms 35,968 KB
testcase_40	AC	171 ms 35,840 KB
testcase_41	AC	167 ms 27,904 KB
testcase_42	AC	167 ms 34,560 KB
testcase_43	AC	169 ms 34,944 KB
testcase_44	AC	175 ms 35,840 KB
testcase_45	AC	173 ms 35,968 KB
testcase_46	AC	177 ms 35,112 KB
evil_random20_1.txt	AC	158 ms 27,904 KB
evil_random20_2.txt	AC	157 ms 27,904 KB
evil_random20_3.txt	AC	160 ms 27,776 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll n, m, q;
vll a, b;

void input(){
    in(n, m, q);
    a.resize(n);
    b.resize(n);
    rep(i, n) in(a[i], b[i]);
}

ll dp1[1 << 20], dp2[1 << 20];

void solve(){
    vll suma(1 << n), sumb(1 << n);
    rep(i, 1 << n){
        ll sa = 0, sb = 0;
        rep(j, n){
            if(i & (1LL << j)){
                sa += a[j];
                sb += b[j];
            }
        }
        suma[i] = sa, sumb[i] = sb;
        if(sa <= m){
            chmax(dp1[i], sb);
        }
    }
    rep(i, 1 << n){
        rep(j, n){
            if(i & (1LL << j)) continue;
            ll bit = i | (1LL << j);
            chmax(dp2[bit], dp2[i]);
            if(suma[bit] <= q){
                chmax(dp2[bit], sumb[bit]);
            }
        }
    }
    ll ans = 0;
    rep(i, 1 << n){
        chmax(ans, dp1[i] + dp2[((1LL << n) - 1) ^ i]);
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード