#475678 (C++17) No.1043 直列大学

提出ソース

結果

問題	No.1043 直列大学
ユーザー	ganariya
提出日時	2020-05-03 08:37:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	377 ms / 2,000 ms
コード長	11,198 bytes
コンパイル時間	1,856 ms
コンパイル使用メモリ	156,380 KB
実行使用メモリ	326,872 KB
最終ジャッジ日時	2024-12-22 20:04:25
合計ジャッジ時間	9,063 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	18 ms 20,380 KB
testcase_01	AC	15 ms 17,412 KB
testcase_02	AC	31 ms 29,936 KB
testcase_03	AC	16 ms 17,280 KB
testcase_04	AC	15 ms 17,280 KB
testcase_05	AC	15 ms 17,280 KB
testcase_06	AC	14 ms 17,408 KB
testcase_07	AC	22 ms 23,480 KB
testcase_08	AC	22 ms 23,480 KB
testcase_09	AC	200 ms 170,464 KB
testcase_10	AC	231 ms 201,908 KB
testcase_11	AC	344 ms 300,192 KB
testcase_12	AC	377 ms 326,872 KB
testcase_13	AC	312 ms 273,824 KB
testcase_14	AC	325 ms 289,392 KB
testcase_15	AC	361 ms 315,916 KB
testcase_16	AC	322 ms 283,188 KB
testcase_17	AC	240 ms 209,516 KB
testcase_18	AC	237 ms 209,564 KB
testcase_19	AC	305 ms 267,400 KB
testcase_20	AC	236 ms 204,924 KB
testcase_21	AC	281 ms 247,116 KB
testcase_22	AC	293 ms 258,040 KB
testcase_23	AC	371 ms 323,644 KB
testcase_24	AC	265 ms 229,968 KB
testcase_25	AC	309 ms 270,600 KB
testcase_26	AC	335 ms 289,448 KB
testcase_27	AC	166 ms 145,448 KB
testcase_28	AC	308 ms 267,340 KB
testcase_29	AC	104 ms 92,312 KB
testcase_30	AC	232 ms 203,384 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <chrono>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <cassert>
#include <type_traits>

using namespace std;

// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;

// container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr) for(typeof((arr).begin()) i=(arr).begin(); i!=(arr).end(); ++i)
#define EXIST(str, e) ((str).find(e)!=(str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin()+(c), (arr).end())
#define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second


// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() std::ios::sync_with_stdio(false);std::cin.tie(0)
#define OUT(d) std::cout<<(d)
#define OUT_L(d) std::cout<<(d)<<endl
#define FOUT(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)
#define FOUT_L(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)<<"\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v) {std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yay() printf("Yay!\n")
#define Nnn() printf(":(\n")
#define CE(x, y) ((x + y - 1) / (y))


template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}

template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "\n";
    return out;
}

template<class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


//repetition
//------------------------------------------
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n)  FOR(i,0,n)
#define RREP(i, n) for(int i = n-1;i >= 0;i--)
#define FORLL(i, a, b) for(LL i=LL(a);i<LL(b);++i)
#define RFORLL(i, a, b) for(LL i=LL(b)-1;i>=LL(a);--i)
#define REPLL(i, n) for(LL i=0;i<LL(n);++i)
#define RREPLL(i, n) for(LL i=LL(n)-1;i>=0;--i)
#define FOREACH(x, arr) for(auto &(x) : (arr))

// Option + Control + K  Terminal
// Command + Control + K    Run
// Command + b   EOF

void OutputCase(int t) {
    cout << "Case #" << t << ": ";
}


//------------------------------------------
//------------------------------------------

template<typename T>
class CulSum {
private:
    long long N;
    vector<T> a;
    vector<T> aa;
    vector<T> b;
    vector<T> bb;

    function<T(T, T)> func;

public:

    /// @param a original array
    CulSum(vector<T> _a) {
        N = _a.size();
        a = _a;
        b = _a;
        reverse(b.begin(), b.end());
        this->aa = vector<T>(N + 1, T{});
        this->bb = vector<T>(N + 1, T{});
        for (int i = 0; i < N; i++) aa[i + 1] = a[i] + aa[i];
        for (int i = 0; i < N; i++) bb[i + 1] = b[i] + bb[i];
    }

    /// @param a original array
    CulSum(vector<T> _a, function<T(T, T)> func) : func(func) {
        N = _a.size();
        a = _a;
        b = _a;
        reverse(b.begin(), b.end());
        this->aa = vector<T>(N + 1, T{});
        this->bb = vector<T>(N + 1, T{});
        for (int i = 0; i < N; i++) aa[i + 1] = func(a[i], aa[i]);
        for (int i = 0; i < N; i++) bb[i + 1] = func(b[i], bb[i]);
    }

    /// @brief 0-index original
    /// @param l original close
    /// @param r original open
    T get_sum(int l, int r) {
        return aa[r] - aa[l];
    }

    /// @brief 0-index original
    /// @param l original close
    /// @param r original open
    T get_sum_reverse(int l, int r) {
        l = N - l;
        r = N - r;
        return bb[l] - bb[r];
    }

    /// @brief 0-index original
    /// @param k length
    T get_sum_lead_k_len(int k) {
        return get_sum(0, k);
    }

    /// @brief 0-index original
    /// @param k length
    T get_sum_tail_k_len(int k) {
        return get_sum_reverse(N - k, N);
    }

    void show() {
        for (int i = 0; i < N + 1; i++) cout << aa[i] << " ";
        cout << endl;
    }

    void show_reverse() {
        for (int i = N; i >= 0; i--) cout << bb[i] << " ";
        cout << endl;
    }

};

template<int_fast64_t Modulas = 1000000007ul>
class ModInt {
    using u64 = int_fast64_t;
public:
    u64 x;

    constexpr ModInt() : x(0) {}
    constexpr ModInt(int_fast64_t v) : x((v % Modulas + Modulas) % Modulas) {}
    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 long long rhs) const noexcept {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt operator+=(const ModInt rhs) noexcept {
        x += rhs.x;
        if (x >= Modulas) x -= Modulas;
        return *this;
    }
    constexpr ModInt operator+=(const long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) += hs;
        return *this;
    }
    constexpr ModInt operator-=(const ModInt rhs) noexcept {
        if (x < rhs.x) x += Modulas;
        x -= rhs.x;
        return *this;
    }
    constexpr ModInt operator-=(const long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) -= hs;
        return *this;
    }
    constexpr ModInt operator*=(const ModInt rhs) noexcept {
        x = x * rhs.x % Modulas;
        return *this;
    }
    constexpr ModInt operator*=(const long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) *= hs;
        return *this;
    }
    constexpr ModInt &operator/=(ModInt rhs) noexcept {
        u64 exp = Modulas - 2;
        while (exp > 0) {
            if (exp & 1ul) *this *= rhs;
            rhs *= rhs;
            exp >>= 1ul;
        }
        return *this;
    }
    constexpr ModInt &operator/=(long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) /= hs;
        return *this;
    }

    constexpr ModInt &operator++() noexcept {
        x++;
        if (x >= Modulas) x -= Modulas;
        return *this;
    }
    constexpr ModInt &operator--() noexcept {
        if (x == 0) x += Modulas;
        x--;
        return *this;
    }
    constexpr bool operator<(const ModInt rhs) const noexcept {
        return x < rhs.x;
    }
    constexpr bool operator==(const ModInt rhs) const noexcept {
        return this->x == rhs.x;
    }
    constexpr bool operator!=(const ModInt rhs) const noexcept {
        return !(*this == rhs);
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        in >> m.x;
        if (m.x < 0) m.x += Modulas;
        m.x %= Modulas;
        return in;
    }
    friend ostream &operator<<(ostream &out, const ModInt &p) {
        out << p.x;
        return out;
    }
    constexpr ModInt pow(u64 p) const {
        ModInt ret(1);
        ModInt mul(x);
        while (p > 0) {
            if (p & 1ul) ret *= mul;
            mul *= mul;
            p >>= 1ul;
        }
        return ret;
    }
    constexpr ModInt operator~() const noexcept {
        u64 exp = Modulas - 2;
        return pow(exp);
    }

    constexpr static ModInt arith_sum(ModInt<Modulas> a, ModInt<Modulas> d, ModInt<Modulas> n) noexcept {
        return (a * ModInt<Modulas>(2) + (n - 1) * d) * n / ModInt<Modulas>(2);
    }
};

constexpr int MAX = 200010;

int main() {

    LL N, M;
    cin >> N >> M;

    VLL V(N), R(M);
    cin >> V >> R;

    LL A, B;
    cin >> A >> B;

    auto f = [&](int D, VLL a) {
        vector<vector<ModInt<>>> dp(D + 1, vector<ModInt<>>(MAX + 1, 0));
        dp[0][0] = 1;

        for (int i = 0; i < D; i++) {
            for (int j = 0; j < MAX; j++) {
                dp[i + 1][j] += dp[i][j];
                int to = j + a[i];
                if (to < MAX) {
                    dp[i + 1][to] += dp[i][j];
                }
            }
        }

        return dp;
    };

    auto dp_v = f(N, V);
    auto dp_r = f(M, R);

    CulSum<ModInt<>> cul_sum(dp_v[N]);

    ModInt<> ans = 0;
    for (LL x = 1; x < MAX; x++) {
        LL l = A * x;
        LL r = B * x;
        if (l > MAX) continue;
        ans += dp_r[M][x] * cul_sum.get_sum(l, min<LL>(r + 1, MAX + 1));
    }

    cout << ans << endl;

    return 0;
}

yukicoder

結果

テストケース

ソースコード