洛谷P4588 [TJOI2018]数学计算(线段树)

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
int mod;
template<typename A, typename B> inline A mul(A x, B y) {
    return 1ll * x * y % mod;
}
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int Q, a[MAXN];
int sum[MAXN], val[MAXN];
#define ls k << 1
#define rs k << 1 | 1
#define lson ls, l, mid
#define rson rs, mid + 1, r
void update(int k) {
    sum[k] = mul(sum[ls], sum[rs]);
}
void Build(int k, int l, int r) {
    sum[k] = 1; 
    if(l == r) return ;
    int mid = l + r >> 1;
    Build(lson); Build(rson);
    update(k);
}
void Modify(int k, int l, int r, int p, int v) {
    if(l == r) {sum[k] = v; return ;}
    int mid = l + r >> 1;
    if(p <= mid) Modify(lson, p, v);
    else Modify(rson, p, v);
    update(k);
}
int Query(int k, int l, int r, int ql, int qr) {
    if(ql > qr) return 1;
    if(ql <= l && r <= qr) return sum[k];
    int mid = l + r >> 1;
    if(ql > mid) return Query(rson, ql, qr);
    else if(qr <= mid) return Query(lson, ql, qr);
    else return mul(Query(lson, ql, qr), Query(rson, ql, qr));
}
void solve() {
    Q = read(); mod = read();
    Build(1, 1, Q);
    int X = 1; val[0] = 1;
    for(int i = 1; i <= Q; i++) {
        int opt = read(); a[i] = read();
        if(opt == 1) X = mul(X, a[i]), Modify(1, 1, Q, i, a[i]);
        else {
            Modify(1, 1, Q, a[i], 1);
            X = Query(1, 1, Q, 1, i);
        }
        cout << X << '\n';
    }   
}
signed main() {
//  freopen("a.in", "r", stdin);
    for(int T = read(); T--; solve());

    return 0;
}