結果

問題 No.2869 yuusaan's Knapsacks
ユーザー dyktr_06dyktr_06
提出日時 2024-08-30 22:41:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 5,631 bytes
コンパイル時間 2,242 ms
コンパイル使用メモリ 212,844 KB
実行使用メモリ 20,252 KB
最終ジャッジ日時 2024-08-30 22:41:46
合計ジャッジ時間 28,470 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,536 KB
testcase_01 AC 3 ms
7,532 KB
testcase_02 AC 2 ms
7,536 KB
testcase_03 AC 585 ms
9,896 KB
testcase_04 AC 612 ms
10,028 KB
testcase_05 AC 3 ms
6,944 KB
testcase_06 RE -
testcase_07 AC 639 ms
10,916 KB
testcase_08 AC 141 ms
7,040 KB
testcase_09 AC 114 ms
7,024 KB
testcase_10 AC 922 ms
13,964 KB
testcase_11 AC 390 ms
9,552 KB
testcase_12 AC 1,557 ms
19,200 KB
testcase_13 AC 374 ms
9,708 KB
testcase_14 AC 774 ms
13,636 KB
testcase_15 AC 683 ms
12,500 KB
testcase_16 AC 813 ms
13,312 KB
testcase_17 RE -
testcase_18 AC 1,480 ms
19,200 KB
testcase_19 AC 1,137 ms
17,328 KB
testcase_20 AC 120 ms
6,952 KB
testcase_21 AC 1,224 ms
14,404 KB
testcase_22 AC 1,374 ms
15,668 KB
testcase_23 AC 454 ms
9,644 KB
testcase_24 AC 1,715 ms
19,348 KB
testcase_25 AC 250 ms
7,472 KB
testcase_26 AC 1,538 ms
18,012 KB
testcase_27 AC 3 ms
7,532 KB
testcase_28 RE -
testcase_29 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#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 T;

void input(){
    in(T);
}

ll dp[16][1 << 16];
ll prv[16][1 << 16];

template <typename T>
vector<T> getSubmask(T x){
    vector<T> submask;
    for(T i = x; ; i = (i - 1) & x){
        submask.push_back(i);
        if(i == 0) break;
    }
    return submask;
}

void solve(){
    ll n, m; in(n, m);
    vll e; vin(e, n);
    vll v(m), w(m);
    rep(i, m) in(v[i], w[i]);

    dp[0][0] = 1;
    vll sv(1 << m), sw(1 << m);
    rep(bit, 1 << m){
        rep(i, m){
            if(bit & (1 << i)){
                sv[bit] += v[i];
                sw[bit] += w[i];
            }
        }
    }
    rep(i, n){
        rep(j, 1 << m){
            ll bit = (1 << m) - 1 - j;
            for(auto sub : getSubmask(bit)){
                if(sw[sub] <= e[i]){
                    if(chmax(dp[i + 1][j | sub], dp[i][j])){
                        prv[i + 1][j | sub] = j;
                    }
                }
            }
        }
    }
    ll ans = 0;
    ll ansbit = 0;
    rep(i, 1 << m){
        if(dp[n][i]){
            if(chmax(ans, sv[i])){
                ansbit = i;
            }
        }
    }

    vector<vll> res(n);
    rrep(i, n){
        ll bit = ansbit ^ prv[i + 1][ansbit];
        ansbit = prv[i + 1][ansbit];
        rep(j, m){
            if(bit & (1 << j)){
                res[i].push_back(j + 1);
            }
        }
    }
    out(ans);
    rep(i, n){
        cout << res[i].size() << " ";
        out(res[i]);
    }
}

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

    T = 1;
    // input();
    while(T--) solve();
}
0