結果
問題 | No.2701 A cans -> B cans |
ユーザー |
|
提出日時 | 2024-03-29 22:25:27 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,947 bytes |
コンパイル時間 | 5,308 ms |
コンパイル使用メモリ | 312,112 KB |
実行使用メモリ | 296,788 KB |
最終ジャッジ日時 | 2024-09-30 16:15:49 |
合計ジャッジ時間 | 22,978 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 3 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 3 ms
5,248 KB |
testcase_11 | AC | 3 ms
5,248 KB |
testcase_12 | AC | 3 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 3 ms
5,248 KB |
testcase_15 | AC | 3 ms
5,248 KB |
testcase_16 | AC | 3 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 3 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 3 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 3 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 355 ms
43,520 KB |
testcase_27 | AC | 339 ms
43,648 KB |
testcase_28 | AC | 352 ms
43,776 KB |
testcase_29 | AC | 350 ms
142,464 KB |
testcase_30 | AC | 350 ms
256,336 KB |
testcase_31 | AC | 355 ms
257,620 KB |
testcase_32 | AC | 330 ms
265,316 KB |
testcase_33 | AC | 349 ms
140,288 KB |
testcase_34 | AC | 363 ms
252,652 KB |
testcase_35 | AC | 345 ms
139,904 KB |
testcase_36 | AC | 344 ms
262,908 KB |
testcase_37 | AC | 365 ms
141,312 KB |
testcase_38 | AC | 347 ms
138,880 KB |
testcase_39 | AC | 334 ms
141,312 KB |
testcase_40 | AC | 348 ms
141,056 KB |
testcase_41 | AC | 341 ms
260,872 KB |
testcase_42 | AC | 340 ms
258,804 KB |
testcase_43 | AC | 353 ms
253,980 KB |
testcase_44 | AC | 342 ms
138,496 KB |
testcase_45 | AC | 344 ms
256,092 KB |
testcase_46 | AC | 335 ms
140,800 KB |
testcase_47 | AC | 352 ms
254,504 KB |
testcase_48 | AC | 348 ms
139,904 KB |
testcase_49 | AC | 329 ms
263,916 KB |
testcase_50 | AC | 338 ms
261,936 KB |
testcase_51 | AC | 352 ms
255,972 KB |
testcase_52 | AC | 325 ms
267,720 KB |
testcase_53 | AC | 366 ms
138,624 KB |
testcase_54 | AC | 358 ms
252,096 KB |
testcase_55 | AC | 347 ms
257,848 KB |
testcase_56 | AC | 358 ms
141,440 KB |
testcase_57 | AC | 355 ms
255,064 KB |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | AC | 386 ms
296,632 KB |
testcase_70 | AC | 391 ms
296,584 KB |
testcase_71 | AC | 392 ms
296,624 KB |
testcase_72 | AC | 404 ms
296,636 KB |
testcase_73 | AC | 395 ms
296,616 KB |
testcase_74 | AC | 426 ms
296,588 KB |
testcase_75 | AC | 392 ms
296,592 KB |
testcase_76 | AC | 388 ms
296,500 KB |
testcase_77 | AC | 392 ms
296,788 KB |
testcase_78 | AC | 393 ms
296,492 KB |
ソースコード
#ifdef ONLINE_JUDGE #include <bits/stdc++.h> #include <atcoder/all> #else #include <mylibs/all.h> #endif using ll = long long; using lll = __int128_t; #define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i) #define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i) #define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i) #define rreps(i, n) for (int i = ((int)(n)); i > 0; --i) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++) #define length(v) ((int)(v).size()) constexpr int inf = 2'000'000'000; constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353; #define all(v) begin(v), end(v) #define rall(v) rbegin(v), rend(v) using namespace std; using namespace atcoder; // clang-format off #define Vec(type, ...) __make_vec<type>(__VA_ARGS__) template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts> auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));} #define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__) template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);} template <class T, T init, class... Ts> auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));} template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;} inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); } template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); } template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {}; template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>; template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value; template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>; template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>; template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;} template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;} template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;} template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;} void inp() {} template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);} template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];} template <typename T>void oup(const T& a) {cout << a << "\n";} template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);} inline string YESNO(bool cond) { return cond ? "YES" : "NO"; }inline string yesno(bool cond) { return cond ? "yes" : "no"; }inline string YesNo(bool cond) { return cond ? "Yes" : "No"; } inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;} #ifdef ONLINE_JUDGE #define debug(...) #else #define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__) template <typename T>void debug_out(T t) {cerr << t << "\n";} template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);} #endif #ifdef ONLINE_JUDGE #define todo(...) static_assert(false) #else #define todo(...) #endif // clang-format on ll sum[5001][5001]; int last[5001][5001]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; inp(n, m); using T = tuple<int, int, int>; vector<T> v(n + 1); reps(i, n) { int a, b, c; inp(a, b, c); v[i] = {a, b, c}; } reps(i, n) { auto [a, b, c] = v[i]; ll prv = 0; reps(j, m) { if (j >= a) { ll x = j / a * b; assert(j % a + x <= j); sum[i][j] = sum[i][j % a + x] + c * x; if (sum[i][j] > prv) { last[i][j] = j; } else if (j - 1 >= 0) { last[i][j] = last[i][j - 1]; } prv = sum[i][j]; } } } vector<ll> dp(m + 1); reps(i, m) { ll ans = 0; reps(j, n) { int a = i - last[j][i]; ans = max(ans, sum[j][i] + dp[a]); } dp[i] = ans; oup(ans); } return 0; }