#946735 (C++23) No.2617 容量3のナップザック

提出ソース

結果

問題	No.2617 容量3のナップザック
ユーザー	noya2
提出日時	2024-01-26 22:57:20
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	6,435 bytes
コンパイル時間	3,219 ms
コンパイル使用メモリ	267,428 KB
実行使用メモリ	68,764 KB
最終ジャッジ日時	2024-09-28 08:47:58
合計ジャッジ時間	24,046 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 13,888 KB
testcase_01	RE	-
testcase_02	RE	-
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,948 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	RE	-
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	1,871 ms 54,160 KB
testcase_13	RE	-
testcase_14	AC	1,734 ms 50,040 KB
testcase_15	RE	-
testcase_16	TLE	-
testcase_17	RE	-
testcase_18	RE	-
testcase_19	RE	-
testcase_20	RE	-
testcase_21	AC	765 ms 27,488 KB
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	RE	-
testcase_26	TLE	-
testcase_27	AC	584 ms 23,292 KB
testcase_28	RE	-
testcase_29	AC	300 ms 17,576 KB
testcase_30	RE	-
testcase_31	AC	1,567 ms 43,472 KB
testcase_32	RE	-
testcase_33	RE	-
testcase_34	RE	-
testcase_35	RE	-
testcase_36	TLE	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-

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

ソースコード

raw source code

#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 1 "/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 << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),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(vector<T> &v){
    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(){
    ll n, k, seed, a, b, m; in(n,k,seed,a,b,m);
    array<vector<ll>,3> vs = {};
    vector<ll> fs(n+n);
    fs[0] = seed;
    rep(i,n+n-1){
        fs[i+1] = (a * fs[i] + b) % m;
    }
    rep(i,n){
        int w = fs[i] % 3 + 1;
        vs[w-1].emplace_back(w*fs[n+i]);
    }
    sort(all(vs[0])); reverse(all(vs[0]));
    sort(all(vs[1])); reverse(all(vs[1]));
    int sz0 = vs[0].size();
    auto get0 = [&](int i){
        if (i < sz0){
            return vs[0][i];
        }
        return 0LL;
    };
    int sz1 = vs[1].size();
    auto get1 = [&](int i){
        if (i < sz1){
            return vs[1][i];
        }
        return 0LL;
    };
    ll ans = 0;
    rep(t,3){
        multiset<ll> bg, sm;
        ll cur = 0;
        auto add = [&](ll x){
            cur += x;
            bg.insert(x);
            if ((int)(bg.size()) == k+1){
                ll mi = *bg.begin();
                cur -= mi;
                bg.erase(bg.begin());
                sm.insert(mi);
                if ((int)(sm.size()) == k+10){
                    sm.erase(sm.begin());
                }
            }
        };
        auto del = [&](ll x){
            if (bg.contains(x)){
                bg.erase(bg.find(x));
                cur -= x;
                if (!sm.empty()){
                    ll ma = *sm.rbegin();
                    cur += ma;
                    sm.erase(sm.find(ma));
                    bg.insert(ma);
                }
            }
            else {
                sm.erase(sm.find(x));
            }
        };
        for (auto x : vs[2]) add(x);
        rep(j,t){
            add(get0(j)+get1(j));
        }
        rep(i,k+1){
            if (get0(t+3*i+0) == 0) break;
            add(get0(t+3*i+0)+get0(t+3*i+1)+get0(t+3*i+2));
        }
        chmax(ans,cur);
        rep(i,k+1){
            if (get0(t+3*i+0) != 0){
                del(get0(t+3*i+0)+get0(t+3*i+1)+get0(t+3*i+2));
            }
            add(get0(t+3*i+0)+get1(t+3*i+0));
            add(get0(t+3*i+1)+get1(t+3*i+1));
            add(get0(t+3*i+2)+get1(t+3*i+2));
            chmax(ans,cur);
        }
    }
    out(ans);
}

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

yukicoder

結果

テストケース

ソースコード