結果
問題 | No.2390 Udon Coupon (Hard) |
ユーザー |
👑 ![]() |
提出日時 | 2023-07-21 23:04:44 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 5,099 bytes |
コンパイル時間 | 18,932 ms |
コンパイル使用メモリ | 260,532 KB |
最終ジャッジ日時 | 2025-02-15 17:27:36 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 47 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll my_pow(ll x, ll n, ll mod) {// 繰り返し二乗法.x^nをmodで割った余り.ll ret;if (n == 0) {ret = 1;} else if (n % 2 == 1) {ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;} else {ret = my_pow((x * x) % mod, n / 2, mod);}return ret;}ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }ll INF = 1000000002;int main() {ll N;cin >> N;ll A1, B1;cin >> A1 >> B1;ll A2, B2;cin >> A2 >> B2;ll A3, B3;cin >> A3 >> B3;ll ans = 0;// 各うどん札の使い方は何回までか?ll ca1 = INF;ll ca2 = INF;ll ca3 = INF;// 1 と 2 の比較if (B1 * A2 < B2 * A1) {ca1 = min(ca1, A2);} else if (B1 * A2 > B2 * A1) {ca2 = min(ca2, A1);} else {if (A1 < A2) {ca2 = 0;} else {ca1 = 0;}}if (B1 * A3 < B3 * A1) {ca1 = min(ca1, A3);} else if (B1 * A3 > B3 * A1) {ca3 = min(ca3, A1);} else {if (A1 < A3) {ca3 = 0;} else {ca1 = 0;}}if (B2 * A3 < B3 * A2) {ca2 = min(ca2, A3);} else if (B2 * A3 > B3 * A2) {ca3 = min(ca3, A2);} else {if (A2 < A3) {ca3 = 0;} else {ca2 = 0;}}// debug_out(ca1, ca2, ca3);if (ca1 != INF && ca2 != INF) {for (ll i = 0; i <= ca1; i++) {for (ll j = 0; j <= ca2; j++) {if (i * A1 + j * A2 > N) {continue;}ans = max(ans,i * B1 + j * B2 + ((N - i * A1 - j * A2) / A3) * B3);}}} else if (ca2 != INF && ca3 != INF) {for (ll i = 0; i <= ca2; i++) {for (ll j = 0; j <= ca3; j++) {if (i * A2 + j * A3 > N) {continue;}ans = max(ans,i * B2 + j * B3 + ((N - i * A2 - j * A3) / A1) * B1);}}} else if (ca3 != INF && ca1 != INF) {for (ll i = 0; i <= ca1; i++) {for (ll j = 0; j <= ca3; j++) {if (i * A1 + j * A3 > N) {continue;}ans = max(ans,i * B1 + j * B3 + ((N - i * A1 - j * A3) / A2) * B2);}}}cout << ans << endl;}