結果

問題 No.2617 容量3のナップザック
ユーザー siganaisiganai
提出日時 2024-01-26 23:09:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 5,838 bytes
コンパイル時間 2,975 ms
コンパイル使用メモリ 218,768 KB
実行使用メモリ 58,744 KB
最終ジャッジ日時 2024-09-28 09:00:43
合計ジャッジ時間 10,091 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 3 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 155 ms
38,448 KB
testcase_13 AC 158 ms
45,108 KB
testcase_14 AC 152 ms
37,120 KB
testcase_15 AC 105 ms
31,016 KB
testcase_16 AC 99 ms
28,016 KB
testcase_17 AC 141 ms
35,828 KB
testcase_18 AC 136 ms
36,168 KB
testcase_19 AC 22 ms
8,800 KB
testcase_20 AC 143 ms
40,800 KB
testcase_21 AC 75 ms
20,572 KB
testcase_22 AC 165 ms
46,224 KB
testcase_23 AC 183 ms
45,068 KB
testcase_24 RE -
testcase_25 RE -
testcase_26 AC 107 ms
29,604 KB
testcase_27 AC 60 ms
17,152 KB
testcase_28 AC 7 ms
5,376 KB
testcase_29 AC 67 ms
21,828 KB
testcase_30 AC 154 ms
42,628 KB
testcase_31 AC 144 ms
35,236 KB
testcase_32 AC 183 ms
50,440 KB
testcase_33 AC 207 ms
50,324 KB
testcase_34 AC 215 ms
50,460 KB
testcase_35 AC 201 ms
50,440 KB
testcase_36 AC 200 ms
50,276 KB
testcase_37 AC 219 ms
50,444 KB
testcase_38 AC 187 ms
50,440 KB
testcase_39 RE -
testcase_40 AC 211 ms
50,444 KB
testcase_41 AC 104 ms
50,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
void First() {cout << "First\n";return;}
void Second() {cout << "Second\n";return;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }

#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;

void solve() {
    INT(n,k,seed,a,b,m);
    vl f(2*n),v(n),w(n);
    f[0] = seed;
    rep(i,1,2*n) {
        f[i] = (a * f[i-1] + b) % m;
    }
    rep(i,n) {
        w[i] = f[i] % 3 + 1;
        v[i] = w[i] * f[i+n];
    }
    vvl V(4);
    rep(i,n) V[w[i]].emplace_back(v[i]);
    int si = V[1].size();
    V[1].emplace_back(0);
    V[1].emplace_back(0);
    V[1].emplace_back(0);
    rep(i,1,4) sort(all(V[i]),greater<ll>());
    vector<deque<ll>> cs(3);
    rep(i,3) {
        rep(j,i,si,3) {
            cs[i].emplace_back(V[1][j] + V[1][j+1] + V[1][j+2]);
        }
    }
    ll ans = 0;
    ll su = 0;
    vl c3(V[3].size() + 1);
    rep(i,V[3].size()) c3[i+1] = c3[i] + V[3][i];
    vl MI(3);
    vector<deque<ll>> c1(3);
    rep(i,3) {
        c1[i].emplace_back(0);
        rep(j,cs[i].size()) {
            c1[i].emplace_back(c1[i].back() + cs[i][j]);
        }
    }
    debug(V);
    rep(i,min((int)V[2].size() + 1,k+1)) {
        int rem = k - i;
        int ok = 0,ng = min(rem + 1,(int)V[3].size() + 1);
        while(ng - ok > 1) {
            int mid = (ng + ok) / 2;
            if(rem - mid >= cs[i % 3].size()) ok = mid;
            else if(V[3][mid-1] > cs[i % 3][rem-mid]) ok = mid;
            else ng = mid;
        }
        ll tmp = c3[ok] + c1[i % 3][min(rem - ok,(int)cs[i % 3].size())] - MI[i % 3];
        debug(i,rem - ok,tmp,ok,su,su + tmp);
        chmax(ans,su + tmp);
        su += V[2][i];
        if(i < V[1].size()) su += V[1][i];
        if(!cs[i % 3].empty()) {
            MI[i % 3] += cs[i % 3].front();
            cs[i % 3].pop_front();
            c1[i % 3].pop_front();
        }
    }
    cout << ans << '\n';
}
int main() {
	//INT(TT);
	int TT = 1;
	while(TT--) solve();
}
0