【BZOJ5334】【TJOI2018】数学计算

【题目链接】

• 点击打开链接
  

【思路要点】

• 首先，直接用动态开点的线段树维护一下数集即可。
• 时间复杂度\(O(TQLogMod)\)。

【代码】

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int MAXP = 5e6 + 5;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); } 
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
template <typename T> void write(T x) {
	if (x < 0) x = -x, putchar('-');
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
struct SegmentTree {
	struct Node {
		int lc, rc;
		int prod, cnt;
	} a[MAXP];
	int root, size, P;
	void init(int x) {
		for (int i = 1; i <= size; i++) {
			a[i].lc = 0;
			a[i].rc = 0;
			a[i].cnt = 0;
			a[i].prod = 0;
		}
		P = x;
		root = size = 0;
		a[0].prod = 1;
	}
	void update(int root) {
		a[root].prod = 1ll * a[a[root].lc].prod * a[a[root].rc].prod % P;
	}
	int power(int x, int y) {
		if (y == 0) return 1;
		int tmp = power(x, y / 2);
		if (y % 2 == 0) return 1ll * tmp * tmp % P;
		else return 1ll * tmp * tmp % P * x % P;
	}
	void insert(int &root, int l, int r, int pos) {
		if (root == 0) root = ++size;
		if (l == r) {
			a[root].cnt++;
			a[root].prod = power(l, a[root].cnt);
			return;
		}
		int mid = (l + r) / 2;
		if (mid >= pos) insert(a[root].lc, l, mid, pos);
		else insert(a[root].rc, mid + 1, r, pos);
		update(root);
	}
	void insert(int val) {
		insert(root, 0, P - 1, val);
	}
	void del(int &root, int l, int r, int pos) {
		if (root == 0) root = ++size;
		if (l == r) {
			a[root].cnt--;
			a[root].prod = power(l, a[root].cnt);
			return;
		}
		int mid = (l + r) / 2;
		if (mid >= pos) del(a[root].lc, l, mid, pos);
		else del(a[root].rc, mid + 1, r, pos);
		update(root);
	}
	void del(int val) {
		del(root, 0, P - 1, val);
	}
	int query() {
		return a[root].prod;
	}
} ST;
int n, P;
int opt[MAXN], x[MAXN];
int main() {
	int T; read(T);
	while (T--) {
		read(n), read(P);
		ST.init(P);
		for (int i = 1; i <= n; i++) {
			read(opt[i]), read(x[i]);
			if (opt[i] == 1) ST.insert(x[i] % P);
			else ST.del(x[x[i]] % P);
			writeln(ST.query() % P);
		}
	}
	return 0;
}