#905709 (C++17) No.2429 Happiest Tabehodai Ways

提出ソース

結果

問題	No.2429 Happiest Tabehodai Ways
ユーザー	jabee
提出日時	2023-08-18 22:40:20
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	27 ms / 2,000 ms
コード長	4,932 bytes
コンパイル時間	5,406 ms
コンパイル使用メモリ	267,108 KB
実行使用メモリ	19,104 KB
最終ジャッジ日時	2024-06-12 08:01:17
合計ジャッジ時間	6,295 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	25 ms 19,012 KB
testcase_01	AC	23 ms 18,996 KB
testcase_02	AC	24 ms 19,104 KB
testcase_03	AC	24 ms 18,888 KB
testcase_04	AC	23 ms 18,932 KB
testcase_05	AC	23 ms 18,944 KB
testcase_06	AC	23 ms 18,900 KB
testcase_07	AC	23 ms 19,048 KB
testcase_08	AC	23 ms 18,964 KB
testcase_09	AC	25 ms 18,988 KB
testcase_10	AC	24 ms 19,072 KB
testcase_11	AC	24 ms 19,020 KB
testcase_12	AC	24 ms 18,928 KB
testcase_13	AC	25 ms 18,924 KB
testcase_14	AC	24 ms 19,072 KB
testcase_15	AC	26 ms 19,068 KB
testcase_16	AC	24 ms 19,072 KB
testcase_17	AC	24 ms 19,072 KB
testcase_18	AC	24 ms 18,944 KB
testcase_19	AC	24 ms 19,016 KB
testcase_20	AC	24 ms 18,928 KB
testcase_21	AC	23 ms 18,944 KB
testcase_22	AC	24 ms 18,928 KB
testcase_23	AC	26 ms 19,072 KB
testcase_24	AC	25 ms 19,048 KB
testcase_25	AC	23 ms 19,044 KB
testcase_26	AC	24 ms 18,944 KB
testcase_27	AC	24 ms 18,904 KB
testcase_28	AC	23 ms 18,908 KB
testcase_29	AC	26 ms 18,956 KB
testcase_30	AC	23 ms 18,944 KB
testcase_31	AC	23 ms 18,956 KB
testcase_32	AC	25 ms 18,952 KB
testcase_33	AC	25 ms 18,944 KB
testcase_34	AC	27 ms 18,944 KB
testcase_35	AC	26 ms 18,964 KB
testcase_36	AC	27 ms 18,920 KB
testcase_37	AC	24 ms 18,944 KB
testcase_38	AC	27 ms 18,928 KB
testcase_39	AC	25 ms 19,072 KB
testcase_40	AC	25 ms 18,944 KB
testcase_41	AC	23 ms 18,992 KB
testcase_42	AC	25 ms 19,028 KB
testcase_43	AC	24 ms 18,924 KB

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

ソースコード

raw source code

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
 
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
 
//---------------------------------------------------------------------------------------------------
 
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
 
#endif // templete
//---------------------------------------------------------------------------------------------------
void _main() {
  ll n,k;
  cin >> n >> k;
  vector<ll>c(n),d(n);
  rep(i,0,n)cin >> c[i];
  rep(i,0,n)cin >> d[i];
  vector<ll>dp_max(k+1,-infl);
  vector<mint>dp_pat(k+1,0);
  dp_max[0] = 0;
  dp_pat[0] = 1;

  rep(i,0,k){
    if(dp_max[i] == -infl)continue;
    rep(j,0,n){
        ll ni = i + c[j];
        ll nval = dp_max[i] + d[j];
        if(ni > k)continue;
        if(chmax(dp_max[ni],nval)){
            dp_pat[ni] = 0;
            dp_pat[ni] += dp_pat[i];
        }else if(dp_max[ni] == nval){
            dp_pat[ni] += dp_pat[i];
        }
    }
  }
  
  
  mint ans = 0;
  ll max_d = -infl;
  rep(i,0,k+1)chmax(max_d,dp_max[i]);
  //rep(i,0,k+1)cout << dp_max[i] << " ";
  //cout << endl;

  //rep(i,0,k+1)cout << dp_pat[i] << " ";
  //cout << endl;
  rep(i,0,k+1)if(max_d == dp_max[i])ans += dp_pat[i];
  cout << max_d << endl;
  cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード