結果

問題 No.2617 容量3のナップザック
ユーザー hitonanodehitonanode
提出日時 2024-01-26 21:41:46
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 8,296 bytes
コンパイル時間 3,003 ms
コンパイル使用メモリ 198,804 KB
実行使用メモリ 53,696 KB
最終ジャッジ日時 2024-09-28 07:55:19
合計ジャッジ時間 8,116 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 WA -
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 3 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 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 226 ms
39,448 KB
testcase_13 AC 139 ms
39,336 KB
testcase_14 AC 217 ms
38,104 KB
testcase_15 AC 106 ms
27,948 KB
testcase_16 AC 154 ms
29,376 KB
testcase_17 AC 196 ms
36,640 KB
testcase_18 AC 163 ms
35,792 KB
testcase_19 AC 20 ms
8,548 KB
testcase_20 AC 130 ms
36,440 KB
testcase_21 AC 109 ms
20,948 KB
testcase_22 AC 148 ms
40,044 KB
testcase_23 AC 238 ms
45,708 KB
testcase_24 AC 8 ms
5,376 KB
testcase_25 WA -
testcase_26 AC 167 ms
30,988 KB
testcase_27 AC 84 ms
17,928 KB
testcase_28 AC 7 ms
5,376 KB
testcase_29 WA -
testcase_30 AC 147 ms
37,900 KB
testcase_31 AC 199 ms
36,268 KB
testcase_32 AC 205 ms
48,140 KB
testcase_33 AC 244 ms
49,424 KB
testcase_34 AC 292 ms
53,128 KB
testcase_35 AC 218 ms
48,136 KB
testcase_36 AC 313 ms
53,696 KB
testcase_37 AC 294 ms
53,472 KB
testcase_38 AC 162 ms
43,276 KB
testcase_39 WA -
testcase_40 AC 232 ms
49,040 KB
testcase_41 AC 85 ms
44,080 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    int N, K;
    lint seed, a, b, m;
    cin >> N >> K >> seed >> a >> b >> m;

    vector<lint> f(N * 2);
    f.at(0) = seed;
    FOR(i, 1, f.size()) f.at(i) = (a * f.at(i - 1) + b) % m;
    vector<lint> W(N), V(N);
    REP(i, N) W.at(i) = f.at(i) % 3 + 1, V.at(i) = f.at(i + N) * W.at(i);

    dbgif(N <= 100, make_tuple(W, V));

    vector<vector<lint>> w2vs(4);
    REP(i, N) w2vs.at(W.at(i)).push_back(V.at(i));

    for (auto &v : w2vs) {
        sort(v.rbegin(), v.rend());
        while ((int)v.size() > K) v.pop_back();
    }

    dbg(w2vs);

    vector w2vscs(4, vector<lint>{0});
    REP(d, 4) {
        for (lint x : w2vs.at(d)) {
            lint tmp = w2vscs.at(d).back() + x;
            w2vscs.at(d).push_back(tmp);
        }
    }
    dbg(w2vscs);

    lint ret = 0;

    REP(n3, w2vs.at(3).size() + 1) {
        if (n3 > K) break;
        const int rem = K - n3;
        dbg(make_tuple(n3, rem));

        int lo2 = 0, hi2 = min<int>(rem, w2vs.at(2).size());

        auto eval = [&](int n2) -> lint {
            int n1 = (rem - n2) * 3 + n2;
            chmin<int>(n1, (int)w2vs.at(1).size());
            return w2vscs.at(3).at(n3) + w2vscs.at(2).at(n2) + w2vscs.at(1).at(n1);
        };

        while (hi2 - lo2 > 2) {
            int mid1 = (lo2 * 2 + hi2) / 3, mid2 = (lo2 + hi2 * 2) / 3;
            lint emid1 = eval(mid1), emid2 = eval(mid2);
            if (emid1 > emid2) {
                hi2 = mid2;
            } else {
                lo2 = mid1;
            }
        }
        FOR(i2, lo2, hi2 + 1) {
            if (chmax(ret, eval(i2))) {
                dbg(make_tuple(n3, i2, ret));
            }
        }
    }

    cout << ret << '\n';
}
0