#874896 (C++17) No.2329 Nafmo、イカサマをする

提出ソース

結果

問題	No.2329 Nafmo、イカサマをする
ユーザー	jupiro
提出日時	2023-05-28 15:23:05
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,619 bytes
コンパイル時間	2,173 ms
コンパイル使用メモリ	214,588 KB
実行使用メモリ	6,940 KB
最終ジャッジ日時	2024-06-08 07:38:09
合計ジャッジ時間	5,384 ms
ジャッジサーバーID （参考情報）	judge3 / 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	AC	1 ms 5,376 KB
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	1 ms 5,376 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	1 ms 5,376 KB
testcase_10	AC	1 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	1 ms 5,376 KB
testcase_13	AC	1 ms 5,376 KB
testcase_14	AC	1 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	1 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	26 ms 5,376 KB
testcase_20	AC	5 ms 5,376 KB
testcase_21	AC	22 ms 5,376 KB
testcase_22	AC	2 ms 5,376 KB
testcase_23	AC	21 ms 5,376 KB
testcase_24	AC	5 ms 5,376 KB
testcase_25	AC	3 ms 5,376 KB
testcase_26	AC	4 ms 5,376 KB
testcase_27	AC	4 ms 5,376 KB
testcase_28	AC	2 ms 5,376 KB
testcase_29	AC	7 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB
testcase_31	AC	25 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	4 ms 5,376 KB
testcase_34	AC	6 ms 5,376 KB
testcase_35	AC	2 ms 5,376 KB
testcase_36	WA	-
testcase_37	AC	13 ms 5,376 KB
testcase_38	AC	305 ms 5,376 KB
testcase_39	AC	297 ms 5,376 KB
testcase_40	AC	326 ms 5,376 KB
testcase_41	AC	541 ms 5,376 KB
testcase_42	AC	327 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using ll = long long;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());

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 = (int)1e9 + 7;
const long long INF = 1LL << 62;

template <int mod> struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if ((x += p.x) >= mod)
            x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if ((x += mod - p.x) >= mod)
            x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while (n > 0) {
            if (n & 1)
                ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend std::ostream &operator<<(std::ostream &os, const ModInt &p) { return os << p.x; }

    friend std::istream &operator>>(std::istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

constexpr int mod = (int)1e9 + 7;
using mint = ModInt<mod>;

void solve() {
    ll n, m, K;
    cin >> n >> m >> K;
    std::vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    std::sort(a.begin(), a.end());
    a.erase(std::unique(a.begin(), a.end()), a.end());
    std::reverse(a.rbegin(), a.rend());
    ll res = 0;
    for (int i = 0; i < n; i++) {
        for (int cnt_i = 0; cnt_i <= K; cnt_i++) {
            ll t = a[i] * cnt_i;
            if (t > m)
                break;
            chmax(res, t);
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int cnt_i = 1; cnt_i <= K; cnt_i++) {
                for (int cnt_j = 1; cnt_i + cnt_j <= K; cnt_j++) {
                    ll t = a[i] * cnt_i + a[j] * cnt_j;
                    if (t > m)
                        break;
                    chmax(res, t);
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                for (int cnt_i = 1; cnt_i <= K; cnt_i++) {
                    for (int cnt_j = 1; cnt_i + cnt_j <= K; cnt_j++) {
                        for (int cnt_k = 1; cnt_i + cnt_j + cnt_k <= K; cnt_k++) {
                            ll t = a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k;
                            if (t > m)
                                break;
                            chmax(res, t);
                        }
                    }
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                for (int l = k + 1; l < n; l++) {
                    for (int cnt_i = 1; cnt_i <= K; cnt_i++) {
                        for (int cnt_j = 1; cnt_i + cnt_j <= K; cnt_j++) {
                            for (int cnt_k = 1; cnt_i + cnt_j + cnt_k <= K; cnt_k++) {
                                for (int cnt_l = 1; cnt_i + cnt_j + cnt_k + cnt_l <= K; cnt_l++) {
                                    ll t = a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l;
                                    if (t > m)
                                        break;
                                    chmax(res, t);
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                for (int l = k + 1; l < n; l++) {
                    for (int p = l + 1; p < n; p++) {
                        for (int cnt_i = 1; cnt_i <= K and a[i] * cnt_i <= m; cnt_i++) {
                            for (int cnt_j = 1; cnt_i + cnt_j <= K and a[i] * cnt_i + a[j] * cnt_j <= m; cnt_j++) {
                                for (int cnt_k = 1;
                                     cnt_i + cnt_j + cnt_k <= K and a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k <= m;
                                     cnt_k++) {
                                    for (int cnt_l = 1; cnt_i + cnt_j + cnt_k + cnt_l <= K and
                                                        a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l <= m;
                                         cnt_l++) {
                                        for (int cnt_p = 1;
                                             cnt_i + cnt_j + cnt_k + cnt_l + cnt_p <= K and
                                             a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l + a[p] * cnt_p <=
                                                 m;
                                             cnt_p++) {
                                            ll t = a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l +
                                                   a[p] * cnt_p;
                                            chmax(res, t);
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    if (K == 6) {
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n and a[i] + a[j] <= m; j++) {
                for (int k = j + 1; k < n and a[i] + a[j] + a[k] <= m; k++) {
                    for (int l = k + 1; l < n and a[i] + a[j] + a[k] + a[l] <= m; l++) {
                        for (int p = l + 1; p < n and a[i] + a[j] + a[k] + a[l] + a[p] <= m; p++) {
                            for (int q = p + 1; q < n and a[i] + a[j] + a[k] + a[l] + a[p] + a[q] <= m; q++) {
                                chmax(res, a[i] + a[j] + a[k] + a[l] + a[p] + a[q]);
                            }
                        }
                    }
                }
            }
        }
    }
    cout << res << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int I_love_KKT89 = 1;
    // cin >> I_love_KKT89;
    for (int Case = 1; Case <= I_love_KKT89; ++Case) {
        // cout << "Case #" << Case << ": ";
        solve();
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード