結果

問題 No.1474 かさまＪ
ユーザー Ogtsn99Ogtsn99
提出日時 2021-04-14 18:44:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 366 ms / 2,500 ms
コード長 6,988 bytes
コンパイル時間 2,272 ms
コンパイル使用メモリ 212,792 KB
実行使用メモリ 351,332 KB
最終ジャッジ日時 2024-06-30 17:59:51
合計ジャッジ時間 5,428 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 16 ms
15,336 KB
testcase_01 AC 17 ms
15,424 KB
testcase_02 AC 18 ms
16,388 KB
testcase_03 AC 16 ms
15,380 KB
testcase_04 AC 16 ms
15,428 KB
testcase_05 AC 167 ms
166,528 KB
testcase_06 AC 46 ms
43,612 KB
testcase_07 AC 18 ms
15,976 KB
testcase_08 AC 19 ms
16,568 KB
testcase_09 AC 207 ms
211,896 KB
testcase_10 AC 29 ms
29,636 KB
testcase_11 AC 19 ms
18,988 KB
testcase_12 AC 19 ms
17,048 KB
testcase_13 AC 236 ms
231,932 KB
testcase_14 AC 82 ms
77,896 KB
testcase_15 AC 46 ms
44,276 KB
testcase_16 AC 31 ms
30,276 KB
testcase_17 AC 106 ms
100,580 KB
testcase_18 AC 307 ms
295,028 KB
testcase_19 AC 363 ms
336,788 KB
testcase_20 AC 366 ms
351,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i, n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
// p.real() or real(p) -> x軸, p.imag() or imag(p) -> y軸
using Vector2d = complex<Real>;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;

template<typename T>
int getIndexOfLowerBound(vector<T> &v, T x) {
    return lower_bound(v.begin(), v.end(), x) - v.begin();
}

template<typename T>
int getIndexOfUpperBound(vector<T> &v, T x) {
    return upper_bound(v.begin(), v.end(), x) - v.begin();
}

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

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

#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)

istream &operator>>(istream &is, Point &p) {
    Real a, b;
    is >> a >> b;
    p = Point(a, b);
    return is;
}

template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
    is >> p_var.first >> p_var.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << pair_var.first << ' ' << pair_var.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    for (int i = 0; i < vec.size(); i++)
        os << vec[i] << ' ';
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, vector<pair<T, U>> &vec) {
    for (int i = 0; i < vec.size(); i++)
        os << vec[i] << '\n';
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
    for (auto &vec : df) os << vec;
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    repi(itr, map_var) {
        os << *itr << ' ';
        itr++;
        itr--;
    }
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    repi(itr, set_var) {
        os << *itr << ' ';
        itr++;
        itr--;
    }
    return os;
}

void print() { cout << endl; }

template<class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0) cout << " ";
    print(forward<Tail>(tail)...);
}

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    template<class T>
    constexpr Fp operator + (const T& r) const noexcept { return Fp(*this) += (Fp)r; }
    template<class T>
    constexpr Fp operator - (const T& r) const noexcept { return Fp(*this) -= (Fp)r; }
    template<class T>
    constexpr Fp operator * (const T& r) const noexcept { return Fp(*this) *= (Fp)r; }
    template<class T>
    constexpr Fp operator / (const T& r) const noexcept { return Fp(*this) /= (Fp)r; }

    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
};

Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
    if (n == 0) return 1;
    auto t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
}

using mint = Fp<1000000007>;

template< typename T >
struct ruiseki{
    vector <T> s;
    int sz;
    ruiseki(vector <T> &a){
        sz = a.size()+1;
        s.resize(sz);
        for(int i=1;i<sz;i++) s[i] = s[i-1] + a[i-1];
    }
    T get(int a, int b){
        if(a < 0) a = 0; if(a > sz-1) a = sz-1;
        if(b > sz-1) b = sz-1;
        return s[b] - s[a];
    }
};

const int MAX = 510000;

long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

mint nHk(int n, int k){
    return (mint)COM(n+k-1, k);
}

signed main(void) {
    cin.tie(0);
    ios::sync_with_stdio(false);
    COMinit();

    int n, mp, mq, l; cin>>n>>mp>>mq>>l;
    vector<int> s(n);
    cin>>s;

    vector<vector<vector<mint>>> dp(n+1, vector<vector<mint>>(n + 10, vector<mint>(mq+100)));

    dp[0][0][0] = 1;

    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < i; ++j) {
            ruiseki<mint> r(dp[i-1][j]);
            dp[i][j][0] += dp[i-1][j][0];
            for (int k = 1; k <= mq; ++k) {
                // 使わない
                dp[i][j][k] += dp[i-1][j][k];
                // 使う
                dp[i][j+1][k] += r.get(k - s[i-1], k);
            }
        }
    }

    mint ans = 0;
     for (int i = 0; i <= mq; ++i) {
         for (int j = 0; j <= n; ++j) {
            if (0 <= j * l - i && j * l - i <= mp) {
                ans += dp[n][j][i] * nHk(n, mp - (j * l - i));
            }
        }
    }

    print(ans);
}
0