結果

問題 No.2617 容量3のナップザック
ユーザー pitP
提出日時 2024-01-27 01:53:31
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,799 bytes
コンパイル時間 4,336 ms
コンパイル使用メモリ 260,088 KB
最終ジャッジ日時 2025-02-19 00:03:39
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 25 WA * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 
typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, K; cin >> N >> K;
    ll seed, a, b, m; cin >> seed >> a >> b >> m;
    vector<int> f(2 * N), w(N), v(N);
    f[0] = seed;
    rep(i,2*N-1) f[i + 1] = (a * f[i] + b) % m;
    rep(i,N) w[i] = f[i] % 3 + 1;
    rep(i,N) v[i] = w[i] * f[N + i];
    vector V(3, vector<ll>(N));
    rep(i,N) V[w[i] - 1][i] = v[i];
    rep(c,3) sort(rall(V[c]));
    vector acc(3, vector<ll>(3 * K + 1));
    rep(c,3){
        acc[c][0] = 0;
        rep(i,3*K) {
            acc[c][i + 1] = acc[c][i];
            if(i < N) acc[c][i + 1] += V[c][i];
        }
    }
    vector<ll> F(K + 1);
    for(int x = 0; x <= K; x++){
        auto fx = [&](int j){
            return acc[1][j] + acc[0][3 * x - 2 * j];
        };
        auto df = [&](int j){
            return fx(j + 1) - fx(j);
        };
        int ok = x, ng = -1;
        while(abs(ok - ng) > 1){
            int mid = (ok + ng) / 2;
            if(df(mid) <= 0) ok = mid;
            else ng = mid;
        }
        F[x] = fx(ok);
    }
    ll ans = 0;
    for(int i = 0; i <= K; i++){
        ll tmp = acc[2][i] + F[K - i];
        chmax(ans, tmp);
    }
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0