結果

問題 No.2390 Udon Coupon (Hard)
ユーザー dyktr_06dyktr_06
提出日時 2023-07-21 22:55:39
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 45 ms / 2,000 ms
コード長 6,806 bytes
コンパイル時間 4,987 ms
コンパイル使用メモリ 262,436 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-04-15 21:03:43
合計ジャッジ時間 7,433 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
5,248 KB
testcase_01 AC 45 ms
5,248 KB
testcase_02 AC 45 ms
5,376 KB
testcase_03 AC 45 ms
5,376 KB
testcase_04 AC 44 ms
5,376 KB
testcase_05 AC 11 ms
5,376 KB
testcase_06 AC 45 ms
5,376 KB
testcase_07 AC 5 ms
5,376 KB
testcase_08 AC 5 ms
5,376 KB
testcase_09 AC 44 ms
5,376 KB
testcase_10 AC 19 ms
5,376 KB
testcase_11 AC 6 ms
5,376 KB
testcase_12 AC 7 ms
5,376 KB
testcase_13 AC 6 ms
5,376 KB
testcase_14 AC 12 ms
5,376 KB
testcase_15 AC 8 ms
5,376 KB
testcase_16 AC 23 ms
5,376 KB
testcase_17 AC 5 ms
5,376 KB
testcase_18 AC 7 ms
5,376 KB
testcase_19 AC 7 ms
5,376 KB
testcase_20 AC 5 ms
5,376 KB
testcase_21 AC 5 ms
5,376 KB
testcase_22 AC 44 ms
5,376 KB
testcase_23 AC 44 ms
5,376 KB
testcase_24 AC 43 ms
5,376 KB
testcase_25 AC 44 ms
5,376 KB
testcase_26 AC 45 ms
5,376 KB
testcase_27 AC 45 ms
5,376 KB
testcase_28 AC 45 ms
5,376 KB
testcase_29 AC 45 ms
5,376 KB
testcase_30 AC 45 ms
5,376 KB
testcase_31 AC 43 ms
5,376 KB
testcase_32 AC 44 ms
5,376 KB
testcase_33 AC 45 ms
5,376 KB
testcase_34 AC 45 ms
5,376 KB
testcase_35 AC 45 ms
5,376 KB
testcase_36 AC 45 ms
5,376 KB
testcase_37 AC 45 ms
5,376 KB
testcase_38 AC 44 ms
5,376 KB
testcase_39 AC 44 ms
5,376 KB
testcase_40 AC 44 ms
5,376 KB
testcase_41 AC 45 ms
5,376 KB
testcase_42 AC 45 ms
5,376 KB
testcase_43 AC 44 ms
5,376 KB
testcase_44 AC 44 ms
5,376 KB
testcase_45 AC 45 ms
5,376 KB
testcase_46 AC 45 ms
5,376 KB
testcase_47 AC 45 ms
5,376 KB
testcase_48 AC 45 ms
5,376 KB
testcase_49 AC 5 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

struct fraction{
    long long p, q; // long long or __int128_t
    fraction(long long P = 0, long long Q = 1): p(P), q(Q){
        normalize();
    }
    void normalize(){
        long long g = __gcd(p, q);
        p /= g, q /= g;
        if(q < 0) p *= -1, q *= -1;
    }
    inline bool operator==(const fraction &other) const {
        return p * other.q == other.p * q;
    }
    inline bool operator!=(const fraction &other) const {
        return p * other.q != other.p * q;
    }
    inline bool operator<(const fraction &other) const {
        return p * other.q < other.p * q;
    }
    inline bool operator<=(const fraction &other) const {
        return p * other.q <= other.p * q;
    }
    inline bool operator>(const fraction &other) const {
        return p * other.q > other.p * q;
    }
    inline bool operator>=(const fraction &other) const {
        return p * other.q >= other.p * q;
    }
    inline fraction operator+(const fraction &other) const { return fraction(p * other.q + q * other.p, q * other.q); }
    inline fraction operator-(const fraction &other) const { return fraction(p * other.q - q * other.p, q * other.q); }
    inline fraction operator*(const fraction &other) const { return fraction(p * other.p, q * other.q); }
    inline fraction operator/(const fraction &other) const { return fraction(p * other.q, q * other.p); }
    inline fraction& operator+=(const fraction& rhs) noexcept {
        *this = *this + rhs;
        return *this;
    }
    inline fraction& operator-=(const fraction& rhs) noexcept {
        *this = *this - rhs;
        return *this;
    }
    inline fraction& operator*=(const fraction& rhs) noexcept {
        *this = *this * rhs;
        return *this;
    }
    inline fraction& operator/=(const fraction& rhs) noexcept {
        *this = *this / rhs;
        return *this;
    }
    friend inline istream& operator>>(istream& is, fraction& x) noexcept {
        is >> x.p;
        x.q = 1;
        return is;
    }
    friend inline ostream& operator<<(ostream& os, const fraction& x) noexcept { return os << x.p << "/" << x.q; }
};

ll n;
vll a, b;

void input(){
    in(n);
    a.resize(3), b.resize(3);
    rep(i, 3) in(a[i], b[i]);
}

void solve(){
    vector<tuple<fraction, ll, ll>> c(3);
    rep(i, 3){
        c[i] = {fraction(b[i], a[i]), a[i], b[i]};
    }
    Sort(c);
    ll ans = 0;
    auto [f1, a1, b1] = c[0];
    auto [f2, a2, b2] = c[1];
    auto [f3, a3, b3] = c[2];
    rep(i, 2000){
        rep(j, 2000){
            ll cost = a1 * i + a2 * j;
            if(cost > n) continue;
            ll k = (n - cost) / a3;
            chmax(ans, b1 * i + b2 * j + b3 * k);
        }
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0