#703871 (C++17) No.1693 Invasion

• 問題: No.1693 Invasion
• ユーザー: sapphire__15
• 提出日時: 2021-10-01 21:35:06
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 9 ms / 2,000 ms
• コード長: 5,691 bytes
• コンパイル時間: 2,185 ms
• コンパイル使用メモリ: 140,736 KB
• 実行使用メモリ: 6,580 KB
• 最終ジャッジ日時: 2023-09-26 16:36:58
• 合計ジャッジ時間: 3,283 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	6 ms; 6,128 KB
testcase_01	AC	6 ms; 6,084 KB
testcase_02	AC	6 ms; 6,036 KB
testcase_03	AC	6 ms; 6,128 KB
testcase_04	AC	6 ms; 6,136 KB
testcase_05	AC	7 ms; 6,048 KB
testcase_06	AC	6 ms; 6,140 KB
testcase_07	AC	6 ms; 6,196 KB
testcase_08	AC	6 ms; 6,148 KB
testcase_09	AC	8 ms; 6,424 KB
testcase_10	AC	8 ms; 6,572 KB
testcase_11	AC	7 ms; 6,464 KB
testcase_12	AC	8 ms; 6,424 KB
testcase_13	AC	7 ms; 6,268 KB
testcase_14	AC	7 ms; 6,580 KB
testcase_15	AC	7 ms; 6,192 KB
testcase_16	AC	7 ms; 6,528 KB
testcase_17	AC	6 ms; 6,036 KB
testcase_18	AC	9 ms; 6,504 KB
testcase_19	AC	7 ms; 6,520 KB
testcase_20	AC	6 ms; 6,032 KB
testcase_21	AC	9 ms; 6,424 KB
testcase_22	AC	8 ms; 6,520 KB
testcase_23	AC	9 ms; 6,464 KB

ソースコード

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <random>
#include <complex>
#include <bitset>

#define rep(i, n, s) for (int i = (s); i < int(n); i++)
#define per(i, n, s) for (int i = (n - 1); i >= int(s); i--)
#define MM << " " <<
#define all(x) x.begin(), x.end()
#define rall(x) rbegin(x), rend(x)

template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using MaxHeap = std::priority_queue<T>;

using ll = long long;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
using Pdd = std::pair<double, double>;

template <class T>
bool chmin(T &a, const T b) {
    if (a > b) {
        a = b;
        return true;
    } else {
        return false;
    }
}

template <class T>
bool chmax(T &a, const T b) {
    if (a < b) {
        a = b;
        return true;
    } else {
        return false;
    }
}

template <class T>
void vdeb(const std::vector<T> &da) {
    auto n = da.size();
    for (size_t i = 0; i < n; i++) {
        if (i == n - 1)
            std::cout << da[i] << std::endl;
        else
            std::cout << da[i] << " ";
    }
}
template<class T>
void vdeb(const std::vector<std::vector<T>> &da) {
    auto n = da.size();
    for (size_t i = 0; i < n; i++) {
        std::cout << i << " : ";
        vdeb(da[i]);
    }
}

template <>
void vdeb(const std::vector<std::string> &da) {
    auto n = da.size();
    for (size_t i = 0; i < n; i++) { std::cout << da[i] << std::endl; }
}

struct modint {
    long long num;
    const static long long p = 998244353;
    constexpr static long long pow(long long n, long long k) {//n^k(mod p)
        long long ret = 1;
        while(k) {
            if(k&1) ret = ret * n % p;
            n = n * n % p;
            k >>= 1;
        }
        return ret;
    }
    // a*A + b*B = 1
    constexpr static void euclid(long long &a, long long &b) { // a>=b A*b+B*(a-a/b*b)=1
        if (a == 1) {
            a = 1;
        }
        else {
            long long A = b, B = a % b;
            euclid(A, B);
            b = (A - (p + a / b) % p * B % p + p) % p;
            a = B;
        }
    }
    constexpr static long long rev(const long long n) {// n*x-p*y=1
        //long long q = p;
        //euclid(p, n, p);
        //return n % q;
        return pow(n,p-2);
    }
    constexpr modint() : num(0) {}
    constexpr modint(long long x) : num(x%p < 0 ? x%p+p : x%p) {}
    constexpr modint inv() const {return rev(num);}
    modint operator-() const {return modint(p-num);}
    modint& operator+=(const modint &other){
        num = (num + other.num) % p;
        return *this;
    }
    modint& operator-=(const modint &other){
        num = (num - other.num + p) % p;
        return *this;
    }
    modint& operator*=(const modint &other){
        num = (num * other.num) % p;
        return *this;
    }
    modint& operator/=(const modint &other){
        (*this) *= other.inv();
        return *this;
    }
    modint& operator+=(const long long &other){
        num = (num + other) % p;
        return *this;
    }
    modint& operator-=(const long long &other){
        num = (num - other + p) % p;
        return *this;
    }
    modint& operator*=(const long long &other){
        num = (num * other) % p;
        return *this;
    }
    modint& operator/=(const long long &other){
        (*this) *= rev(other);
        return *this;
    }
    modint& operator++(){return *this += 1;}
    modint& operator--(){return *this -= 1;}
    modint& operator=(const long long &other){return (*this) = modint(other);}
    modint operator+(const modint &other) const{return modint(*this) += other;}
    modint operator-(const modint &other) const{return modint(*this) -= other;}
    modint operator*(const modint &other) const{return modint(*this) *= other;}
    modint operator/(const modint &other) const{return modint(*this) /= other;}
    modint operator+(const long long &other) const{return modint(*this) += other;}
    modint operator-(const long long &other) const{return modint(*this) -= other;}
    modint operator*(const long long &other) const{return modint(*this) *= other;}
    modint operator/(const long long &other) const{return modint(*this) /= other;}
    bool operator==(const modint &other) const{return num == other.num;}
};
std::istream& operator>>(std::istream &is, modint x) {
    is >> x.num;
    return is;
}
std::ostream& operator<<(std::ostream &os, const modint &x){
    os << x.num;
    return os;
}

struct combination{
    std::vector<modint> li;
    std::vector<modint> rev;
    combination(int size = 202000){
        li = std::vector<modint>(size);
        rev = std::vector<modint>(size);
        li[0] = 1;
        for(int i= 1; i< size;i++) li[i] = li[i-1]*i;
        rev.back() = modint(1)/li.back();
        for(int i = size-1; i > 0; i--) rev[i-1] = rev[i]*i;
    }
    modint nCk(int n, int k){
        if(k < 0 || n < k) return 1;
        return li[n]*rev[k]*rev[n-k];
    }
} comb(202000);

using namespace std;

int main() {
    int n, m; cin >> n >> m;
    vector<int> da(n);
    rep(i,n,0) cin >> da[i];
    vector<int> dp(m+1, m+1);
    dp[0] = 0;
    rep(i,n,0) {
        rep(j,m+1-da[i],0) {
            chmin(dp[j+da[i]], dp[j]+1);
        }
    }
    modint ans;
    rep(i,m+1,0) {
        if(dp[i] != m+1) {
            ans += comb.nCk(m-dp[i], i-dp[i]);
        }
    }
    cout << ans << endl;
}