結果

問題 No.1043 直列大学
ユーザー qLethonqLethon
提出日時 2020-05-01 22:47:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,626 bytes
コンパイル時間 2,383 ms
コンパイル使用メモリ 209,504 KB
実行使用メモリ 163,612 KB
最終ジャッジ日時 2024-06-07 11:08:51
合計ジャッジ時間 6,155 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
10,360 KB
testcase_01 AC 8 ms
8,684 KB
testcase_02 AC 14 ms
14,888 KB
testcase_03 AC 8 ms
8,808 KB
testcase_04 AC 8 ms
8,804 KB
testcase_05 AC 8 ms
8,812 KB
testcase_06 AC 8 ms
8,808 KB
testcase_07 AC 11 ms
11,848 KB
testcase_08 AC 11 ms
11,912 KB
testcase_09 AC 85 ms
85,372 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 166 ms
163,612 KB
testcase_13 RE -
testcase_14 WA -
testcase_15 AC 158 ms
158,316 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 RE -
testcase_19 RE -
testcase_20 WA -
testcase_21 RE -
testcase_22 RE -
testcase_23 AC 163 ms
162,056 KB
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

template <std::uint_fast64_t Modulus> class modint {
    using u64 = std::uint_fast64_t;
    u64 a;

    public:

    template <class INT>
    constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % Modulus + Modulus) {}
    constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
    constexpr u64 &value() noexcept { return a; }
    constexpr const u64 &value() const noexcept { return a; }
    constexpr modint operator+(const modint rhs) const noexcept {
        return modint(*this) += rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept {
        return modint(*this) -= rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept {
        return modint(*this) *= rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept {
        return modint(*this) /= rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr modint &operator-=(const modint rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr modint &operator*=(const modint rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr modint &operator/=(modint rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
        rhs *= rhs;
        exp /= 2;
        }
        return *this;
    }

    constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}
    constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}
    constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}
    constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}
    constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}
    constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}

    constexpr modint& operator++() noexcept {
        *this += modint(1);
        return *this;
    }
    constexpr modint operator++(int) noexcept {
        modint tmp(*this);
        ++(*this);
        return tmp;
    }
    constexpr modint& operator--() noexcept {
        *this -= modint(1);
        return *this;
    }
    constexpr modint operator--(int) noexcept {
        modint tmp(*this);
        --(*this);
        return tmp;
    }
    constexpr modint operator-() const noexcept {
        return modint(0) - *this;
    }

    template <std::uint_fast64_t M>
    friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {
        os << rhs.a;
        return os;
    }
    template <std::uint_fast64_t M>
    friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {
        int64_t tmp;
        is >> tmp;
        rhs = modint(tmp);
        return is;
    }

    constexpr modint pow(const u64 k) const noexcept {
        if (k == 0)
            return 1;
        if (k % 2 == 0){
            modint res = pow(k / 2);
            return res * res;
        }
        return pow(k - 1) * modint(*this);
    }

    template <typename T>
    operator const T (){return a;}
};

int main(){
    const constexpr int64_t p = 1e9 + 7;
    using mint = modint<p>;
    int n, m;
    cin >> n >> m;
    vector<int> V(n), R(m);
    copy_n(istream_iterator<int>(cin), n, V.begin());
    copy_n(istream_iterator<int>(cin), n, R.begin());
    int a, b;
    cin >> a >> b;

    const int sup = 1e5;
    vector<vector<mint>> DPV(n + 1, vector<mint>(sup + 1)), DPR(m + 1, vector<mint>(sup + 1));
    DPV[0][0] = 1;
    DPR[0][0] = 1;

    for (int i = 0; i < n; i++){
        for (int j = 0; j <= sup; j++){
            DPV[i + 1][j] += DPV[i][j];
            DPV[i + 1][j + V[i]] += DPV[i][j];
        }
    }

    for (int i = 0; i < m; i++){
        for (int j = 0; j <= sup; j++){
            DPR[i + 1][j] += DPR[i][j];
            DPR[i + 1][j + R[i]] += DPR[i][j];
        }
    }

    mint ans = 0;
    vector<mint> SV(sup + 2), SR(sup + 2);
    for (int i = 0; i <= sup; i++){
        SV[i + 1] = SV[i] + DPV[n][i];
        SR[i + 1] = SR[i] + DPR[m][i];
    }

    for (int64_t r = 0; r <= sup; r++){
        int64_t l = a * r, right = b * r;
        if (sup < l)
            break;
        ans += DPR[m][r] * (SV[min(int64_t(sup) + 1, right + 1)] - SV[l]);
    }
    cout << ans - mint(1) << endl;
}
0