結果
問題 |
No.2617 容量3のナップザック
|
ユーザー |
![]() |
提出日時 | 2024-01-26 22:37:25 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 235 ms / 2,000 ms |
コード長 | 1,893 bytes |
コンパイル時間 | 2,470 ms |
コンパイル使用メモリ | 203,672 KB |
最終ジャッジ日時 | 2025-02-18 23:32:42 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 40 |
ソースコード
#include <bits/stdc++.h> using namespace std; int main(){ int N, K; int seed, a, b, m; cin >> N >> K >> seed >> a >> b >> m; vector<long long> f(N * 2); f[0] = seed; for (int i = 1; i < N * 2; i++){ f[i] = (a * f[i - 1] + b) % m; } vector<int> w(N); vector<long long> v(N); for (int i = 0; i < N; i++){ w[i] = f[i] % 3 + 1; v[i] = w[i] * f[N + i]; } vector<vector<long long>> V(3); for (int i = 0; i < N; i++){ V[w[i] - 1].push_back(v[i]); } for (int i = 0; i < 3; i++){ sort(V[i].begin(), V[i].end(), greater<long long>()); } vector<vector<long long>> S(3); for (int i = 0; i < 3; i++){ int cnt = V[i].size(); S[i].resize(cnt + 1); S[i][0] = 0; for (int j = 0; j < cnt; j++){ S[i][j + 1] = S[i][j] + V[i][j]; } } auto get = [&](int i, int j) -> long long { return S[i][min(j, (int) S[i].size() - 1)]; }; auto solve1 = [&](int a, int b, int c){ return get(0, a * 3 + b) + get(1, b) + get(2, c); }; auto solve2 = [&](int c){ int L = 0, R = K - c; long long ans = 0; while (R - L > 2){ int ml = (L * 2 + R) / 3; int mr = (L + R * 2) / 3; long long s1 = solve1(ml, K - c - ml, c); long long s2 = solve1(mr, K - c - mr, c); ans = max(ans, s1); ans = max(ans, s2); if (s1 < s2){ L = ml; } else { R = mr; } } for (int i = 0; i <= K-c; i++){ ans = max(ans, solve1(i, K - c - i, c)); } return ans; }; int L = 0, R = K; long long ans = 0; while (R - L > 2){ int ml = (L * 2 + R) / 3; int mr = (L + R * 2) / 3; long long s1 = solve2(ml); long long s2 = solve2(mr); ans = max(ans, s1); ans = max(ans, s2); if (s1 < s2){ L = ml; } else { R = mr; } } for (int i = L; i <= R; i++){ ans = max(ans, solve2(i)); } cout << ans << endl; }