#894341 (C++14) No.2390 Udon Coupon (Hard)

提出ソース

結果

問題	No.2390 Udon Coupon (Hard)
ユーザー	woodywoody
提出日時	2023-07-21 23:20:08
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,628 bytes
コンパイル時間	3,774 ms
コンパイル使用メモリ	230,496 KB
実行使用メモリ	32,700 KB
最終ジャッジ日時	2024-09-22 00:50:05
合計ジャッジ時間	6,964 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	1 ms 6,944 KB
testcase_02	AC	1 ms 6,944 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	3 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	1 ms 6,940 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	2 ms 6,944 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	35 ms 9,772 KB
testcase_25	AC	39 ms 10,452 KB
testcase_26	AC	33 ms 9,436 KB
testcase_27	AC	37 ms 10,132 KB
testcase_28	AC	32 ms 9,124 KB
testcase_29	AC	113 ms 19,552 KB
testcase_30	WA	-
testcase_31	AC	109 ms 19,848 KB
testcase_32	AC	86 ms 19,048 KB
testcase_33	AC	99 ms 18,544 KB
testcase_34	AC	313 ms 32,700 KB
testcase_35	AC	272 ms 31,252 KB
testcase_36	AC	231 ms 30,244 KB
testcase_37	AC	240 ms 32,160 KB
testcase_38	AC	252 ms 30,780 KB
testcase_39	AC	13 ms 13,776 KB
testcase_40	AC	14 ms 6,944 KB
testcase_41	AC	38 ms 10,368 KB
testcase_42	AC	11 ms 6,940 KB
testcase_43	AC	3 ms 6,944 KB
testcase_44	AC	34 ms 10,664 KB
testcase_45	AC	27 ms 8,248 KB
testcase_46	AC	5 ms 6,944 KB
testcase_47	AC	2 ms 6,940 KB
testcase_48	AC	21 ms 7,096 KB
testcase_49	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

void solve(){
    ll n; cin>>n;
    vl a(3),b(3);
    rep(i,3) cin>>a[i]>>b[i];
    ll ans = 0;

    ll l = lcm(a[1],a[2]);
    ll mx = n/a[0];
    vl dp(l+1,-LINF);
    dp[0] = 0;
    rep(i,2){
        rep(j,l+1){
            int nj = j + a[i+1];
            if (nj<=l) chmax(dp[nj],dp[j]+b[i+1]);
        }
    }
    rep(i,l+1){
        if (i) chmax(dp[i],dp[i-1]);
    }
    // ll s = max(l/a[1]*b[1],l/a[2]*b[2]);
    ll s = dp[l];
    rep(i,l+1){
        ll rem = n - a[0]*i;
        if (rem<0) continue;
        ll val = b[0]*i + (rem/l)*s;
        ll r = rem % l;
        val += dp[r];
        chmax(ans,val);
    }
    rep(i,min(mx,l)+1){
        ll rem = n - a[0]*(mx-i);
        if (rem<0) continue;
        ll val = b[0]*(mx-i) + (rem/l)*s;
        ll r = rem % l;
        val += dp[r];
        chmax(ans,val);
    }

    out;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード