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

提出ソース

結果

問題	No.2429 Happiest Tabehodai Ways
ユーザー	dyktr_06
提出日時	2023-08-18 21:55:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	961 ms / 2,000 ms
コード長	7,622 bytes
コンパイル時間	4,548 ms
コンパイル使用メモリ	264,604 KB
実行使用メモリ	11,400 KB
最終ジャッジ日時	2024-06-12 07:58:52
合計ジャッジ時間	8,169 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	338 ms 11,336 KB
testcase_01	AC	5 ms 11,332 KB
testcase_02	AC	5 ms 11,348 KB
testcase_03	AC	6 ms 11,284 KB
testcase_04	AC	5 ms 11,140 KB
testcase_05	AC	6 ms 11,240 KB
testcase_06	AC	5 ms 11,288 KB
testcase_07	AC	5 ms 11,376 KB
testcase_08	AC	5 ms 11,280 KB
testcase_09	AC	5 ms 11,212 KB
testcase_10	AC	5 ms 11,280 KB
testcase_11	AC	5 ms 11,164 KB
testcase_12	AC	5 ms 11,336 KB
testcase_13	AC	6 ms 11,320 KB
testcase_14	AC	5 ms 11,260 KB
testcase_15	AC	11 ms 11,316 KB
testcase_16	AC	5 ms 11,228 KB
testcase_17	AC	5 ms 11,252 KB
testcase_18	AC	6 ms 11,272 KB
testcase_19	AC	7 ms 11,280 KB
testcase_20	AC	6 ms 11,164 KB
testcase_21	AC	5 ms 11,268 KB
testcase_22	AC	5 ms 11,280 KB
testcase_23	AC	5 ms 11,248 KB
testcase_24	AC	5 ms 11,256 KB
testcase_25	AC	5 ms 11,364 KB
testcase_26	AC	5 ms 11,272 KB
testcase_27	AC	5 ms 11,288 KB
testcase_28	AC	5 ms 11,200 KB
testcase_29	AC	15 ms 11,360 KB
testcase_30	AC	9 ms 11,332 KB
testcase_31	AC	5 ms 11,256 KB
testcase_32	AC	6 ms 11,168 KB
testcase_33	AC	16 ms 11,400 KB
testcase_34	AC	12 ms 11,208 KB
testcase_35	AC	6 ms 11,292 KB
testcase_36	AC	40 ms 11,376 KB
testcase_37	AC	6 ms 11,292 KB
testcase_38	AC	6 ms 11,276 KB
testcase_39	AC	7 ms 11,200 KB
testcase_40	AC	961 ms 11,324 KB
testcase_41	AC	7 ms 11,228 KB
testcase_42	AC	471 ms 11,172 KB
testcase_43	AC	5 ms 11,324 KB

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

ソースコード

raw source code

#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); } }


template <long long Modulus>
struct ModInt{
    long long val;
    constexpr ModInt(const long long &_val = 0) noexcept : val(_val) {
        normalize();
    }
    void normalize(){
        val = (val % Modulus + Modulus) % Modulus;
    }
    inline ModInt& operator+=(const ModInt& rhs) noexcept {
        if(val += rhs.val, val >= Modulus) val -= Modulus;
        return *this;
    }
    inline ModInt& operator-=(const ModInt& rhs) noexcept {
        if(val -= rhs.val, val < 0) val += Modulus;
        return *this;
    }
    inline ModInt& operator*=(const ModInt& rhs) noexcept {
        val = val * rhs.val % Modulus;
        return *this;
    }
    inline ModInt& operator/=(const ModInt& rhs) noexcept {
        val = val * inv(rhs.val).val % Modulus;
        return *this;
    }
    inline ModInt& operator++() noexcept {
        if(++val >= Modulus) val -= Modulus;
        return *this;
    }
    inline ModInt operator++(int) noexcept {
        ModInt t = val;
        if(++val >= Modulus) val -= Modulus;
        return t;
    }
    inline ModInt& operator--() noexcept {
        if(--val < 0) val += Modulus;
        return *this;
    }
    inline ModInt operator--(int) noexcept {
        ModInt t = val;
        if(--val < 0) val += Modulus;
        return t;
    }
    inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; }
    inline ModInt inv(void) const { return inv(val); }
    ModInt inv(const long long& n) const {
        long long a = n, b = Modulus, u = 1, v = 0;
        while(b){
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        u %= Modulus;
        if(u < 0) u += Modulus;
        return u;
    }
    friend inline ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) += rhs; }
    friend inline ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) -= rhs; }
    friend inline ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) *= rhs; }
    friend inline ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) /= rhs; }
    friend inline bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val == rhs.val; }
    friend inline bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val != rhs.val; }
    friend inline istream& operator>>(istream& is, ModInt& x) noexcept {
        is >> x.val;
        x.normalize();
        return is;
    }
    friend inline ostream& operator<<(ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

using mint = ModInt<998244353>;

ll n, k;
vll c, d;

void input(){
    in(n, k);
    vin(c, n);
    vin(d, n);
}

ll dp[1001];

mint dp2[1001][1001];

void solve(){
    rep(i, k + 1){
        rep(j, n){
            if(i + c[j] <= k){
                chmax(dp[i + c[j]], dp[i] + d[j]);
            }
        }
    }
    dp2[0][0] = 1;
    rep(i, k + 1){
        rep(j, n){
            if(i + c[j] > k) continue;
            if(dp[i + c[j]] != dp[i] + d[j]) continue;
            rep(l, i + 1){
                dp2[i + c[j]][l + 1] += dp2[i][l];
            }
        }
    }
    ll ans1 = 0;
    rep(i, k + 1){
        chmax(ans1, dp[i]);
    }
    mint ans2 = 0;
    rep(i, k + 1){
        if(dp[i] != ans1) continue;
        rep(j, k + 1){
        	// out(i, j, dp2[i][j]);
        	ans2 += dp2[i][j];
        }
    }
    out(ans1);
    out(ans2);
}

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

yukicoder

結果

テストケース

ソースコード