結果

問題 No.1172 Add Recursive Sequence
ユーザー rniyarniya
提出日時 2020-08-14 23:06:25
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 318 ms / 4,000 ms
コード長 6,852 bytes
コンパイル時間 2,136 ms
コンパイル使用メモリ 178,716 KB
実行使用メモリ 19,888 KB
最終ジャッジ日時 2024-04-18 22:59:16
合計ジャッジ時間 4,083 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
16,168 KB
testcase_01 AC 14 ms
16,044 KB
testcase_02 AC 13 ms
16,172 KB
testcase_03 AC 13 ms
16,296 KB
testcase_04 AC 13 ms
16,168 KB
testcase_05 AC 13 ms
16,304 KB
testcase_06 AC 16 ms
16,176 KB
testcase_07 AC 13 ms
16,180 KB
testcase_08 AC 15 ms
16,128 KB
testcase_09 AC 15 ms
16,048 KB
testcase_10 AC 23 ms
16,364 KB
testcase_11 AC 22 ms
16,304 KB
testcase_12 AC 25 ms
16,692 KB
testcase_13 AC 25 ms
16,628 KB
testcase_14 AC 80 ms
18,992 KB
testcase_15 AC 80 ms
19,888 KB
testcase_16 AC 318 ms
19,008 KB
testcase_17 AC 316 ms
19,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1e9+7;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

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;
}
#pragma endregion

template<uint_fast64_t Modulus> class modint{
    using u64=uint_fast64_t;
    public:
    u64 a;
    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) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        u64 exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    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 bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept{
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept{
        u64 a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

const int MAX=5e5+10;
vector<mint> fac(MAX),finv(MAX),inv(MAX);
void COMinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for (int i=2;i<MAX;++i){
        fac[i]=fac[i-1]*i;
        inv[i]=-inv[MOD%i]*(MOD/i);
        finv[i]=finv[i-1]*inv[i];
    }
}
mint COM(int n,int k){
    if (n<k||n<0||k<0) return 0;
    return fac[n]*finv[k]*finv[n-k];
}

// Be careful with the value of MAX and conducting COMinit()

const int MAX_N=1e5+10;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int K,N,M; cin >> K >> N >> M;
    vector<mint> A(K),c(K);
    for (int i=0;i<K;++i) cin >> A[i];
    for (int i=0;i<K;++i) cin >> c[i];
    for (int i=K;i<MAX_N;++i){
        mint sum=0;
        for (int j=1;j<=K;++j) sum+=A[i-j]*c[j-1];
        A.emplace_back(sum);
    }
    vector<vector<pair<int,int>>> query(2);
    for (int i=0;i<M;++i){
        int l,r; cin >> l >> r;
        query[(r-l<=K)].emplace_back(l,r);
    }
    sort(ALL(query[0]));
    vector<mint> ans(N,0),sub(N,0);
    int now=0;
    using P=pair<int,int>;
    priority_queue<P,vector<P>,greater<P>> pq;
    for (int i=0;i<N;++i){
        while(!pq.empty()&&pq.top().first==i){
            auto p=pq.top(); pq.pop();
            int r=p.first,l=p.second;
            for (int j=r-1,cnt=0;cnt<K;--j,++cnt) sub[j]-=A[r-1-l-cnt];
        }
        if (i>=K) for (int j=1;j<=K;++j) ans[i]+=sub[i-j]*c[j-1];
        sub[i]=ans[i];
        while(now<query[0].size()&&query[0][now].first+K-1==i){
            int l=query[0][now].first,r=query[0][now].second;
            for (int j=l;j<l+K;++j){
                ans[j]+=A[j-l];
                sub[j]+=A[j-l];
            }
            pq.emplace(r,l); ++now;
        }
    }
    for (auto p:query[1]){
        int l=p.first,r=p.second;
        for (int i=l;i<r;++i) ans[i]+=A[i-l];
    }
    for (int i=0;i<N;++i) cout << ans[i] << '\n';
}
0