結果

問題 No.2215 Slide Subset Sum
ユーザー GOTKAKO
提出日時 2025-10-05 08:52:44
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 791 ms / 3,000 ms
コード長 5,284 bytes
コンパイル時間 7,032 ms
コンパイル使用メモリ 204,864 KB
実行使用メモリ 326,640 KB
最終ジャッジ日時 2025-10-05 08:53:18
合計ジャッジ時間 30,626 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

//入力が必ず-mod<=a<modの時.
template<const int mod> //mod<2^30.
struct modint{ //mod変更が不可能.
    public:
    long long v;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint():v(0){}
    template<typename T>
    modint(T a):v(a){if(v < 0) v += mod;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint &operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint &operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint &operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint &operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint &operator/=(modint b){ //b!=0 mod素数が必須.
        assert(b.v != 0);
        (*this) *= b.pow(mod-2);
        return *this;
    }
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return pow(mod-2);} //素数mod必須.
 
    modint &operator++(){*this += 1; return *this;}
    modint &operator--(){*this -= 1; return *this;}
    modint operator++(int){modint ret = *this; *this += 1; return ret;}
    modint operator--(int){modint ret = *this; *this -= 1; return ret;}
    friend bool operator==(const modint a,const modint b){return a.v==b.v;}
    friend bool operator!=(const modint a,const modint b){return a.v!=b.v;}
    friend bool operator<(const modint a,const modint b){return a.v<b.v;}
    friend bool operator<=(const modint a,const modint b){return a.v<=b.v;}
    friend bool operator>=(const modint a,const modint b){return a.v>=b.v;}
    friend bool operator>(const modint a,const modint b){return a.v>b.v;}
    friend ostream &operator<<(ostream &os,const modint a){return os<<a.v;}
    friend istream &operator>>(istream &is,modint &a){ //入力はmodをとってくれる.
        long long x; is >> x; x %= mod;
        a = modint(x); return is;
    }
};
using mint = modint<998244353>; const long long mod = 998244353;

int K;
struct SS{mint x,v[100];}E;
class SWAG{ //[Li,Ri),モノイド,Li<=Li+1,Ri<=Ri+1ならOK.
    private:
    int L,R;
    stack<pair<SS,SS>> Front,Back; //frontには(1,op123),(2,op23),(3,op3)] back[(1,op1),(2,op12),(3,op123).
    SS op(SS a, SS b){
        SS ret = E; ret.v[0] = 0;
        int ca = 0,cb = 0;
        for(int i=0; i<K; i++) ca += a.v[i]!=0,cb += b.v[i]!=0;
        if(ca <= cb){
            for(int i=0; i<K; i++) if(a.v[i] != 0){
                for(int k=0; k<K; k++) if(b.v[k] != 0) ret.v[(i+k)%K] += a.v[i]*b.v[k];
            }
        } 
        else{
            for(int i=0; i<K; i++) if(b.v[i] != 0){
                for(int k=0; k<K; k++) if(a.v[k] != 0) ret.v[(i+k)%K] += b.v[i]*a.v[k];
            }
        }
        return ret;
    } //ここの計算量が全てにかかる.
    SS e(){return E;}

    public:
    SWAG():L(0),R(0){}
    void push(const SS &x){ //O(1).
        R++;
        if(Back.size()) Back.emplace(pair{x,op(Back.top().second,x)});
        else Back.emplace(pair{x,x});
    }
    void pop(){ //ならしO(1) 全体でO(n). 
        L++;
        if(Front.size()){Front.pop(); return;}
        assert(Back.size()); //要素数0.
        while(Back.size() > 1){//popする際backを"全て"frontに移動.
            SS x = Back.top().first; Back.pop();
            if(Front.size()) Front.emplace(pair{x,op(x,Front.top().second)});
            else Front.emplace(pair{x,x});
        }
        Back.pop();
    }
    SS val(){ //Front先頭second,Back先頭secondの2要素をマージするだけ O(1).
        if(Front.size() && Back.size()) return op(Front.top().second,Back.top().second);
        else if(Front.size()) return Front.top().second;
        else if(Back.size()) return Back.top().second;
        return e();
    }
    mint query(){
        if(Front.size() && Back.size()){
            mint ret = 0;
            ret += Front.top().second.v[0]*Back.top().second.v[0];
            for(int i=1; i<K; i++) ret += Front.top().second.v[i]*Back.top().second.v[K-i];
            return ret;
        }
        else if(Front.size()) return Front.top().second.v[0];
        else if(Back.size()) return Back.top().second.v[0];
        return 0;
    }
    pair<int,int> LR(){return {L,R};} //現在のLR確認.
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 
    for(int i=0; i<100; i++) E.v[i] = 0;
    E.x = 0,E.v[0] = 1;

    int N,M; cin >> N >> M >> K;
    SWAG Q;
    for(int i=0; i<M-1; i++){
        int a; cin >> a;
        SS s = E; s.x = a,s.v[a]++;
        Q.push(s);
    }
    for(int i=M-1; i<N; i++){
        int a; cin >> a;
        SS s = E; s.x = a,s.v[a]++;
        Q.push(s);
        cout << Q.query()-1 << "\n",Q.pop();
    }
}
0