結果

問題 No.951 【本日限定】1枚頼むともう1枚無料!
ユーザー ningenMeningenMe
提出日時 2019-12-14 01:07:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,520 ms / 2,000 ms
コード長 3,596 bytes
コンパイル時間 2,393 ms
コンパイル使用メモリ 180,160 KB
実行使用メモリ 4,384 KB
最終ジャッジ日時 2023-09-10 08:43:19
合計ジャッジ時間 45,031 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 33 ms
4,376 KB
testcase_10 AC 20 ms
4,380 KB
testcase_11 AC 20 ms
4,376 KB
testcase_12 AC 289 ms
4,376 KB
testcase_13 AC 968 ms
4,380 KB
testcase_14 AC 165 ms
4,380 KB
testcase_15 AC 171 ms
4,380 KB
testcase_16 AC 255 ms
4,380 KB
testcase_17 AC 315 ms
4,380 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 1 ms
4,380 KB
testcase_20 AC 1 ms
4,384 KB
testcase_21 AC 19 ms
4,380 KB
testcase_22 AC 8 ms
4,376 KB
testcase_23 AC 12 ms
4,380 KB
testcase_24 AC 1,499 ms
4,376 KB
testcase_25 AC 1,506 ms
4,380 KB
testcase_26 AC 1,508 ms
4,380 KB
testcase_27 AC 1,512 ms
4,380 KB
testcase_28 AC 1,496 ms
4,376 KB
testcase_29 AC 1,499 ms
4,380 KB
testcase_30 AC 2 ms
4,380 KB
testcase_31 AC 1 ms
4,384 KB
testcase_32 AC 9 ms
4,376 KB
testcase_33 AC 14 ms
4,376 KB
testcase_34 AC 31 ms
4,380 KB
testcase_35 AC 1,508 ms
4,380 KB
testcase_36 AC 1,512 ms
4,376 KB
testcase_37 AC 1,512 ms
4,376 KB
testcase_38 AC 1,508 ms
4,376 KB
testcase_39 AC 1,503 ms
4,376 KB
testcase_40 AC 1,510 ms
4,376 KB
testcase_41 AC 1,504 ms
4,380 KB
testcase_42 AC 1,505 ms
4,380 KB
testcase_43 AC 1,503 ms
4,376 KB
testcase_44 AC 1,510 ms
4,380 KB
testcase_45 AC 1,510 ms
4,380 KB
testcase_46 AC 1,500 ms
4,376 KB
testcase_47 AC 1,497 ms
4,380 KB
testcase_48 AC 1,500 ms
4,376 KB
testcase_49 AC 1,520 ms
4,376 KB
testcase_50 AC 1,495 ms
4,384 KB
testcase_51 AC 1,502 ms
4,384 KB
testcase_52 AC 1,118 ms
4,380 KB
testcase_53 AC 1,510 ms
4,376 KB
testcase_54 AC 1,497 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N,K; cin >> N >> K;
    vector<int> p(N),d(N),x(N),y(N);
    for(int i = 0; i < N; ++i) cin >> p[i] >> d[i];
    vector<int> idx(N);
    iota(ALL(idx),0);
    sort(ALL(idx),[&](int l,int r){return p[l]>p[r];});
    for(int i = 0; i < N; ++i) x[i] = p[idx[i]];
    for(int i = 0; i < N; ++i) y[i] = d[idx[i]];
    auto dp = multivector(K+1,2,-LOWINF);
    dp[0][0] = 0;
    for(int i = 0; i < N; ++i){
        auto tmp = multivector(K+1,2,-LOWINF);
        for(int j = 0; j <= K; ++j){
            if(j+x[i]<=K) chmax(tmp[j+x[i]][1],dp[j][0]+y[i]);
            chmax(tmp[j][0],dp[j][1]+y[i]);
            chmax(tmp[j][0],dp[j][0]);
            chmax(tmp[j][1],dp[j][1]);
        }
        dp = tmp;
    }
    ll ans = 0;
    for(int j = 0; j <= K; ++j) {
        chmax(ans,dp[j][0]);
        chmax(ans,dp[j][1]);
    }
    cout << ans << endl;
}
0