結果

問題 No.1474 かさまＪ
ユーザー leaf_1415leaf_1415
提出日時 2021-04-09 22:20:25
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 258 ms / 2,500 ms
コード長 5,756 bytes
コンパイル時間 737 ms
コンパイル使用メモリ 86,984 KB
実行使用メモリ 330,164 KB
最終ジャッジ日時 2023-09-07 11:46:11
合計ジャッジ時間 4,792 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 99 ms
330,032 KB
testcase_01 AC 97 ms
330,116 KB
testcase_02 AC 98 ms
330,092 KB
testcase_03 AC 98 ms
330,120 KB
testcase_04 AC 98 ms
329,964 KB
testcase_05 AC 162 ms
330,012 KB
testcase_06 AC 109 ms
330,164 KB
testcase_07 AC 98 ms
330,016 KB
testcase_08 AC 97 ms
329,964 KB
testcase_09 AC 188 ms
330,028 KB
testcase_10 AC 100 ms
330,004 KB
testcase_11 AC 97 ms
330,008 KB
testcase_12 AC 97 ms
329,948 KB
testcase_13 AC 194 ms
329,956 KB
testcase_14 AC 125 ms
329,964 KB
testcase_15 AC 110 ms
330,072 KB
testcase_16 AC 100 ms
330,024 KB
testcase_17 AC 129 ms
330,008 KB
testcase_18 AC 228 ms
330,104 KB
testcase_19 AC 252 ms
330,064 KB
testcase_20 AC 258 ms
330,012 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) {
		os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	}
	return os;
}
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, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}


const int FACT_MAX = 200005;
mint fact[FACT_MAX], fact_inv[FACT_MAX];

void make_fact()
{
	mint val = 1;
	fact[0] = 1;
	for(int i = 1; i < FACT_MAX; i++){
		val *= i;
		fact[i] = val;
	}
	fact_inv[FACT_MAX-1] = fact[FACT_MAX-1].inverse();
	for(int i = FACT_MAX-2; i >= 0; i--){
		fact_inv[i] = fact_inv[i+1] * (i+1);
	}
}

mint comb(ll n, ll k)
{
	mint ret = 1;
	ret *= fact[n];
	ret *= fact_inv[k];
	ret *= fact_inv[n-k];
	return ret;
}


ll n, p, q, l;
ll s[45];

mint dp[45][45][20005];
mint sum[45][20005];
	
int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	make_fact();
	
	cin >> n >> p >> q >> l;
	rep(i, 1, n) cin >> s[i];
	
	dp[0][0][0] = mint(1);
	rep(i, 1, n){
		rep(j, 0, n){
			sum[j][0] = dp[i-1][j][0];
			rep(k, 1, q) sum[j][k] = sum[j][k-1] + dp[i-1][j][k];
		}
		rep(j, 0, n){
			rep(k, 0, q){
				dp[i][j][k] = dp[i-1][j][k];
				ll L = max(0LL, k - s[i]);
				if(j-1 >= 0){
					dp[i][j][k] += sum[j-1][k-1];
					if(L > 0) dp[i][j][k] -= sum[j-1][L-1];
				}
			}
		}
	}
	
	mint ans = 0;
	rep(i, 0, n){
		rep(j, 0, q){
			if(dp[n][i][j] == mint(0) || p - (i*l - j) < 0) continue;
			ans += dp[n][i][j] * comb(p - (i*l - j) + n-1 , n-1);
		}
	}
	outl(ans);
	
	return 0;
}
0