結果

問題 No.2317 Expression Menu
ユーザー moharan627moharan627
提出日時 2023-05-26 21:57:23
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 273 ms / 2,000 ms
コード長 5,582 bytes
コンパイル時間 4,811 ms
コンパイル使用メモリ 313,804 KB
実行使用メモリ 233,728 KB
最終ジャッジ日時 2024-06-07 06:44:53
合計ジャッジ時間 14,267 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 19 ms
20,096 KB
testcase_03 AC 264 ms
233,600 KB
testcase_04 AC 266 ms
233,728 KB
testcase_05 AC 268 ms
233,600 KB
testcase_06 AC 263 ms
233,600 KB
testcase_07 AC 271 ms
233,600 KB
testcase_08 AC 263 ms
233,728 KB
testcase_09 AC 262 ms
233,600 KB
testcase_10 AC 267 ms
233,600 KB
testcase_11 AC 261 ms
233,728 KB
testcase_12 AC 262 ms
233,728 KB
testcase_13 AC 264 ms
233,728 KB
testcase_14 AC 273 ms
233,728 KB
testcase_15 AC 262 ms
233,600 KB
testcase_16 AC 265 ms
233,728 KB
testcase_17 AC 267 ms
233,728 KB
testcase_18 AC 260 ms
233,728 KB
testcase_19 AC 268 ms
233,728 KB
testcase_20 AC 266 ms
233,728 KB
testcase_21 AC 262 ms
233,728 KB
testcase_22 AC 264 ms
233,728 KB
testcase_23 AC 251 ms
233,728 KB
testcase_24 AC 250 ms
233,600 KB
testcase_25 AC 251 ms
233,728 KB
testcase_26 AC 251 ms
233,728 KB
testcase_27 AC 250 ms
233,728 KB
testcase_28 AC 252 ms
233,600 KB
testcase_29 AC 256 ms
233,728 KB
testcase_30 AC 252 ms
233,728 KB
testcase_31 AC 249 ms
233,728 KB
testcase_32 AC 248 ms
233,728 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 4 ms
5,504 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 238 ms
233,728 KB
testcase_39 AC 236 ms
233,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__
int main()
{
    int N,X,Y;cin >> N >> X >> Y;
    vector DP(N+1,vector(X+10,vl(Y+10,-INF)));
    DP[0][0][0]=0;
    rep(i,N){
        ll A,B,C;cin >> A >> B >> C;
        rep(x,X+1){
            rep(y,Y+1){
                chmax(DP[i+1][x][y],DP[i][x][y]);
                if(0<=DP[i][x][y]){
                    if(x+A<=X && y+B <=Y){
                        chmax(DP[i+1][x+A][y+B],DP[i][x][y]+C);
                    }
                }
            }
        }
    }
    ll Ans = 0;
    rep(x,X+1){
        rep(y,Y+1){
            chmax(Ans,DP[N][x][y]);
        }
    }
    cout << Ans << "\n";
}

#else
//tie(a, b, c) = t
//repをllにしているので時間ギリギリならintに変換
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define rrep(i, n) for(long long int i = n-1; i >= 0; i--)
#define range(i, m, n) for(long long int i = m; i < n; i++)
#define fore(i,a) for(auto &i:a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Sum(v) accumulate(all(v),0LL)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
const ll INF = 1e16;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
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; }
ll SN(char s){return ll(s-'0');}
ll SN(string s){return stoll(s);}
int alpN(char s){return int(s-'a');}
int AlpN(char s){return int(s-'A');}
int Nalp(int n){return char(n+97);}
int NAlp(int n){return char(n+65);}
using mint = modint;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using pll = pair<long long, long long>;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){for(int i=0;i<(int)v.size();i++)o<<(i>0?" ":"")<<v[i];return o;}//vector空白区切り出力
ostream& operator<<(ostream& os, const mint1& N) {return os << N.val();}//mint出力。デフォはmint1
ostream& operator<<(ostream& os, const mint2& N) {return os << N.val();}
template<class T> bool contain(const std::string& s, const T& v) {
    return s.find(v) != std::string::npos;
}
ll max(int x,ll y){return max((ll)x,y);}
ll max(ll x,int y){return max(x,(ll)y);}
ll min(int x,ll y){return min((ll)x,y);}
ll min(ll x,int y){return min(x,(ll)y);}
template <typename T>
struct edge {
    int src, to;
    T cost;
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
    edge& operator=(const int& x) {
        to = x;
        return *this;
    }
    operator int() const { return to; }
};

template <typename T>
using Edges = vector<edge<T> >;
template <typename T>
using WeightedGraph = vector<Edges<T> >;
using UnWeightedGraph = vector<vector<int> >;
template <typename T>
using Matrix = vector<vector<T> >;

//unorderd_mapの拡張…https://qiita.com/hamamu/items/4d081751b69aa3bb3557
template<class T> size_t HashCombine(const size_t seed,const T &v){
    return seed^(std::hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));
}
/* pair用 */
template<class T,class S> struct std::hash<std::pair<T,S>>{
    size_t operator()(const std::pair<T,S> &keyval) const noexcept {
        return HashCombine(std::hash<T>()(keyval.first), keyval.second);
    }
};
/* vector用 */
template<class T> struct std::hash<std::vector<T>>{
    size_t operator()(const std::vector<T> &keyval) const noexcept {
        size_t s=0;
        for (auto&& v: keyval) s=HashCombine(s,v);
        return s;
    }
};
/* tuple用 */
template<int N> struct HashTupleCore{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{
        size_t s=HashTupleCore<N-1>()(keyval);
        return HashCombine(s,std::get<N-1>(keyval));
    }
};
template <> struct HashTupleCore<0>{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }
};
template<class... Args> struct std::hash<std::tuple<Args...>>{
    size_t operator()(const tuple<Args...> &keyval) const noexcept {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};
ll ceil(ll a, ll b){
  return (a + b - 1) / b;
}
struct string_converter {
    char start = 0;
    char type(const char &c) const { return (islower(c) ? 'a' : isupper(c) ? 'A' : isdigit(c) ? '0' : 0); }
    int convert(const char &c) {
        if(!start) start = type(c);
        return c - start;
    }
    int convert(const char &c, const string &chars) { return chars.find(c); }
    template <typename T> auto convert(const T &v) {
        vector<decltype(convert(v[0]))> ret;
        ret.reserve(v.size());
        for(auto &&e : v) ret.emplace_back(convert(e));
        return ret;
    }
    template <typename T> auto convert(const T &v, const string &chars) {
        vector<decltype(convert(v[0], chars))> ret;
        ret.reserve(v.size());
        for(auto &&e : v) ret.emplace_back(convert(e, chars));
        return ret;
    }
    int operator()(const char &v, char s = 0) {
        start = s;
        return convert(v);
    }
    int operator()(const char &v, const string &chars) { return convert(v, chars); }
    template <typename T> auto operator()(const T &v, char s = 0) {
        start = s;
        return convert(v);
    }
    template <typename T> auto operator()(const T &v, const string &chars) { return convert(v, chars); }
} toint;
#endif
0