2021CCPC东北四省赛 D. Lowbit 势能线段树

传送门

分析

分析一下$x+lowbit(x)$这个操作
如果多次操作之后，那么$x$中只会有最高位存在一，这个时候再执行一次操作就会使整个数字乘二
所以，我们可以在线段树上给每个区间打上标记，标记这个区间是否可以直接乘二进行修改即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 998244353;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int n,a[N],m;

struct Node{
	int l,r;
	ll sum,add;
	bool flag;
}tr[N * 4];

ll lowbit(ll x){
	return x & -x;
}

ll ksm(ll x,ll y,ll z = mod){
    ll ans=1,base=x;
    while(y){
        if(y&1)ans*=base,ans%=z;
        base*=base;base%=z;
        y>>=1;
    }
    return ans;
}

void push(int u){
	tr[u].sum = (tr[u << 1].sum + tr[u << 1 | 1].sum) % mod;
	tr[u].flag = tr[u << 1].flag && tr[u << 1 | 1].flag;
}

void down(int u){
	if(tr[u].add){
		ll &k = tr[u].add;
		ll p = ksm(2,k);
		tr[u << 1].sum = tr[u << 1].sum * p % mod;
		tr[u << 1 | 1].sum = tr[u << 1 | 1].sum * p % mod;
		tr[u << 1].add += k;
		tr[u << 1 | 1].add += k;
		k = 0;
	}
}

void build(int u,int l,int r){
	tr[u] = {l,r,0,0,0};
	if(l == r){
		tr[u].sum = a[l];
		if(tr[u].sum == lowbit(tr[u].sum)) tr[u].flag = 1;
		return;
	}
	int mid = (l + r) >> 1;
	build(u << 1,l,mid),build(u << 1 | 1,mid + 1,r);
	push(u);
}

void modify(int u,int l,int r){
	if(tr[u].l >= l && tr[u].r <= r && tr[u].flag){
		tr[u].sum = tr[u].sum * 2 % mod;
		tr[u].add++;
		return;
	}
	if(tr[u].l == tr[u].r){
		tr[u].sum += lowbit(tr[u].sum);
		if(tr[u].sum == lowbit(tr[u].sum)) tr[u].flag = 1;
		return;
	}
	down(u);
	int mid = (tr[u].l + tr[u].r) >> 1;
	if(l <= mid) modify(u << 1,l,r);
	if(r > mid) modify(u << 1 | 1,l,r);
	push(u);
}

ll query(int u,int l,int r){
	if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
	down(u);
	ll ans = 0;
	int mid = (tr[u].l + tr[u].r) >> 1;
	if(l <= mid) ans = query(u << 1,l,r);
	if(r > mid) ans = (ans + query(u << 1 | 1,l,r)) % mod;
	return ans;
}

int main() {
	int T;
	read(T);
	while(T--){
		read(n);
		for(int i = 1;i <= n;i++) read(a[i]),a[i] %= mod;
		build(1,1,n);
		read(m);
		while(m--){
			int op,l,r;
			read(op),read(l),read(r);
			if(op == 1) modify(1,l,r);
			else {dl(query(1,l,r));}
		}
	}
	return 0;
}