結果
| 問題 | No.2741 Balanced Choice |
| ユーザー |
 みしあ
|
| 提出日時 | 2024-04-23 02:24:43 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,663 ms / 2,000 ms |
| コード長 | 9,084 bytes |
| コンパイル時間 | 7,051 ms |
| コンパイル使用メモリ | 328,040 KB |
| 実行使用メモリ | 221,696 KB |
| 最終ジャッジ日時 | 2024-10-15 01:46:39 |
| 合計ジャッジ時間 | 17,943 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 10 |
ソースコード
#pragma region Macros#if defined(ONLINE_JUDGE)#include <atcoder/all>#endif#if defined(LOCAL) || defined(_DEBUG)#include "template.hpp"#else#include <bits/stdc++.h>#include <boost/format.hpp>using namespace std;#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#define O(...)#define OP(...)#define START()#define STOP()#define MEMORY()#define massert(x, msec) if(!(x)) {\while(msec > chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now() - _MY_START_TIME).count()); \cerr << "assert [" << __FUNCTION__ << ":" << to_string(__LINE__) << "] : " << string(#x) << el; exit(1);\}/******************************************* マクロ等 **************************************************/#define REP(i, n) for(ll i=0, i##_len=(n); i<i##_len; ++i)#define REPR(i, n) for(ll i=(n); i>=0; --i)#define FOR(i, n, m) for(ll i=(m), i##_len=(n); i<i##_len; ++i)#define EACH(i, v) for(auto&& i : v)#define ALL(x) (x).begin(),(x).end()#define ALLR(x) (x).rbegin(),(x).rend()#define FILL(v, h) memset((v), h, sizeof(v))#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())vector<long long> __FREP_CNT_ARRAY;#define FREP(i, n) ;__FREP_CNT_ARRAY.push_back(n); REP(i, n) {#define FREPR(i, n) ;__FREP_CNT_ARRAY.push_back((n)+1); REPR(i, n) {#define FFOR(i, n, m) ;__FREP_CNT_ARRAY.push_back((n)-(m)); FOR(i, n, m) {#define FEACH(a, as) ;__FREP_CNT_ARRAY.push_back((as).size()); EACH(a, as) {#define THEN __FREP_CNT_ARRAY.back()--;} if(bool frep_tmp = !__FREP_CNT_ARRAY.back(); __FREP_CNT_ARRAY.pop_back(), frep_tmp)#define DPINIT(name) name; bool __SEEN_##name;#define DP(name) name;if(__SEEN_##name)return name;__SEEN_##name=true;template<class T, class U>bool chmax(T &a, const U &b) { if (a<(T)b) { a=(T)b; return 1; } return 0; }template<class T, class U>bool chmin(T &a, const U &b) { if (b<(T)a) { a=(T)b; return 1; } return 0; }#define cmp3(a, x, b) ((a) <= (x) && (x) < (b))#define vec vector#define umap unordered_map#define uset unordered_setusing ll = long long;using ull = unsigned long long;using ld = long double;using P = pair<ll, ll>;using Tup = tuple<ll, ll, ll>;using vl = vec<ll>;using vvl = vec<vl>;#define fi first#define se second#define pb push_back#define el '\n'constexpr ll INF = numeric_limits<ll>::max()/4-1;/******************************************* 入力 **************************************************/template<class T> istream &operator>>(istream &stream, vec<T>& o){REP(i, o.size())stream >> o[i];return stream;}template<class T, class U> istream &operator>>(istream &stream, pair<T, U>& o){cin >> o.fi >> o.se; return stream;}namespace myinput {void input() {}template<class T, class... Ts> void input(T&& o, Ts&&... args){cin >> o;input(forward<Ts>(args)...);}void assign_vl(size_t) {};template<class T, class... Ts> void assign_vl(size_t siz, T&& o, Ts&&... args){o.resize(siz);assign_vl(siz, forward<Ts>(args)...);}void input_horizon_sub(size_t) {};template<class T, class... Ts> void input_horizon_sub(size_t index, T&& o, Ts&&... args) {cin>>o[index];input_horizon_sub(index, forward<Ts>(args)...);}template<class... Ts> void input_horizon(size_t siz, Ts&&... args){REP(i, siz) input_horizon_sub(i, forward<Ts>(args)...);}}#define _I(T, ...) ;myinput::input(__VA_ARGS__);#define I(T, ...) ;T __VA_ARGS__;_I(T, __VA_ARGS__);#define _Iv(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input(__VA_ARGS__);#define Iv(T, siz, ...) ;vec<T> __VA_ARGS__;_Iv(T, siz, __VA_ARGS__);#define _Ih(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input_horizon(siz, __VA_ARGS__);#define Ih(T, siz, ...) ;vec<T> __VA_ARGS__;_Ih(T, siz, __VA_ARGS__);chrono::system_clock::time_point _MY_START_TIME;/******************************************* 出力 **************************************************/namespace __PrintHelper {template <char Separator = ' ', typename T>void printValue(std::ostream& os, const T& value) { os << value; }template <char Separator = ' ', typename T1, typename T2>void printValue(std::ostream& os, const std::pair<T1, T2>& value) { os << value.first << Separator << value.second; }template <char Separator = ' ', typename... Args, std::size_t... Is>void printTuple(std::ostream& os, const std::tuple<Args...>& value, std::index_sequence<Is...>) { ((os << (Is == 0 ? "" : string(1, Separator))<< std::get<Is>(value)), ...); }template <char Separator = ' ', typename... Args>void printValue(std::ostream& os, const std::tuple<Args...>& value) { printTuple<Separator>(os, value, std::index_sequence_for<Args...>{}); }template <char Separator = ' ', typename T>void printValue(std::ostream& os, const std::vector<T>& value) { for (std::size_t i = 0; i < value.size(); ++i) os << (i == 0 ? "" : string(1,Separator)) << value[i]; }};template <char Separator = ' ', typename Arg, typename... Args>void OO(const Arg &x, const Args&... args) {__PrintHelper::printValue<Separator>(cout, x);if constexpr (sizeof...(args) > 0) {cout << Separator;OO<Separator>(args...);}else { cout << el; }}#define YN_1(b) {cout << ((b) ? "Yes" : "No") << el;}#define YN_3(b, y, n) {if(b) cout << (y) << el; else cout << (n) << el;}#define GET_MACRO(_1,_2,_3,NAME,...) NAME#define YN(...) GET_MACRO(__VA_ARGS__, YN_3, _, YN_1)(__VA_ARGS__)#define YNc(d, i, n) YN((d).contains(i), d.at(i), n);/******************************************* 配列操作 **************************************************/namespace __ArrayHelper {template <typename... Args>auto flatten(const std::tuple<Args...>& t);template <typename T, std::size_t... Indices>auto flattenHelper(const T& t, std::index_sequence<Indices...>) { return std::make_tuple(std::get<Indices>(t)...); }template <typename T, typename U>auto flatten(const std::pair<T, U>& p) { return flatten(std::make_tuple(p.first, p.second)); }template <typename T>auto flatten(const T& value) { return std::make_tuple(value); }template <typename... Args, std::size_t... Indices>auto flattenTupleHelper(const std::tuple<Args...>& t, std::index_sequence<Indices...>) { return std::tuple_cat(flatten(std::get<Indices>(t))...);}template <typename... Args>auto flatten(const std::tuple<Args...>& t) { return flattenTupleHelper(t, std::index_sequence_for<Args...>{}); }template <typename Container>auto __flatten(const Container& container) {using ValueType = typename Container::value_type;using ResultType = decltype(__ArrayHelper::flatten(std::declval<ValueType>()));std::vector<ResultType> result;for (const auto& item : container) { result.emplace_back(__ArrayHelper::flatten(item)); }return result;}template <class T>auto __enumrate(const vec<T> &v) {vec<pair<ll, T>> ret(v.size());REP(i, v.size()) ret[i] = {i, v[i]};return ret;}}constexpr auto flatten = [](auto&& x) { return __ArrayHelper::__flatten(x); };constexpr auto enumrate = [](auto&& x) { return __ArrayHelper::__enumrate(x); };template <typename... Args>auto zip(const Args&... args) {size_t minSize = std::min({args.size()...});std::vector<std::tuple<typename Args::value_type...>> result;for (size_t i = 0; i < minSize; ++i) { result.emplace_back(std::make_tuple(args[i]...)); }return result;}template <typename Arg>Arg compose(Arg arg) { return arg; }template <typename Arg, typename Func>auto compose(Arg arg, Func func) { return func(arg); }template <typename Arg, typename Func, typename... Funcs>auto compose(Arg arg, Func func, Funcs... funcs) { return compose(compose(arg, func), funcs...); }/******************************************* Main **************************************************/#endif#pragma endregionusing Point = complex<ll>;void Main();int main(){_MY_START_TIME = std::chrono::system_clock::now();std::cin.tie(nullptr);std::cout << std::fixed << std::setprecision(15);std::cerr << std::fixed << std::setprecision(15);Main();MEMORY();return 0;}ll DPINIT(dp[5050][5050][2]);ll rec(vl &ws, vl &vs, ll i, ll w, ll t) {if(w < 0) {return -INF;}if(ws.size() == i) return w == 0 ? 0 : -INF;auto &res = DP(dp[i][w][t]);// 使わないres = rec(ws, vs, i + 1, w, t);// 使うchmax(res, rec(ws, vs, i + 1, w - ws[i], t) + vs[i]);return res;}void Main() {I(ll, n, w, d);Ih(ll, n, ts, ws, vs);vvl wss(2), vss(2);REP(i, n) {wss[ts[i]].pb(ws[i]);vss[ts[i]].pb(vs[i]);}ll ans = 0;REP(i, w + 1) {REP(j, w + 1) {if(abs(i - j) > d) continue;if(i + j > w) break;auto r = rec(wss[0], vss[0], 0, i, 0);auto v = rec(wss[1], vss[1], 0, j, 1);if(chmax(ans, r + v)) {// O(i, j, r, v);}}}OO(ans);}