結果

問題 No.2329 Nafmo、イカサマをする
コンテスト
ユーザー sten_san
提出日時 2023-05-28 15:11:02
言語 C++17
(gcc 15.2.0 + boost 1.90.0)
コンパイル:
g++-15 -O2 -lm -std=c++17 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,554 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 1,125 ms
コンパイル使用メモリ 205,076 KB
最終ジャッジ日時 2026-06-30 23:19:13
合計ジャッジ時間 1,806 ms
ジャッジサーバーID
（参考情報） 		judge2_0 / judge3_0
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In instantiation of 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int64_t, int)>&]':
main.cpp:73:34:   required from 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int64_t, int)>]'
   73 |         return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
      |                               ~~~^~~~~~~~~~~~~~~~
main.cpp:87:8:   required from here
   87 |     fix([&](auto f, int64_t sum = 0, int d = 0) -> void {
      |     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   88 |         if (lhalf <= d) {
      |         ~~~~~~~~~~~~~~~~~
   89 |             return;
      |             ~~~~~~~
   90 |         }
      |         ~
   91 | 
      |         
   92 |         for (auto v : a) {
      |         ~~~~~~~~~~~~~~~~~~
   93 |             lall.push_back(sum + v);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             f(sum + v, d + 1);
      |             ~~~~~~~~~~~~~~~~~~
   95 |         }
      |         ~
   96 |     })();
      |     ~~  
main.cpp:73:34: error: use of 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int64_t, int)>&]' before deduction of 'auto'
   73 |         return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
      |                               ~~~^~~~~~~~~~~~~~~~
main.cpp:73:34: error: use of 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int64_t, int)>&]' before deduction of 'auto'
main.cpp: In instantiation of 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:34, int64_t, int)>&]':
main.cpp:73:34:   required from 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:34, int64_t, int)>]'
main.cpp:103:8:   required from here
  103 |     fix([&](auto f, int64_t sum = 0, int d = 0) -> void {
      |     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |         if (rhalf <= d) {
      |         ~~~~~~~~~~~~~~~~~
  105 |             return;
      |             ~~~~~~~
  106 |         }

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

int main() {
    int n, m, k; cin >> n >> m >> k;
    auto a = vec<int64_t>(uns, n);
    for (auto &e : a) cin >> e;

    const int lhalf = (k + 1) / 2;
    const int rhalf = k - lhalf;

    auto lall = vec<int64_t>(uns, 0);

    fix([&](auto f, int64_t sum = 0, int d = 0) -> void {
        if (lhalf <= d) {
            return;
        }

        for (auto v : a) {
            lall.push_back(sum + v);
            f(sum + v, d + 1);
        }
    })();
    lall.push_back(0);

    sort(begin(lall), end(lall));

    auto rall = vec<int64_t>(uns, 0);

    fix([&](auto f, int64_t sum = 0, int d = 0) -> void {
        if (rhalf <= d) {
            return;
        }

        for (auto v : a) {
            rall.push_back(sum + v);
            f(sum + v, d + 1);
        }
    })();
    rall.push_back(0);

    sort(begin(rall), end(rall));

    int64_t ans = 0;
    for (auto l : lall) {
        auto iter = upper_bound(begin(rall), end(rall), m - l);

        if (iter != begin(rall)) {
            chmax(ans, l + *(iter - 1));
        }
    }

    cout << ans << endl;
}
0