牛客小白月赛39D - 绝望（数论 + 数学规律 + 数据结构）

//====================
#define int LL
const int N	= 1e6 + 7;
#define lk k << 1
#define rk k << 1 | 1
struct node{
	int l, r, w, one;
}tre[4 * N];
int n, q;
//====================
vector<int> prime;
map<int, int> mp; int v[N];
void Force() {
	int n = N - 5;
	for(int i = 2; i <= n; i ++) {
        if(v[i] == 0) {
            v[i] = i;
            prime.push_back(i);  
        }
        for (auto it : prime) {
        	if (it > v[i] || it > n / i) break;
        	v[i * it] = it;
        }
    }
    for (auto it : prime) mp[it] = 1;
}
void update(int k) {
	tre[k].w = tre[lk].w + tre[rk].w;
	tre[k].one = tre[lk].one | tre[rk].one;
}
void build(int l, int r, int k) {
	tre[k].l = l, tre[k].r = r;
	if (l == r) {
		int x; cin >> x;
		if (x == 1) tre[k].one = 1;
		tre[k].w = mp[x];
		return;
	}
	int m = (tre[k].l + tre[k].r) >> 1;
	build(l, m, lk), build(m + 1, r, rk);
	update(k);
}
int finds(int l, int r, int k) {
	if (l <= tre[k].l && tre[k].r <= r) return tre[k].w;
	int ans = 0;
	int m = (tre[k].l + tre[k].r) >> 1;
	if (l <= m) ans += finds(l, r, lk);
	if (m < r) ans += finds(l, r, rk);
	return ans;
}
void change_point(int l, int r, int x, int k) {
	if (x == 0) return;
	if (tre[k].w == 0 && tre[k].one == 0) return;
	if (tre[k].l == tre[k].r) { //单点修改
		int num = tre[k].l;
		if (num == 1) return;
		if (x == 1 && tre[k].one == 1 && mp[num] == 1) {
			tre[k].one = 0;
			tre[k].w = 1;
			return;
		}
		tre[k].one = tre[k].w = 0;
		return;
	}
	int m = (tre[k].l + tre[k].r) >> 1;
	if (l <= m) change_point(l, r, x, lk);
	if (m < r) change_point(l, r, x, rk);
	update(k);
}
void Solve() {
	cin >> n >> q;
	build(1, n, 1);
	for (int i = 1; i <= q; ++ i) {
		int op; cin >> op;
		if (op == 2) {
			int l, r; cin >> l >> r;
			cout << finds(l, r, 1) << endl;
		}else {
			int l, r, x; cin >> l >> r >> x;
			change_point(l, r, x, 1);
			cout << finds(l, r, 1) << endl;
		}
	}
}