結果

問題 No.1043 直列大学
ユーザー kcvlex
提出日時 2020-05-01 21:44:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 27 ms / 2,000 ms
コード長 5,525 bytes
コンパイル時間 1,498 ms
コンパイル使用メモリ 150,064 KB
最終ジャッジ日時 2025-01-10 04:32:28
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec
    <decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail
    ...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std
    ::setprecision(30); } } init_io; }
namespace math {
template <typename T>
constexpr T pow(const T &n, ll k) {
    T ret = n.mul_id_ele();
    T cur = n;
    while (k) {
        if (k & 1) ret *= cur;
        cur *= cur;
        k /= 2;
    }
    return ret;
}
}
namespace math {
template <ll Mod>
struct Modint {
    constexpr Modint(ll x) noexcept : x((Mod + x % Mod) % Mod) { }
    
    constexpr Modint() noexcept : Modint(0) { }
    
    constexpr Modint<Mod> add_id_ele() const noexcept { 
        return Modint<Mod>(0); 
    }
    
    constexpr Modint<Mod> mul_id_ele() const noexcept {
        return Modint<Mod>(1); 
    }
    
    constexpr ll& value() noexcept { 
        return x; 
    }
    
    constexpr ll value() const noexcept {
        return x; 
    }
    constexpr Modint& operator +=(const Modint &oth) noexcept {
        x += oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }
    constexpr Modint& operator -=(const Modint &oth) noexcept {
        x += Mod - oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }
    constexpr Modint& operator *=(const Modint &oth) noexcept {
        x *= oth.value();
        x %= Mod;
        return *this;
    }
    constexpr Modint& operator /=(const Modint &oth) noexcept {
        x *= oth.inv();
        x %= Mod;
        return *this;
    }
    constexpr Modint operator +(const Modint &oth) const noexcept {
        return Modint(x) += oth;
    }
    constexpr Modint operator -(const Modint &oth) const noexcept {
        return Modint(x) -= oth;
    }
    constexpr Modint operator *(const Modint &oth) const noexcept {
        return Modint(x) *= oth;
    }
    constexpr Modint operator /(const Modint &oth) const noexcept {
        return Modint(x) /= oth;
    }
    constexpr Modint operator -() const noexcept {
        return Modint((x != 0) * (Mod - x)); 
    }
    template <typename T>
    constexpr typename std::enable_if<std::is_integral<T>::value, const Modint&>::type
    operator =(T t) noexcept {
        (*this) = Modint(std::forward<T>(t)); 
        return *this;
    }
    constexpr Modint inv() const noexcept {
        return ::math::pow(*this, Mod - 2);
    }
    constexpr ll mod() const noexcept {
        return Mod;
    }
private:
    ll x;
};
}
const ll mod = 1e9 + 7;
const std::size_t SIZE = 1e5 + 10;
using mint = math::Modint<mod>;
void calc(const vec<ll> &v, std::array<mint, SIZE> &dp) {
    dp[0] = 1;
    for (ll e : v) for (ll i = SIZE - 1 - e; 0 <= i; i--) dp[i + e] += dp[i];
}
mdarray<mint, 2, SIZE> dp;
int main() {
    ll n, m;
    std::cin >> n >> m;
    vec<ll> vv(n), rv(m);
    for (ll &e : vv) std::cin >> e;
    for (ll &e : rv) std::cin >> e;
    ll a, b;
    std::cin >> a >> b;
    calc(rv, dp[0]);
    calc(vv, dp[1]);
    std::array<mint, SIZE + 1> sum;
    sum[0] = 0;
    for (ll i = 0; i < SIZE; i++) sum[i + 1] = sum[i] + dp[1][i];
    mint ans = 0;
    for (ll i = 1; i < SIZE; i++) {
        ll minv = std::min<ll>(SIZE - 1, a * i);
        ll maxv = std::min<ll>(SIZE, b * i + 1);
        mint v = sum[maxv] - sum[minv];
        ans += v * dp[0][i];
    }
    std::cout << ans.value() << "\n";
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0