結果

問題 No.1043 直列大学
ユーザー tkmst201tkmst201
提出日時 2021-02-19 21:43:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 4,269 bytes
コンパイル時間 2,476 ms
コンパイル使用メモリ 204,668 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-22 20:14:02
合計ジャッジ時間 3,463 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,820 KB
testcase_08 AC 2 ms
6,816 KB
testcase_09 AC 8 ms
6,816 KB
testcase_10 AC 10 ms
6,820 KB
testcase_11 AC 21 ms
6,816 KB
testcase_12 AC 25 ms
6,820 KB
testcase_13 AC 18 ms
6,816 KB
testcase_14 AC 20 ms
6,816 KB
testcase_15 AC 23 ms
6,816 KB
testcase_16 AC 19 ms
6,816 KB
testcase_17 AC 12 ms
6,820 KB
testcase_18 AC 12 ms
6,816 KB
testcase_19 AC 17 ms
6,820 KB
testcase_20 AC 11 ms
6,820 KB
testcase_21 AC 16 ms
6,816 KB
testcase_22 AC 16 ms
6,816 KB
testcase_23 AC 24 ms
6,820 KB
testcase_24 AC 13 ms
6,820 KB
testcase_25 AC 18 ms
6,816 KB
testcase_26 AC 20 ms
6,816 KB
testcase_27 AC 7 ms
6,816 KB
testcase_28 AC 18 ms
6,820 KB
testcase_29 AC 4 ms
6,816 KB
testcase_30 AC 12 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

template<int M>
struct ModInt {
	static_assert(M > 0);
	
public:
	using value_type = int;
	using calc_type = std::int_fast64_t;
	
private:
	value_type val_;
	
public:
	constexpr ModInt(calc_type val = 0) : val_(val < 0 ? (val % M + M) % M : val % M) {}
	constexpr const value_type & val() const noexcept { return val_; }
	constexpr static decltype(M) mod() noexcept { return M; }
	
	explicit constexpr operator bool() const noexcept { return val_; }
	constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
	constexpr ModInt operator +() const noexcept { return ModInt(*this); }
	constexpr ModInt operator -() const noexcept { return ModInt(-val_); }
	constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
	constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
	constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
	constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
	constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
	constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
	constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
	constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
	friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
	friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
	friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
	friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
	friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
	friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
	friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
	friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
	
	constexpr ModInt pow(calc_type n) const noexcept {
		ModInt res = 1, x = val_;
		if (n < 0) { x = x.inv(); n = -n; }
		while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
		return res;
	}
	
	constexpr ModInt inv() const noexcept {
		value_type a = val_, a1 = 1, a2 = 0, b = M, b1 = 0, b2 = 1;
		while (b > 0) {
			value_type q = a / b, r = a % b;
			value_type nb1 = a1 - q * b1, nb2 = a2 - q * b2;
			a = b; b = r;
			a1 = b1; b1 = nb1;
			a2 = b2; b2 = nb2;
		}
		assert(a == 1);
		return a1;
	}
};
using mint = ModInt<MOD>;

int main() {
	int N, M;
	cin >> N >> M;
	vector<int> V(N), R(M);
	REP(i, N) scanf("%d", &V[i]);
	REP(i, M) scanf("%d", &R[i]);
	int A, B;
	cin >> A >> B;
	
	auto func = [&](const vector<int> & v, int mx) {
		vector<mint> res(mx + 1);
		res[0] = 1;
		for (int a : v) for (int i = mx; i >= a; --i) res[i] += res[i - a];
		return res;
	};
	
	auto dp1 = func(V, 1000 * N);
	auto dp2 = func(R, 1000 * M);
	FOR(i, 1, dp1.size()) dp1[i] += dp1[i - 1];
	
	
	mint ans = 0;
	// RA <= V <= RB
	FOR(i, 1, dp2.size()) {
		const int r = min<ll>((ll)i * B, dp1.size() - 1);
		const int l = min<ll>((ll)i * A, dp1.size() - 1);
		ans += dp2[i] * (dp1[r] - dp1[l - 1]);
	}
	cout << ans << endl;
}
0