結果

問題 No.2317 Expression Menu
ユーザー hibit_athibit_at
提出日時 2023-05-28 12:17:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 263 ms / 2,000 ms
コード長 4,070 bytes
コンパイル時間 1,274 ms
コンパイル使用メモリ 117,624 KB
実行使用メモリ 222,080 KB
最終ジャッジ日時 2024-06-08 02:59:27
合計ジャッジ時間 10,241 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
6,784 KB
testcase_01 AC 5 ms
6,784 KB
testcase_02 AC 19 ms
19,328 KB
testcase_03 AC 261 ms
221,952 KB
testcase_04 AC 248 ms
221,952 KB
testcase_05 AC 250 ms
222,080 KB
testcase_06 AC 250 ms
221,952 KB
testcase_07 AC 247 ms
222,080 KB
testcase_08 AC 252 ms
221,952 KB
testcase_09 AC 254 ms
222,080 KB
testcase_10 AC 259 ms
222,080 KB
testcase_11 AC 250 ms
222,080 KB
testcase_12 AC 249 ms
222,080 KB
testcase_13 AC 252 ms
222,080 KB
testcase_14 AC 256 ms
221,952 KB
testcase_15 AC 255 ms
221,952 KB
testcase_16 AC 251 ms
221,952 KB
testcase_17 AC 252 ms
221,952 KB
testcase_18 AC 253 ms
221,952 KB
testcase_19 AC 255 ms
222,080 KB
testcase_20 AC 256 ms
222,080 KB
testcase_21 AC 258 ms
221,952 KB
testcase_22 AC 252 ms
221,952 KB
testcase_23 AC 248 ms
221,952 KB
testcase_24 AC 246 ms
221,952 KB
testcase_25 AC 250 ms
221,952 KB
testcase_26 AC 247 ms
221,952 KB
testcase_27 AC 246 ms
221,952 KB
testcase_28 AC 263 ms
221,952 KB
testcase_29 AC 244 ms
221,952 KB
testcase_30 AC 244 ms
221,952 KB
testcase_31 AC 243 ms
222,080 KB
testcase_32 AC 248 ms
221,952 KB
testcase_33 AC 4 ms
5,376 KB
testcase_34 AC 3 ms
5,376 KB
testcase_35 AC 4 ms
5,376 KB
testcase_36 AC 4 ms
5,504 KB
testcase_37 AC 3 ms
5,376 KB
testcase_38 AC 247 ms
222,080 KB
testcase_39 AC 241 ms
221,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p)
{
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << "i = " << i << endl;
        os << v[i];
    }
    return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}

int main()
{
    int n, x, y;
    cin >> n >> x >> y;
    vector<pair<pair<int, int>, int>> vp(n);
    cin >> vp;
    // cout << vp << endl;
    using VI = vector<ll>;
    using VVI = vector<VI>;
    using VVVI = vector<VVI>;
    using VVVVI = vector<VVVI>;
    using VVVVVI = vector<VVVVI>;
    VVVI dp(n + 1, VVI(302, VI(302)));
    dp[0][0][0] = 0;
    rep(i, n)
    {
        auto [cost, c] = vp[i];
        auto [a, b] = cost;
        rep(j, 301)
        {
            rep(k, 301)
            {
                auto chmax = [](auto &a, auto b)
                { a = max(a, b); };
                chmax(dp[i + 1][j][k], dp[i][j][k]);
                chmax(dp[i + 1][min(301, j + a)][min(301, k + b)], dp[i][j][k] + c);
            }
        }
    }
    // cout << dp << endl;
    cout << dp[n][x][y] << endl;
}
0