結果
問題 | No.2617 容量3のナップザック |
ユーザー |
![]() |
提出日時 | 2024-01-26 22:03:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,736 bytes |
コンパイル時間 | 2,276 ms |
コンパイル使用メモリ | 204,568 KB |
最終ジャッジ日時 | 2025-02-18 23:16:15 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 31 WA * 9 |
ソースコード
//#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))#endifusing 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 unpackstatic 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]);rep(i,1,4) sort(all(V[i]),greater<ll>());vl cs(V[1].size() + 1);rep(i,V[1].size()) cs[i+1] = cs[i] + V[1][i];int id1 = 0,id2 = 0;ll ans = 0;ll su = 0;chmax(ans,cs[min(3*k,(int)V[1].size())]-cs[0]);rep(i,k) {int rem = k - i - 1;if(id1 == V[3].size() && id2 == V[2].size()) {break;}else if(id1 == V[3].size()) {su += (id2 < V[1].size() ? V[1][id2] : 0) + V[2][id2];id2++;chmax(ans,su + cs[min(id2 + 3 * rem,(int)V[1].size())] - cs[min(id2,(int)V[1].size())]);}else if(id2 == V[2].size()) {su += V[3][id1];id1++;chmax(ans,su + cs[min(id2 + 3 * rem,(int)V[1].size())] - cs[min(id2,(int)V[1].size())]);}else if(V[3][id1] > (id2 < V[1].size() ? V[1][id2] : 0) + V[2][id2]) {su += V[3][id1];id1++;chmax(ans,su + cs[min(id2 + 3 * rem,(int)V[1].size())] - cs[min(id2,(int)V[1].size())]);}else {su += (id2 < V[1].size() ? V[1][id2] : 0) + V[2][id2];id2++;chmax(ans,su + cs[min(id2 + 3 * rem,(int)V[1].size())] - cs[min(id2,(int)V[1].size())]);}debug(ans);}cout << ans << '\n';}int main() {//INT(TT);int TT = 1;while(TT--) solve();}