結果

問題 No.2617 容量3のナップザック
ユーザー dyktr_06dyktr_06
提出日時 2024-01-26 23:31:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,404 bytes
コンパイル時間 3,880 ms
コンパイル使用メモリ 230,416 KB
実行使用メモリ 74,488 KB
最終ジャッジ日時 2024-01-26 23:31:17
合計ジャッジ時間 12,812 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,548 KB
testcase_01 AC 2 ms
6,548 KB
testcase_02 AC 2 ms
6,548 KB
testcase_03 AC 2 ms
6,548 KB
testcase_04 AC 2 ms
6,548 KB
testcase_05 AC 2 ms
6,548 KB
testcase_06 AC 2 ms
6,548 KB
testcase_07 WA -
testcase_08 AC 2 ms
6,548 KB
testcase_09 AC 2 ms
6,548 KB
testcase_10 AC 2 ms
6,548 KB
testcase_11 AC 2 ms
6,548 KB
testcase_12 AC 337 ms
46,472 KB
testcase_13 WA -
testcase_14 AC 300 ms
45,792 KB
testcase_15 AC 221 ms
40,608 KB
testcase_16 AC 189 ms
38,952 KB
testcase_17 AC 301 ms
44,888 KB
testcase_18 AC 275 ms
44,844 KB
testcase_19 AC 39 ms
9,900 KB
testcase_20 WA -
testcase_21 AC 147 ms
24,852 KB
testcase_22 WA -
testcase_23 AC 374 ms
68,520 KB
testcase_24 AC 12 ms
6,548 KB
testcase_25 AC 131 ms
29,864 KB
testcase_26 AC 203 ms
40,176 KB
testcase_27 WA -
testcase_28 AC 13 ms
6,548 KB
testcase_29 AC 58 ms
18,624 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 413 ms
72,440 KB
testcase_33 AC 451 ms
72,440 KB
testcase_34 WA -
testcase_35 AC 415 ms
71,824 KB
testcase_36 AC 406 ms
73,832 KB
testcase_37 AC 424 ms
72,440 KB
testcase_38 AC 394 ms
73,336 KB
testcase_39 AC 282 ms
43,848 KB
testcase_40 WA -
testcase_41 AC 286 ms
74,072 KB
権限があれば一括ダウンロードができます

ソースコード

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 n, k, seed, a, b, m;

void input(){
    in(n, k, seed, a, b, m);
}

void solve(){
    vll f(2 * n);
    f[0] = seed;
    rep(i, 1, 2 * n){
        f[i] = (a * f[i - 1] + b) % m;
    }
    vll v(n), w(n);
    rep(i, n){
        w[i] = (f[i] % 3) + 1;
        v[i] = w[i] * f[n + i];
    }
    vector<priority_queue<ll>> q(4);
    rep(i, n){
        q[w[i]].push(v[i]);
    }
    using T = tuple<ll, ll, ll>;
    priority_queue<T, vector<T>, greater<T>> fin;
    while(q[1].size() && q[2].size()){
        ll t1 = q[1].top(), t2 = q[2].top();
        fin.emplace(t1 + t2, 2, t2);
        q[1].pop();
        q[2].pop();
    }
    while(q[3].size()){
        ll t = q[3].top();
        q[3].pop();
        fin.emplace(t, 3, t);
    }
    while(q[2].size()){
        ll t = q[2].top();
        q[2].pop();
        fin.emplace(t, 3, t);
    }
    while(fin.size() > k){
        auto [vt, typ, v2] = fin.top();
        fin.pop();
        if(typ == 2) q[1].push(vt - v2);
    }
    ll ans = 0, cnt = fin.size();
    while(q[1].size() && cnt < k){
        if(q[1].size() >= 3){
            ll t1 = q[1].top(); q[1].pop();
            ll t2 = q[1].top(); q[1].pop();
            ll t3 = q[1].top(); q[1].pop();
            ans += t1 + t2 + t3;
        }else if(q[1].size() == 2){
            ll t1 = q[1].top(); q[1].pop();
            ll t2 = q[1].top(); q[1].pop();
            ans += t1 + t2;
        }else if(q[1].size() == 1){
            ll t1 = q[1].top(); q[1].pop();
            ans += t1;
        }
        cnt++;
    }
    while(fin.size()){
        auto [vt, typ, vt2] = fin.top();
        fin.pop();
        if(typ == 2){
            if(q[1].size() >= 2){
                ll t1 = q[1].top(); q[1].pop();
                ll t2 = q[1].top(); q[1].pop();
                if(vt2 < t1 + t2){
                    vt += t1 + t2 - vt2;
                }else{
                    q[1].push(t1);
                    q[1].push(t2);
                }
            }else if(q[1].size() == 1){
                ll t1 = q[1].top(); q[1].pop();
                if(vt2 < t1){
                    vt += t1 - vt2;
                }else{
                    q[1].push(t1);
                }
            }
        }else if(typ == 3){
            if(q[1].size() >= 3){
                ll t1 = q[1].top(); q[1].pop();
                ll t2 = q[1].top(); q[1].pop();
                ll t3 = q[1].top(); q[1].pop();
                if(vt2 < t1 + t2 + t3){
                    vt += t1 + t2 + t3 - vt2;
                }else{
                    q[1].push(t1);
                    q[1].push(t2);
                    q[1].push(t3);
                }
            }else if(q[1].size() == 2){
                ll t1 = q[1].top(); q[1].pop();
                ll t2 = q[1].top(); q[1].pop();
                if(vt2 < t1 + t2){
                    vt += t1 + t2 - vt2;
                }else{
                    q[1].push(t1);
                    q[1].push(t2);
                }
            }else if(q[1].size() == 1){
                ll t1 = q[1].top(); q[1].pop();
                if(vt2 < t1){
                    vt += t1 - vt2;
                }else{
                    q[1].push(t1);
                }
            }
        }
        ans += vt;
    }
    out(ans);
}

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