結果
| 問題 | No.1043 直列大学 |
| ユーザー |
 gyouzasushi
|
| 提出日時 | 2020-05-01 23:06:40 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 305 ms / 2,000 ms |
| コード長 | 5,681 bytes |
| コンパイル時間 | 3,162 ms |
| コンパイル使用メモリ | 210,372 KB |
| 最終ジャッジ日時 | 2025-01-10 05:28:13 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)#define all(x) (x).begin(), (x).end()#define sz(x) int(x.size())#define get_unique(x) x.erase(unique(all(x)), x.end());typedef long long ll;typedef complex<double> Complex;const int INF = 1e9;const ll MOD = 1e9 + 7;const ll LINF = 1e18;template <class T>bool chmax(T& a, const T& b) {if (a < b) {a = b;return 1;}return 0;}template <class T>bool chmin(T& a, const T& b) {if (b < a) {a = b;return 1;}return 0;}template <class T>vector<T> make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>auto make_vec(size_t a, Ts... ts) {return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));}template <typename T>ostream& operator<<(ostream& os, vector<T> v) {for (int i = 0; i < sz(v); i++) {os << v[i];if (i < sz(v) - 1) os << " ";}return os;}struct modint {ll x;constexpr modint(ll x = 0) : x((x % MOD + MOD) % MOD) {}constexpr ll value() const {return x;}constexpr modint operator-() const {return modint(-x);}constexpr modint& operator+=(const modint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}constexpr modint& operator-=(const modint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}constexpr modint& operator*=(const modint a) {(x *= a.x) %= MOD;return *this;}constexpr modint operator+(const modint a) const {modint res(*this);return res += a;}constexpr modint operator-(const modint a) const {modint res(*this);return res -= a;}constexpr modint operator*(const modint a) const {modint res(*this);return res *= a;}constexpr modint pow(ll t) const {if (t == 0) return 1;modint a = pow(t >> 1);a *= a;if (t % 2 == 1) a *= *this;return a;}constexpr modint inv() const {return pow(MOD - 2);}constexpr modint& operator/=(const modint a) {return (*this) *= a.inv();}constexpr modint operator/(const modint a) const {modint res(*this);return res /= a;}};ostream& operator<<(ostream& os, const modint& x) {os << x.value();return os;}struct combination {vector<modint> fact, ifact;combination(int n) : fact(n + 1), ifact(n + 1) {assert(n < MOD);fact[0] = 1;for (int i = 1; i <= n; i++) {fact[i] = fact[i - 1] * i;}ifact[n] = fact[n].inv();for (int i = n; i >= 1; i--) {ifact[i - 1] = ifact[i] * i;}}modint operator()(int n, int k) {if (n < k || k < 0) return 0;return fact[n] * ifact[k] * ifact[n - k];}modint h(int n, int k) {n += k - 1;if (k < 0 || k > n) return 0;return fact[n] * ifact[k] * ifact[n - k];}} comb(2002002);template <typename T>struct SegmentTree {int n;vector<T> node;T calc(T a, T b) {return a + b;// return min(a, b);// return max(a, b);}T e = 0;SegmentTree(vector<T> v) {int sz = v.size();n = 1;while (n < sz) {n *= 2;}node.resize(2 * n - 1, e);for (int i = 0; i < sz; i++) {node[i + n - 1] = v[i];}for (int i = n - 2; i >= 0; i--) {node[i] = calc(node[2 * i + 1], node[2 * i + 2]);}}SegmentTree(int sz) {n = 1;while (n < sz) {n *= 2;}node.resize(2 * n - 1, e);}void update(int x, T val) {x = n + x - 1;node[x] = val;while (x > 0) {x = (x - 1) / 2;node[x] = calc(node[2 * x + 1], node[2 * x + 2]);}}void add(int x, T val) {x = n + x - 1;node[x] += val;while (x > 0) {x = (x - 1) / 2;node[x] = calc(node[2 * x + 1], node[2 * x + 2]);}}T query(int a, int b, int k = 0, int l = 0, int r = -1) {if (r < 0) r = n;if (r <= a || b <= l) return e;if (a <= l && r <= b) return node[k];T vl = query(a, b, 2 * k + 1, l, (l + r) / 2);T vr = query(a, b, 2 * k + 2, (l + r) / 2, r);return calc(vl, vr);}T at(int x) {return node[n + x - 1];}};int main() {int n, m;cin >> n >> m;vector<ll> v(n), r(m);rep(i, n) cin >> v[i];rep(i, m) cin >> r[i];ll a, b;cin >> a >> b;auto dpv = make_vec<modint>(110, 100100);dpv[0][0] = 1;for (int i = 0; i < n; i++) {for (int j = 0; j < 100100; j++) {if (j + v[i] < 100100) dpv[i + 1][j + v[i]] += dpv[i][j];dpv[i + 1][j] += dpv[i][j];}}auto dpr = make_vec<modint>(110, 100100);dpr[0][0] = 1;for (int i = 0; i < m; i++) {for (int j = 0; j < 100100; j++) {if (j + r[i] < 100100) dpr[i + 1][j + r[i]] += dpr[i][j];dpr[i + 1][j] += dpr[i][j];}}dpv[n][0] = dpr[m][0] = 0;modint ans = 0;SegmentTree<modint> segt(dpr[m]);for (int j = 0; j < 100100; j++) {int x = (j % b == 0 ? j / b : j / b + 1);int y = j / a + 1;ans += dpv[n][j] * (segt.query(x, 100100) - segt.query(y, 100100));}cout << ans << endl;}