結果
問題 | No.2317 Expression Menu |
ユーザー | sten_san |
提出日時 | 2023-05-26 21:31:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 206 ms / 2,000 ms |
コード長 | 2,988 bytes |
コンパイル時間 | 1,826 ms |
コンパイル使用メモリ | 206,628 KB |
実行使用メモリ | 220,008 KB |
最終ジャッジ日時 | 2023-08-26 10:27:05 |
合計ジャッジ時間 | 9,685 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 15 ms
18,904 KB |
testcase_03 | AC | 196 ms
219,720 KB |
testcase_04 | AC | 194 ms
219,824 KB |
testcase_05 | AC | 195 ms
219,960 KB |
testcase_06 | AC | 198 ms
220,008 KB |
testcase_07 | AC | 198 ms
219,848 KB |
testcase_08 | AC | 198 ms
219,844 KB |
testcase_09 | AC | 196 ms
219,772 KB |
testcase_10 | AC | 199 ms
219,700 KB |
testcase_11 | AC | 200 ms
219,764 KB |
testcase_12 | AC | 195 ms
219,760 KB |
testcase_13 | AC | 199 ms
219,820 KB |
testcase_14 | AC | 201 ms
219,720 KB |
testcase_15 | AC | 200 ms
219,712 KB |
testcase_16 | AC | 199 ms
219,732 KB |
testcase_17 | AC | 200 ms
219,824 KB |
testcase_18 | AC | 194 ms
219,700 KB |
testcase_19 | AC | 199 ms
219,764 KB |
testcase_20 | AC | 199 ms
219,816 KB |
testcase_21 | AC | 197 ms
219,820 KB |
testcase_22 | AC | 196 ms
219,768 KB |
testcase_23 | AC | 205 ms
219,940 KB |
testcase_24 | AC | 204 ms
219,708 KB |
testcase_25 | AC | 205 ms
219,824 KB |
testcase_26 | AC | 205 ms
219,780 KB |
testcase_27 | AC | 205 ms
219,960 KB |
testcase_28 | AC | 206 ms
219,716 KB |
testcase_29 | AC | 206 ms
219,816 KB |
testcase_30 | AC | 204 ms
219,732 KB |
testcase_31 | AC | 201 ms
219,824 KB |
testcase_32 | AC | 205 ms
219,788 KB |
testcase_33 | AC | 1 ms
4,380 KB |
testcase_34 | AC | 1 ms
4,376 KB |
testcase_35 | AC | 3 ms
5,208 KB |
testcase_36 | AC | 2 ms
4,376 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 204 ms
219,712 KB |
testcase_39 | AC | 203 ms
219,768 KB |
ソースコード
#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, x, y; cin >> n >> x >> y; auto dp = vec<int64_t>(0, n + 1, x + 1, y + 1); for (int i = 1; i <= n; ++i) { int a, b, c; cin >> a >> b >> c; for (int j = 0; j <= x; ++j) { for (int k = 0; k <= y; ++k) { dp[i][j][k] = dp[i - 1][j][k]; if (0 <= j - a && 0 <= k - b) { chmax(dp[i][j][k], dp[i - 1][j - a][k - b] + c); } } } } cout << dp[n][x][y] << endl; }