結果

問題 No.1172 Add Recursive Sequence
コンテスト
ユーザー minato
提出日時 2020-08-14 23:59:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 184 ms / 4,000 ms
コード長 4,610 bytes
コンパイル時間 3,407 ms
コンパイル使用メモリ 248,256 KB
最終ジャッジ日時 2025-01-13 00:48:12
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////

template <uint_fast64_t Modulus> 
struct ModInt {
    using u64 = uint_fast64_t;

    u64 a;

    constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % 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 long long rhs) const noexcept {return ModInt(*this) ^= rhs;}
    constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}
    constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}
    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&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }
    constexpr ModInt &operator^=(long long exp) noexcept {
        ModInt rhs = a;
        a = 1;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }

    friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}
    friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}
};

using mint = ModInt<MOD>;

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int K,N,M; cin >> K >> N >> M;
    vector<mint> A(N+K+1),c(K);
    rep(i,K) cin >> A[i];
    rep(i,K) cin >> c[i];
    for (int i = K; i <= N+K; i++) {
        for (int j = 1; j <= K; j++) {
            A[i] += c[j-1]*A[i-j];
        }
    }

    vector<mint> x(N+K+1);
    vector<pii> R,Range;
    vector<int> Z;
    rep(i,M) {
        int l,r; cin >> l >> r;
        if (r-l <= K) {
            Range.emplace_back(l,r);
        } else {
            Z.emplace_back(l+K);
            R.emplace_back(r+K,r-l);
        }
    }
    sort(all(Z));
    sort(all(R));
    int S = R.size();
    int T = Z.size();
    int curs = 0;
    int curz = 0;
    for (int i = K; i <= N+K; i++) {
        while (curz < T and Z[curz]==i) {
            for (int j = i-K; j < i; j++) {
                x[j] += A[j-(i-K)];
            }
            curz++;
        }
        while (curs < S and R[curs].first==i) {
            for (int j = i-K; j < i; j++) {
                x[j] -= A[R[curs].second+j-(i-K)];
            }
            curs++;
        }
        for (int j = 1; j <= K; j++) {
            x[i] += c[j-1]*x[i-j];
        }
    }
    for (auto i : Range) {
        auto[l,r] = i;
        for (int j = l; j < r; j++) {
            x[j] += A[j-l];
        }
    }
    
    rep(i,N) print(x[i]);
}
0