#872203 (C++14) No.2317 Expression Menu

• 問題: No.2317 Expression Menu
• ユーザー: Kyo_s_s
• 提出日時: 2023-05-26 21:34:15
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 155 ms / 2,000 ms
• コード長: 4,959 bytes
• コンパイル時間: 1,689 ms
• コンパイル使用メモリ: 172,896 KB
• 実行使用メモリ: 5,132 KB
• 最終ジャッジ日時: 2023-08-26 10:34:55
• 合計ジャッジ時間: 7,646 ms
• ジャッジサーバーID （参考情報）: judge15 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 4,828 KB
testcase_01	AC	3 ms; 4,944 KB
testcase_02	AC	10 ms; 4,956 KB
testcase_03	AC	146 ms; 4,832 KB
testcase_04	AC	146 ms; 4,932 KB
testcase_05	AC	150 ms; 4,912 KB
testcase_06	AC	142 ms; 4,880 KB
testcase_07	AC	149 ms; 5,088 KB
testcase_08	AC	143 ms; 4,820 KB
testcase_09	AC	144 ms; 4,948 KB
testcase_10	AC	150 ms; 4,940 KB
testcase_11	AC	149 ms; 5,044 KB
testcase_12	AC	149 ms; 4,952 KB
testcase_13	AC	146 ms; 4,980 KB
testcase_14	AC	155 ms; 4,876 KB
testcase_15	AC	144 ms; 4,952 KB
testcase_16	AC	152 ms; 5,132 KB
testcase_17	AC	155 ms; 4,940 KB
testcase_18	AC	143 ms; 4,940 KB
testcase_19	AC	154 ms; 4,832 KB
testcase_20	AC	149 ms; 4,824 KB
testcase_21	AC	144 ms; 4,892 KB
testcase_22	AC	143 ms; 4,876 KB
testcase_23	AC	128 ms; 4,932 KB
testcase_24	AC	125 ms; 5,004 KB
testcase_25	AC	124 ms; 4,824 KB
testcase_26	AC	122 ms; 4,824 KB
testcase_27	AC	123 ms; 4,952 KB
testcase_28	AC	125 ms; 4,940 KB
testcase_29	AC	126 ms; 4,824 KB
testcase_30	AC	127 ms; 4,952 KB
testcase_31	AC	125 ms; 4,992 KB
testcase_32	AC	125 ms; 4,832 KB
testcase_33	AC	3 ms; 4,832 KB
testcase_34	AC	3 ms; 4,828 KB
testcase_35	AC	3 ms; 4,828 KB
testcase_36	AC	3 ms; 4,824 KB
testcase_37	AC	3 ms; 4,824 KB
testcase_38	AC	107 ms; 4,836 KB
testcase_39	AC	105 ms; 4,824 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;

/* alias */
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<long long>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvd = vector<vector<double>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

/* define */
#define MOD 998244353
// #define MOD 1000000007
#define INF (1LL << 60)
#define elif else if
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(obj) (obj).begin(), (obj).end()
#define YESNO(bool) cout << (bool ? "YES\n" : "NO\n")
#define YesNo(bool) cout << (bool ? "Yes\n" : "No\n")
#define yesno(bool) cout << (bool ? "yes\n" : "no\n")
template<class T> bool chmax(T &a, const T &b) {if(a<b){ a=b; return 1;} return 0;}
template<class T> bool chmin(T &a, const T &b) {if(b<a){ a=b; return 1;} return 0;}
#define debug(x) cerr << #x << ":" << x << "\n";

/* REP macro */
#define reps(i, a, n) for(ll i = (a); i < (n); i++)
#define rep(i, n) reps(i, 0, (n))
#define rrep(i, n) reps(i, 1, (n + 1))
#define repd(i, n) for(ll i = (n - 1); i >= 0; i--)
#define rrepd(i, n) for(ll i = (n); i >= 1; i--)
#define fore(i, a) for(auto &i: a)

/* vector */
template<class T> T vmax(vector<T> &array){ T ret = array[0]; for(T a: array) chmax(ret, a); return ret; }
template<class T> T vmin(vector<T> &array){ T ret = array[0]; for(T a: array) chmin(ret, a); return ret; }
template<class T> T sum(vector<T> &array){ T ret = 0; for(T a:array) ret += a; return ret; }
template<class T> void list_set(vector<T> &array){ sort(all(array)); array.erase(unique(all(array)),array.end()); }
template<class T> int bisect_left(vector<T> &array, T key){ return lower_bound(all(array),key) - array.begin(); }
template<class T> int bisect_right(vector<T> &array, T key){ return upper_bound(all(array),key) - array.begin(); }

/* string */
ll string_to_ll(string n){ ll ret = 0, k = 1; while(n.length() > 0){ ret += k * (n.back() - '0'); n.pop_back(); k *= 10; } return ret; }
string ll_to_string(ll n){ string ret = ""; while(n > 0){ ret.pb((n % 10) + '0'); n /= 10; } reverse(all(ret)); return ret; }

struct popopo{ popopo(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15); }; } popopoppo;

// n = 1,...,N に対して、n % A < B を満たすものの数 
ll Count_of_n_mod_A_less_than_B(ll N, ll A, ll B){ return N / A * min(A, B) + min(N % A, B - 1); }


/* IN/OUT */
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) { for(auto &i : a) scan(i); }

void IN(){}
template<class Head, class... Tail> void IN(Head& head, Tail &...tail){ scan(head); IN(tail...); }

#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); IN(name)
#define VECS(type, name, size) vector<type> name(size + 1); for(int i = 1; i <= size; i++) scan(name[i])

void OUT(){ cout << "\n"; }
template<class T> void output(T a){ cout << a; }
template<class T> void output(vector<T> v){ for(int i = 0; i < v.size(); i++) cout << v[i] << (i == v.size() - 1 ? "" : " "); }
template<class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) { output(head); if(sizeof...(tail)) cout << " "; OUT(tail...); }

void FLASH(){ cout << endl; }
template<class Head, class... Tail> void FLASH(const Head  &head, const Tail &...tail) { output(head); if(sizeof...(tail)) cout << " "; FLASH(tail...); }

int main() {

    LL(N, X, Y);
    vll A(N), B(N), C(N);
    rep(i, N) {
        LL(a, b, c);
        A[i] = a;
        B[i] = b;
        C[i] = c;
    }    


    vvll dp(330, vll(330, -INF));
    dp[0][0] = 0; 

    rep(i, N) {
        vvll pd = dp;
        ll a = A[i], b = B[i], c = C[i];
        rep(x, 330) {
            rep(y, 330) {
                if (dp[x][y] == -INF) continue;
                ll nx = x + a, ny = y + b;
                if (nx >= 330 || ny >= 330) continue;
                chmax(pd[nx][ny], dp[x][y] + c);
            }
        }
        swap(dp, pd);
    }

    ll ans = 0;
    rep(x, 330) {
        rep(y, 330) {
            if (x > X || y > Y) continue;
            chmax(ans, dp[x][y]);
        }
    }


    OUT(ans);


}