#1169678 (C++17) No.3492 区間冪乗加算一点取得

• 問題: No.3492 区間冪乗加算一点取得
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-06-25 22:38:58
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 4,794 bytes
• コンパイル時間: 2,971 ms
• コンパイル使用メモリ: 226,428 KB
• 実行使用メモリ: 69,112 KB
• 最終ジャッジ日時: 2026-06-25 22:39:27
• 合計ジャッジ時間: 16,059 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_1

ファイルパターン	結果
other	AC * 13 WA * 14

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll B;

struct S{
    ll val;
    ll size;
};

S op(S a, S b){
    return S{(a.val + b.val) % B, a.size + b.size};
}

S e(){
    return S{0LL, 0LL};
}

S mapping(ll f, S x){
    return S{(x.val + f * x.size) % B, x.size};
}

ll composition(ll f, ll g){
    return (f + g) % B;
}

ll id(){
    return 0LL;
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

int main() {
    ll N, Q;
    cin >> N >> B >> Q;
    vector<ll> L(Q);
    vector<ll> M(Q);
    vector<ll> R(Q);
    vector<ll> C(Q);
    vector<ll> D(Q);
    for (ll i = 0; i < Q; i++){
        cin >> L[i] >> M[i] >> R[i] >> C[i] >> D[i];
        L[i]--;
        M[i]--;
        R[i]--;
    }
    ll LEN = 101;
    vector<lazy_segtree<S, op, e, ll, mapping, composition, id>> vec(LEN);
    for (ll i = 0; i < LEN; i++){
        vec[i] = lazy_segtree<S, op, e, ll, mapping, composition, id>(N);
        for (ll j = 0; j < N; j++){
            vec[i].set(j, S{0, 1});
        }
    }

    vector<vector<ll>> comb(LEN, vector<ll>(LEN));
    rep(i, LEN){
        comb[i][0] = 1;
        comb[i][i] = 1;
    }
    for (ll i = 1; i < LEN; i++){
        for (ll j = 1; j < i; j++){
            comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % B;
        }
    }

    for (ll i = 0; i < Q; i++){
        for (ll j = 0; j <= D[i]; j++){
            ll coef_val = (my_pow(C[i], D[i] - j, B) * comb[D[i]][j]) % B;
            vec[j].apply(L[i], R[i] + 1, coef_val);
        }
        ll ans = 0;
        for (ll j = 0; j < LEN; j++){
            ll coef_val = (my_pow(M[i] + 1, j, B) * vec[j].get(M[i]).val) % B;
            ans += coef_val;
            ans %= B;
        }
        cout << ans << endl;
    }
}