結果

問題 No.2232 Miser's Gift
ユーザー hibit_athibit_at
提出日時 2023-03-04 00:45:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 3,810 bytes
コンパイル時間 1,043 ms
コンパイル使用メモリ 112,616 KB
実行使用メモリ 43,264 KB
最終ジャッジ日時 2024-09-18 00:46:59
合計ジャッジ時間 9,013 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 171 ms
43,264 KB
testcase_04 AC 171 ms
43,136 KB
testcase_05 AC 18 ms
7,168 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 121 ms
6,940 KB
testcase_08 AC 167 ms
43,136 KB
testcase_09 AC 172 ms
43,264 KB
testcase_10 AC 171 ms
43,136 KB
testcase_11 AC 177 ms
43,136 KB
testcase_12 AC 172 ms
43,136 KB
testcase_13 AC 170 ms
43,136 KB
testcase_14 AC 175 ms
43,136 KB
testcase_15 AC 168 ms
43,136 KB
testcase_16 AC 172 ms
43,264 KB
testcase_17 AC 169 ms
43,136 KB
testcase_18 AC 166 ms
43,136 KB
testcase_19 AC 178 ms
43,136 KB
testcase_20 AC 180 ms
43,264 KB
testcase_21 AC 172 ms
43,264 KB
testcase_22 AC 165 ms
43,136 KB
testcase_23 AC 169 ms
43,136 KB
testcase_24 AC 179 ms
43,136 KB
testcase_25 AC 168 ms
43,136 KB
testcase_26 AC 172 ms
43,264 KB
testcase_27 AC 179 ms
43,136 KB
testcase_28 AC 172 ms
43,136 KB
testcase_29 AC 177 ms
43,264 KB
testcase_30 AC 167 ms
43,264 KB
testcase_31 AC 167 ms
43,136 KB
testcase_32 AC 168 ms
43,136 KB
testcase_33 AC 173 ms
43,136 KB
testcase_34 AC 171 ms
43,136 KB
testcase_35 AC 167 ms
43,136 KB
testcase_36 AC 165 ms
43,136 KB
testcase_37 AC 172 ms
43,264 KB
testcase_38 AC 4 ms
6,944 KB
testcase_39 AC 3 ms
6,944 KB
testcase_40 AC 3 ms
6,940 KB
testcase_41 AC 4 ms
6,940 KB
testcase_42 AC 3 ms
6,940 KB
testcase_43 AC 3 ms
6,940 KB
testcase_44 AC 4 ms
6,940 KB
testcase_45 AC 3 ms
6,940 KB
testcase_46 AC 3 ms
6,940 KB
testcase_47 AC 3 ms
6,940 KB
testcase_48 AC 2 ms
6,944 KB
testcase_49 AC 2 ms
6,940 KB
testcase_50 AC 2 ms
6,944 KB
testcase_51 AC 2 ms
6,944 KB
testcase_52 AC 2 ms
6,944 KB
testcase_53 AC 2 ms
6,940 KB
testcase_54 AC 2 ms
6,944 KB
testcase_55 AC 2 ms
6,940 KB
testcase_56 AC 2 ms
6,940 KB
testcase_57 AC 2 ms
6,940 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, max_w;
    cin >> n >> max_w;
    vector<vector<int>> dp(n + 1, vector<int>(max_w + 1));
    rep(i, n)
    {
        int w, v;
        cin >> w >> v;
        rep(j, max_w + 1)
        {
            auto chmax = [](auto &a, auto b)
            { a = max(a, b); };
            chmax(dp[i + 1][j], dp[i][j]);
            if (j + w <= max_w)
            {
                chmax(dp[i + 1][j + w], dp[i][j] + v);
            }
        }
    }
    rep1(x, max_w)
    {
        cout << dp[n][max_w] - dp[n][max_w - x] + 1 << endl;
    }
}
0