#965637 (C++17) No.2701 A cans -> B cans

提出ソース

結果

問題	No.2701 A cans -> B cans
ユーザー	dyktr_06
提出日時	2024-03-29 22:02:08
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	222 ms / 1,000 ms
コード長	5,435 bytes
コンパイル時間	1,985 ms
コンパイル使用メモリ	204,728 KB
実行使用メモリ	199,040 KB
最終ジャッジ日時	2024-09-30 15:58:35
合計ジャッジ時間	17,993 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	129 ms 198,784 KB
testcase_01	AC	132 ms 198,912 KB
testcase_02	AC	130 ms 198,784 KB
testcase_03	AC	127 ms 198,784 KB
testcase_04	AC	128 ms 198,784 KB
testcase_05	AC	133 ms 198,912 KB
testcase_06	AC	132 ms 198,912 KB
testcase_07	AC	129 ms 198,784 KB
testcase_08	AC	129 ms 198,784 KB
testcase_09	AC	129 ms 198,784 KB
testcase_10	AC	134 ms 198,784 KB
testcase_11	AC	128 ms 198,784 KB
testcase_12	AC	131 ms 198,784 KB
testcase_13	AC	129 ms 198,912 KB
testcase_14	AC	128 ms 198,784 KB
testcase_15	AC	129 ms 198,784 KB
testcase_16	AC	131 ms 198,784 KB
testcase_17	AC	131 ms 198,784 KB
testcase_18	AC	129 ms 198,912 KB
testcase_19	AC	139 ms 198,784 KB
testcase_20	AC	138 ms 198,784 KB
testcase_21	AC	137 ms 198,784 KB
testcase_22	AC	136 ms 198,784 KB
testcase_23	AC	131 ms 198,784 KB
testcase_24	AC	131 ms 198,784 KB
testcase_25	AC	132 ms 198,784 KB
testcase_26	AC	202 ms 198,912 KB
testcase_27	AC	206 ms 198,912 KB
testcase_28	AC	200 ms 198,912 KB
testcase_29	AC	208 ms 198,912 KB
testcase_30	AC	215 ms 199,040 KB
testcase_31	AC	217 ms 198,912 KB
testcase_32	AC	208 ms 199,040 KB
testcase_33	AC	206 ms 198,912 KB
testcase_34	AC	211 ms 199,040 KB
testcase_35	AC	210 ms 198,912 KB
testcase_36	AC	211 ms 198,912 KB
testcase_37	AC	208 ms 199,040 KB
testcase_38	AC	207 ms 199,040 KB
testcase_39	AC	206 ms 199,040 KB
testcase_40	AC	208 ms 198,912 KB
testcase_41	AC	215 ms 198,912 KB
testcase_42	AC	221 ms 198,912 KB
testcase_43	AC	213 ms 199,040 KB
testcase_44	AC	216 ms 199,040 KB
testcase_45	AC	216 ms 199,040 KB
testcase_46	AC	211 ms 198,912 KB
testcase_47	AC	205 ms 198,912 KB
testcase_48	AC	206 ms 198,912 KB
testcase_49	AC	208 ms 199,040 KB
testcase_50	AC	209 ms 198,912 KB
testcase_51	AC	208 ms 198,912 KB
testcase_52	AC	209 ms 199,040 KB
testcase_53	AC	213 ms 198,912 KB
testcase_54	AC	208 ms 199,040 KB
testcase_55	AC	210 ms 198,912 KB
testcase_56	AC	210 ms 198,912 KB
testcase_57	AC	210 ms 198,912 KB
testcase_58	AC	211 ms 199,040 KB
testcase_59	AC	130 ms 198,784 KB
testcase_60	AC	143 ms 198,784 KB
testcase_61	AC	131 ms 198,784 KB
testcase_62	AC	129 ms 198,784 KB
testcase_63	AC	128 ms 198,912 KB
testcase_64	AC	133 ms 198,784 KB
testcase_65	AC	133 ms 198,784 KB
testcase_66	AC	130 ms 198,784 KB
testcase_67	AC	129 ms 198,784 KB
testcase_68	AC	128 ms 198,784 KB
testcase_69	AC	220 ms 198,912 KB
testcase_70	AC	221 ms 198,912 KB
testcase_71	AC	216 ms 198,912 KB
testcase_72	AC	219 ms 198,912 KB
testcase_73	AC	216 ms 198,912 KB
testcase_74	AC	216 ms 198,784 KB
testcase_75	AC	222 ms 199,040 KB
testcase_76	AC	213 ms 199,040 KB
testcase_77	AC	219 ms 198,912 KB
testcase_78	AC	218 ms 198,912 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
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; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const 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, const 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 <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

void input(){
}

ll dp[5001][5001];

void solve(){
    ll n, m; in(n, m);
    vll a(n), b(n), c(n);
    rep(i, n){
        in(a[i], b[i], c[i]);
    }
    vll d(n);
    rep(i, n) d[i] = a[i] - b[i];

    rep(i, 5001) rep(j, 5001) dp[i][j] = -INF;
    dp[0][m] = 0;
    rep(i, n){
        // rep(j, m + 1){
        //     if(dp[i][j] == -INF) continue;
        //     // j - a[i] ... +1
        //     // j - a[i] - d[i] ... +2
        //     // j - a[i] - 2 * d[i] ... + 3
        //     rep(k, 0, j + 1){
        //         ll diff = j - k;
        //         ll f = 0;
        //         if(diff >= a[i]) f = (diff - a[i]) / d[i] + 1;
        //         // out(i, j, k, f);
        //         chmax(dp[i + 1][k], dp[i][j] + f * b[i] * c[i]);
        //     }
        // }
        rep(j, m + 1){
            if(j - a[i] >= 0){
                chmax(dp[i + 1][j - a[i]], dp[i][j] + b[i] * c[i]);
            }
        }
        for(int j = m + 1; j >= 0; j--){
            if(j + a[i] <= m && j - d[i] >= 0){
                chmax(dp[i + 1][j - d[i]], dp[i + 1][j] + b[i] * c[i]);
            }
        }
        rep(j, m + 1) chmax(dp[i + 1][j], dp[i][j]);
    }
    ll mx = 0;
    ll ans = 0;
    rep(i, 1, m + 1){
        chmax(ans, dp[n][m - i]);
        out(ans);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード