結果

問題 No.1043 直列大学
ユーザー 👑 はまやんはまやんはまやんはまやん
提出日時 2020-05-01 23:54:18
言語 C++17(1z)
(gcc 10.2.0 + boost 1.73.0)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 3,906 Byte
コンパイル時間 1,849 ms
使用メモリ 7,036 KB
最終ジャッジ日時 2021-02-12 01:41:29
合計ジャッジ時間 3,398 ms
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 3 ms
4,980 KB
testcase_01 AC 3 ms
4,984 KB
testcase_02 AC 4 ms
4,980 KB
testcase_03 AC 3 ms
4,984 KB
testcase_04 AC 3 ms
4,980 KB
testcase_05 AC 4 ms
4,980 KB
testcase_06 AC 4 ms
5,408 KB
testcase_07 AC 4 ms
4,980 KB
testcase_08 AC 4 ms
4,984 KB
testcase_09 AC 14 ms
5,416 KB
testcase_10 AC 17 ms
4,984 KB
testcase_11 AC 24 ms
5,408 KB
testcase_12 AC 25 ms
5,412 KB
testcase_13 AC 21 ms
4,984 KB
testcase_14 AC 23 ms
4,980 KB
testcase_15 AC 25 ms
4,980 KB
testcase_16 AC 22 ms
4,980 KB
testcase_17 AC 17 ms
4,980 KB
testcase_18 AC 17 ms
5,412 KB
testcase_19 AC 21 ms
5,416 KB
testcase_20 AC 17 ms
5,412 KB
testcase_21 AC 20 ms
4,984 KB
testcase_22 AC 21 ms
4,980 KB
testcase_23 AC 26 ms
4,984 KB
testcase_24 AC 19 ms
4,984 KB
testcase_25 AC 21 ms
5,412 KB
testcase_26 AC 23 ms
4,984 KB
testcase_27 AC 13 ms
4,980 KB
testcase_28 AC 21 ms
4,980 KB
testcase_29 AC 8 ms
4,984 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/













#define DPMAX 101010
int N, M, V[101], R[101], A, B;
mint dp1[DPMAX], dp2[DPMAX];
//---------------------------------------------------------------------------------------------------
void dodp(int n, int* v, mint* dp) {
    dp[0] = 1;
    rep(i, 0, n) rrep(tot, DPMAX - 1, 0) if (0 <= tot - v[i]) dp[tot] += dp[tot - v[i]];
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> M;
	rep(i, 0, N) cin >> V[i];
	rep(i, 0, M) cin >> R[i];
	cin >> A >> B;

    dodp(N, V, dp1);
    rep(v, 1, DPMAX) dp1[v] += dp1[v - 1];

    dodp(M, R, dp2);

    mint ans = 0;
    rep(r, 1, DPMAX) {
        ll L = 1LL * A * r;
        ll R = 1LL * B * r;

        // [L, R]
        if (DPMAX <= L) continue;
        R = min(R, 1LL * DPMAX - 1);

        ans += dp1[R] * dp2[r];
        if (0 < L) ans -= dp1[L - 1] * dp2[r];
    }
    cout << ans << endl;
}





0