結果
問題 | No.2701 A cans -> B cans |
ユーザー | binap |
提出日時 | 2024-03-29 22:15:39 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 387 ms / 1,000 ms |
コード長 | 1,876 bytes |
コンパイル時間 | 3,979 ms |
コンパイル使用メモリ | 258,356 KB |
実行使用メモリ | 394,496 KB |
最終ジャッジ日時 | 2024-04-19 10:47:21 |
合計ジャッジ時間 | 21,783 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 11 ms
5,376 KB |
testcase_07 | AC | 11 ms
5,376 KB |
testcase_08 | AC | 11 ms
5,376 KB |
testcase_09 | AC | 12 ms
5,376 KB |
testcase_10 | AC | 12 ms
5,376 KB |
testcase_11 | AC | 12 ms
5,376 KB |
testcase_12 | AC | 12 ms
5,376 KB |
testcase_13 | AC | 12 ms
5,376 KB |
testcase_14 | AC | 12 ms
5,376 KB |
testcase_15 | AC | 12 ms
5,376 KB |
testcase_16 | AC | 11 ms
5,376 KB |
testcase_17 | AC | 11 ms
5,376 KB |
testcase_18 | AC | 12 ms
5,376 KB |
testcase_19 | AC | 12 ms
5,376 KB |
testcase_20 | AC | 11 ms
5,376 KB |
testcase_21 | AC | 11 ms
5,376 KB |
testcase_22 | AC | 11 ms
5,376 KB |
testcase_23 | AC | 11 ms
5,376 KB |
testcase_24 | AC | 11 ms
5,376 KB |
testcase_25 | AC | 12 ms
5,376 KB |
testcase_26 | AC | 350 ms
394,496 KB |
testcase_27 | AC | 346 ms
394,368 KB |
testcase_28 | AC | 347 ms
394,368 KB |
testcase_29 | AC | 339 ms
394,240 KB |
testcase_30 | AC | 346 ms
394,496 KB |
testcase_31 | AC | 347 ms
394,240 KB |
testcase_32 | AC | 343 ms
394,496 KB |
testcase_33 | AC | 342 ms
394,496 KB |
testcase_34 | AC | 344 ms
394,496 KB |
testcase_35 | AC | 344 ms
394,240 KB |
testcase_36 | AC | 337 ms
394,240 KB |
testcase_37 | AC | 344 ms
394,496 KB |
testcase_38 | AC | 349 ms
394,368 KB |
testcase_39 | AC | 340 ms
394,368 KB |
testcase_40 | AC | 340 ms
394,496 KB |
testcase_41 | AC | 351 ms
394,368 KB |
testcase_42 | AC | 344 ms
394,240 KB |
testcase_43 | AC | 349 ms
394,368 KB |
testcase_44 | AC | 349 ms
394,368 KB |
testcase_45 | AC | 337 ms
394,368 KB |
testcase_46 | AC | 338 ms
394,368 KB |
testcase_47 | AC | 338 ms
394,240 KB |
testcase_48 | AC | 337 ms
394,368 KB |
testcase_49 | AC | 340 ms
394,368 KB |
testcase_50 | AC | 341 ms
394,368 KB |
testcase_51 | AC | 344 ms
394,496 KB |
testcase_52 | AC | 338 ms
394,368 KB |
testcase_53 | AC | 343 ms
394,368 KB |
testcase_54 | AC | 336 ms
394,240 KB |
testcase_55 | AC | 340 ms
394,240 KB |
testcase_56 | AC | 340 ms
394,368 KB |
testcase_57 | AC | 344 ms
394,240 KB |
testcase_58 | AC | 345 ms
394,368 KB |
testcase_59 | AC | 13 ms
5,888 KB |
testcase_60 | AC | 13 ms
5,376 KB |
testcase_61 | AC | 14 ms
5,760 KB |
testcase_62 | AC | 13 ms
5,888 KB |
testcase_63 | AC | 12 ms
5,376 KB |
testcase_64 | AC | 13 ms
5,376 KB |
testcase_65 | AC | 13 ms
5,376 KB |
testcase_66 | AC | 13 ms
5,376 KB |
testcase_67 | AC | 13 ms
5,376 KB |
testcase_68 | AC | 13 ms
5,760 KB |
testcase_69 | AC | 387 ms
394,496 KB |
testcase_70 | AC | 378 ms
394,368 KB |
testcase_71 | AC | 382 ms
394,240 KB |
testcase_72 | AC | 378 ms
394,368 KB |
testcase_73 | AC | 374 ms
394,368 KB |
testcase_74 | AC | 375 ms
394,240 KB |
testcase_75 | AC | 372 ms
394,368 KB |
testcase_76 | AC | 383 ms
394,368 KB |
testcase_77 | AC | 378 ms
394,368 KB |
testcase_78 | AC | 375 ms
394,496 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} int main(){ int n, m; cin >> m >> n; vector<int> a(m); vector<int> b(m); vector<long long> c(m); rep(i, m) cin >> a[i] >> b[i] >> c[i]; using P = pair<long long, int>; vector<vector<P>> f(n + 1, vector<P>(m)); vector<long long> g(n + 1); for(int i = 1; i <= n; i++){ rep(j, m){ auto [val, rest] = f[i - 1][j]; rest++; if(rest >= a[j]){ val += b[j] * c[j]; rest = b[j]; } f[i][j] = {val, rest}; chmax(g[i], val); } for(int i2 = 0; i2 < i; i2++){ chmax(g[i], g[i2] + g[i - i2]); } cout << g[i] << "\n"; } // cout << f; return 0; }