結果

問題 No.2390 Udon Coupon (Hard)
ユーザー umimel
提出日時 2023-07-22 01:55:22
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 373 ms / 2,000 ms
コード長 2,460 bytes
コンパイル時間 1,841 ms
コンパイル使用メモリ 170,388 KB
実行使用メモリ 65,920 KB
最終ジャッジ日時 2024-10-06 02:00:05
合計ジャッジ時間 8,043 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 47
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = (1 << 30) - 1;
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll N; cin >> N;
    vector<ll> A(3), B(3);
    rep(i, 3) cin >> A[i] >> B[i];
    ll L = A[0];
    L = L/__gcd(L, A[1])*A[1];
    L = L/__gcd(L, A[2])*A[2];
    ll Lcost = max((L/A[0])*B[0], max((L/A[1])*B[1], (L/A[2])*B[2]));
    ll SL = A[0];
    SL = SL/__gcd(SL, A[1])*A[1];
    ll SLcost = max((SL/A[0])*B[0], (SL/A[1])*B[1]);
    vector<ll> dp(8e6+1, 0);
    for(ll i=1; i<=8e6; i++){
        dp[i] = dp[i-1];
        if(i-A[0]>=0){
            dp[i] = max(dp[i], dp[i-A[0]]+B[0]);
        }
        if(i-A[1]>=0){
            dp[i] = max(dp[i], dp[i-A[1]]+B[1]);
        }
    }
    ll ans = 0;
    for(ll k=0; k<L/A[2]; k++){
        ll SN = N;
        ll Lcnt = SN/L;
        SN -= L*Lcnt;
        ll sans = Lcnt*Lcost;
        SN -= k*A[2];
        sans += k*B[2];
        if(SN<0) continue;
        ll SLcnt = SN/SL;
        if(SLcnt>0) SLcnt--;
        sans += SLcnt*SLcost;
        SN -= SL*SLcnt;
        if(SN<0) continue;
        ans = max(ans, sans+dp[SN]);
    }
    for(ll k=0; k<L/A[2]; k++){
        ll SN = N;
        ll Lcnt = SN/L;
        Lcnt = max(0LL, Lcnt-1);
        SN -= L*Lcnt;
        ll sans = Lcnt*Lcost;
        SN -= k*A[2];
        sans += k*B[2];
        if(SN<0) continue;
        ll SLcnt = SN/SL;
        if(SLcnt>0) SLcnt--;
        sans += SLcnt*SLcost;
        SN -= SL*SLcnt;
        if(SN<0) continue;
        ans = max(ans, sans+dp[SN]);
    }
    for(ll k=0; k<L/A[2]; k++){
        ll SN = N;
        ll Lcnt = SN/L;
        Lcnt = max(0LL, Lcnt-2);
        SN -= L*Lcnt;
        ll sans = Lcnt*Lcost;
        SN -= k*A[2];
        sans += k*B[2];
        if(SN<0) continue;
        ll SLcnt = SN/SL;
        if(SLcnt>0) SLcnt--;
        sans += SLcnt*SLcost;
        SN -= SL*SLcnt;
        if(SN<0) continue;
        ans = max(ans, sans+dp[SN]);
    }
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0