#894050 (C++17) No.2390 Udon Coupon (Hard)

提出ソース

結果

問題	No.2390 Udon Coupon (Hard)
ユーザー	snuke
提出日時	2023-07-21 22:15:14
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	68 ms / 2,000 ms
コード長	4,012 bytes
コンパイル時間	2,995 ms
コンパイル使用メモリ	209,328 KB
実行使用メモリ	34,688 KB
最終ジャッジ日時	2024-10-06 01:52:06
合計ジャッジ時間	5,734 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	28 ms 34,560 KB
testcase_01	AC	26 ms 34,432 KB
testcase_02	AC	64 ms 34,560 KB
testcase_03	AC	66 ms 34,432 KB
testcase_04	AC	66 ms 34,464 KB
testcase_05	AC	29 ms 34,544 KB
testcase_06	AC	62 ms 34,528 KB
testcase_07	AC	27 ms 34,432 KB
testcase_08	AC	28 ms 34,524 KB
testcase_09	AC	66 ms 34,560 KB
testcase_10	AC	28 ms 34,480 KB
testcase_11	AC	26 ms 34,432 KB
testcase_12	AC	27 ms 34,432 KB
testcase_13	AC	26 ms 34,560 KB
testcase_14	AC	27 ms 34,688 KB
testcase_15	AC	24 ms 34,432 KB
testcase_16	AC	25 ms 34,432 KB
testcase_17	AC	28 ms 34,432 KB
testcase_18	AC	29 ms 34,432 KB
testcase_19	AC	28 ms 34,432 KB
testcase_20	AC	27 ms 34,432 KB
testcase_21	AC	28 ms 34,432 KB
testcase_22	AC	63 ms 34,432 KB
testcase_23	AC	64 ms 34,432 KB
testcase_24	AC	66 ms 34,480 KB
testcase_25	AC	66 ms 34,432 KB
testcase_26	AC	64 ms 34,304 KB
testcase_27	AC	65 ms 34,464 KB
testcase_28	AC	64 ms 34,420 KB
testcase_29	AC	63 ms 34,524 KB
testcase_30	AC	64 ms 34,560 KB
testcase_31	AC	64 ms 34,560 KB
testcase_32	AC	68 ms 34,588 KB
testcase_33	AC	65 ms 34,560 KB
testcase_34	AC	64 ms 34,432 KB
testcase_35	AC	66 ms 34,460 KB
testcase_36	AC	64 ms 34,560 KB
testcase_37	AC	65 ms 34,424 KB
testcase_38	AC	65 ms 34,432 KB
testcase_39	AC	60 ms 34,432 KB
testcase_40	AC	63 ms 34,560 KB
testcase_41	AC	64 ms 34,432 KB
testcase_42	AC	63 ms 34,432 KB
testcase_43	AC	63 ms 34,420 KB
testcase_44	AC	64 ms 34,432 KB
testcase_45	AC	64 ms 34,636 KB
testcase_46	AC	62 ms 34,424 KB
testcase_47	AC	61 ms 34,560 KB
testcase_48	AC	63 ms 34,488 KB
testcase_49	AC	26 ms 34,460 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vv<T>& a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T>void vin(vc<T>& a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<class T>void operator-=(vc<T>&a,T b){for(T&x:a)x-=b;}
template<class T>void operator*=(vc<T>&a,T b){for(T&x:a)x*=b;}
template<class T>void operator/=(vc<T>&a,T b){for(T&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vector<T>& a){return *min_element(rng(a));}
template<class T>T max(const vector<T>& a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<class T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<class T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define rtn(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}

const int MX = 4000001;
struct Solver {
  void solve() {
    ll n; cin>>n;
    int m = 3;
    vp p(m); cin>>p;
    sort(rng(p), [](P a, P b) {
      return (ll)a.se*b.fi < (ll)b.se*a.fi;
    });
    auto [a,b] = p.back(); p.pob();
    vl dp(MX+2005);
    rep(i,MX) {
      for (auto [c,d] : p) {
        maxs(dp[i+c], dp[i]+d);
      }
    }

    ll ans = 0;
    rep(i,MX) if (i <= n) {
      ll now = dp[i] + (n-i)/a*b;
      maxs(ans,now);
    }
    cout<<ans<<endl;
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード