結果

問題 No.2869 yuusaan's Knapsacks
ユーザー noya2noya2
提出日時 2024-08-30 22:28:26
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,205 ms / 4,500 ms
コード長 5,680 bytes
コンパイル時間 3,387 ms
コンパイル使用メモリ 263,288 KB
実行使用メモリ 17,716 KB
最終ジャッジ日時 2024-08-30 22:28:46
合計ジャッジ時間 18,606 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 354 ms
9,216 KB
testcase_04 AC 331 ms
9,088 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 920 ms
17,588 KB
testcase_07 AC 371 ms
9,220 KB
testcase_08 AC 92 ms
6,944 KB
testcase_09 AC 66 ms
6,940 KB
testcase_10 AC 489 ms
11,408 KB
testcase_11 AC 243 ms
7,544 KB
testcase_12 AC 825 ms
15,268 KB
testcase_13 AC 232 ms
7,620 KB
testcase_14 AC 469 ms
9,992 KB
testcase_15 AC 372 ms
9,864 KB
testcase_16 AC 469 ms
10,892 KB
testcase_17 AC 1,205 ms
17,708 KB
testcase_18 AC 828 ms
14,620 KB
testcase_19 AC 641 ms
12,304 KB
testcase_20 AC 71 ms
6,940 KB
testcase_21 AC 728 ms
13,080 KB
testcase_22 AC 841 ms
13,080 KB
testcase_23 AC 244 ms
8,316 KB
testcase_24 AC 977 ms
15,400 KB
testcase_25 AC 148 ms
6,944 KB
testcase_26 AC 1,020 ms
13,080 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 899 ms
17,716 KB
testcase_29 AC 922 ms
17,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n, m; in(n,m);
    vector<ll> a(n); in(a);
    vector<ll> b(m), c(m);
    rep(i,m) in(b[i],c[i]);
    vector<ll> bsum(1<<m,0), csum(1<<m,0);
    rep(s,1<<m){
        rep(i,m){
            if (s >> i & 1){
                bsum[s] += b[i];
                csum[s] += c[i];
            }
        }
    }
    vector<vector<ll>> dp(n+1,vector<ll>(1<<m,-linf));
    dp[0][0] = 0;
    vector<vector<int>> pre(n+1,vector<int>(1<<m,0));
    int tot = (1<<m)-1;
    rep(i,n){
        dp[i+1] = dp[i];
        rep(s,1<<m){
            int sub = tot^s;
            int cur = sub;
            while (cur != 0){
                if (csum[cur] <= a[i]){
                    if (chmax(dp[i+1][s^cur],dp[i][s]+bsum[cur])){
                        pre[i+1][s^cur] = cur;
                    }
                }
                --cur &= sub;
            }
        }
    }
    ll ans = -linf-1, cur = -1;
    rep(s,1<<m){
        if (chmax(ans,dp[n][s])){
            cur = s;
        }
    }
    assert(cur != -1);
    vector<vector<int>> cons(n);
    reb(i,n){
        rep(j,m){
            if (pre[i+1][cur] >> j & 1){
                cons[i].emplace_back(j+1);
            }
        }
        cur ^= pre[i+1][cur];
    }
    out(ans);
    rep(i,n){
        out(cons[i].size(),cons[i]);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0