結果

問題 No.2317 Expression Menu
コンテスト
ユーザー Forested
提出日時 2023-05-26 21:28:52
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 166 ms / 2,000 ms
コード長 4,179 bytes
コンパイル時間 1,480 ms
コンパイル使用メモリ 133,384 KB
最終ジャッジ日時 2025-02-13 05:49:53
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

template <typename T>
Vec<tuple<i32, i32, T>> runlength(const Vec<T> &a) {
    if (a.empty()) {
        return Vec<tuple<i32, i32, T>>();
    }
    Vec<tuple<i32, i32, T>> ret;
    i32 prv = 0;
    REP(i, 1, a.size()) {
        if (a[i - 1] != a[i]) {
            ret.emplace_back(prv, i, a[i - 1]);
            prv = i;
        }
    }
    ret.emplace_back(prv, (i32)a.size(), a.back());
    return ret;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

// ============
#include <queue>
#include <utility>
#include <vector>

class ConnectedComponents {
    std::vector<int> number;
    int comp;

public:
    template <typename G>
    ConnectedComponents(const G &graph) :
        number((int) graph.size(), -1), comp(0) {
        std::queue<int> que;
        for (int i = 0; i < (int) graph.size(); ++i) {
            if (number[i] != -1) {
                continue;
            }
            que.push(i);
            number[i] = comp;
            while (!que.empty()) {
                int v = que.front();
                que.pop();
                for (const auto &e : graph[v]) {
                    if (number[(int) e] == -1) {
                        number[(int) e] = number[v];
                        que.push((int)e);
                    }
                }
            }
            ++comp;
        }
    }

    int operator[](int v) const {
        assert(v >= 0 && v < (int) number.size());
        return number[v];
    }

    std::vector<std::vector<int>> groups() const {
        std::vector<std::vector<int>> ret(comp);
        for (int i = 0; i < (int) number.size(); ++i)
            ret[number[i]].push_back(i);
        return ret;
    }

    int components() const {
        return comp;
    }
};
// ============

int main() {
    i32 n, x, y;
    cin >> n >> x >> y;
    Vec<Vec<i64>> dp(x + 1, Vec<i64>(y + 1, -INF64));
    dp[0][0] = 0;
    REP(i, n) {
        i32 a, b;
        i64 c;
        cin >> a >> b >> c;
        Vec<Vec<i64>> ndp = dp;
        REP(i, x - a + 1) REP(j, y - b + 1) {
            chmax(ndp[i + a][j + b], dp[i][j] + c);
        }
        dp = ndp;
    }
    i64 ans = 0;
    REP(i, x + 1) {
        chmax(ans, *max_element(ALL(dp[i])));
    }
    cout << ans << '\n';
}
0