#1168581 (C++17) No.3565 Take from Excluded

• 問題: No.3565 Take from Excluded
• ユーザー: GOTKAKO
• 提出日時: 2026-06-07 15:59:59
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 81 ms / 2,000 ms
• コード長: 4,582 bytes
• コンパイル時間: 1,640 ms
• コンパイル使用メモリ: 223,452 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-06-07 16:00:04
• 合計ジャッジ時間: 3,967 ms
• ジャッジサーバーID （参考情報）: judge3_1 / judge1_1

ファイルパターン	結果
sample	AC * 2
other	AC * 15 WA * 3

ソースコード

#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 main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,q; cin >> N >> q;
    if(N*q > 9'000'000) return 0;
    deque<long long> Q;
    vector<int> A(N);
    for(auto &a : A) cin >> a;
    sort(A.begin(),A.end());
    A.erase(unique(A.begin(),A.end()),A.end());
    N = A.size();
    mint low = A.at(0)%mod;
    int streak = 1;
    for(int i=1; i<N; i++){
        if(A.at(i)-A.at(i-1) == 1) streak++;
        else{
            Q.push_back(streak);
            Q.push_back(A.at(i)-A.at(i-1)-1);
            streak = 1;
        }       
    }
    Q.push_back(streak);

    auto ope = [&](long long M) -> void {
        low += Q.front()%mod; Q.pop_front();
        long long sum = 0;
        for(int i=0; i<Q.size(); i+=2) sum += Q.at(i);
        while(sum > M){
            if(Q.size()%2) sum -= Q.back();
            Q.pop_back();
        }        
        long long more = M-sum;
        if(more){
            if(Q.size()%2) Q.back() += more;
            else Q.push_back(more);
        }
    };

    while(q--){
        long long K,M,X; cin >> K >> X >> M,X--;
        if(K) ope(M),K--; 
        if(K) ope(M),K--;
        if(K){
            long long left = M;
            for(int i=1; i<Q.size(); i+=2) left -= Q.at(i);
            assert(left >= 0);
            if(Q.size()%2 == 0) Q.back() += left;
            else if(left) Q.push_back(left);

            int n = Q.size();
            long long loop = K/n%mod; K %= n;
            mint sum = 2*M%mod;
            low += sum*loop;
            while(K--){
                long long v = Q.front();
                low += v;
                if(Q.size()%2) Q.back() += v;
                else if(v) Q.push_back(v);
                Q.pop_front();
            }    
        }
        mint answer = low;
        for(int i=0; i<Q.size(); i++){
            long long v = Q.at(i);
            if(i%2 == 0){
                if(X < v){cout << answer+X << "\n"; break;}
                X -= v,answer += v;
            }
            else answer += v;
        }
    }
}