「BZOJ5312」冒险-线段树+势能分析

Description

一个长度为 $n$ 的序列 $a_i$,支持单点修改,区间与/或一个数,求区间最大值。

$n,m,a_i\le 200000$

Solution

设$\Phi (s)$为一个线段树节点的势能。$\Phi (s)$的值为其左右儿子的$\Phi$之和加上这个点所代表区间的数在多少个二进制位上不全相同。

设 K = m a x { a i } K=max\{a_i\} K=max{ai​}

每次操作时，如果当前操作对区间中所有数影响全相同则打加法标记，否则递归。考虑这样做对于$\Phi (root)$的影响，对于在线段树上定位到的区间，它们的势能增加了$logmax{a}_i$，而对于访问的额外节点，它们的势能至少减小了$1$。所以$\Phi (root)$的大小为$O((n+mlogn)logK)$，所以时间复杂度为$O((n+mlogn)logK)$。

#include <bits/stdc++.h>
using namespace std;

inline int gi()
{
	char c = getchar();
	while(c < '0' || c > '9') c = getchar();
	int sum = 0;
	while('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
	return sum;
}

const int maxn = 200005, S = (1 << 20) - 1;

int n, q, a[maxn];

int Max[maxn << 2], And[maxn << 2], Or[maxn << 2], tag[maxn << 2];

#define mid ((l + r) >> 1)
#define lch (s << 1)
#define rch (s << 1 | 1)

void pushdown(int s)
{
	static int v;
	if (!tag[s]) return ;
	v = tag[s];
	And[lch] += v; Or[lch] += v; Max[lch] += v; tag[lch] += v;
	And[rch] += v; Or[rch] += v; Max[rch] += v; tag[rch] += v;
	tag[s] = 0;
}

void build(int s, int l, int r)
{
	if (l == r) return Max[s] = a[l], And[s] = a[l], Or[s] = a[l], void();
	build(lch, l, mid);
	build(rch, mid + 1, r);
	Max[s] = max(Max[lch], Max[rch]);
	And[s] = And[lch] & And[rch];
	Or[s] = Or[lch] | Or[rch];
}

void modify1(int s, int l, int r, int ql, int qr, int v)
{
	//if (l == r) return Max[s] &= v, And[s] &= v, Or[s] |= v, void();
	if (ql <= l && r <= qr && ((And[s] & (S ^ v)) | ((S ^ Or[s]) & (S ^ v))) == (S ^ v)) {
		int x = And[s] & (S ^ v);
		And[s] -= x; Or[s] -= x; Max[s] -= x; tag[s] -= x;
		return ;
	}
	pushdown(s);
	if (ql <= mid) modify1(lch, l, mid, ql, qr, v);
	if (qr >= mid + 1) modify1(rch, mid + 1, r, ql, qr, v);
	Max[s] = max(Max[lch], Max[rch]);
	And[s] = And[lch] & And[rch];
	Or[s] = Or[lch] | Or[rch];
}

void modify2(int s, int l, int r, int ql, int qr, int v)
{
	//if (l == r) return Max[s] |= v, And[s] &= v, Or[s] |= v, void();
	if (ql <= l && r <= qr && ((And[s] & v) | ((S ^ Or[s]) & v)) == v) {
		int x = (S ^ Or[s]) & v;
		And[s] += x; Or[s] += x; Max[s] += x; tag[s] += x;
		return ;
	}
	pushdown(s);
	if (ql <= mid) modify2(lch, l, mid, ql, qr, v);
	if (qr >= mid + 1) modify2(rch, mid + 1, r, ql, qr, v);
	Max[s] = max(Max[lch], Max[rch]);
	And[s] = And[lch] & And[rch];
	Or[s] = Or[lch] | Or[rch];
}

int query(int s, int l, int r, int ql, int qr)
{
	if (ql <= l && r <= qr) return Max[s];
	pushdown(s);
	int res = 0;
	if (ql <= mid) res = max(res, query(lch, l, mid, ql, qr));
	if (qr >= mid + 1) res = max(res, query(rch, mid + 1, r, ql, qr));
	return res;
}

int main()
{
	freopen("adventure.in", "r", stdin);
	freopen("adventure.out", "w", stdout);

	n = gi(); q = gi();
	for (int i = 1; i <= n; ++i) a[i] = gi();
	
	build(1, 1, n);
	
	for (int op, x, y, i = 1; i <= q; ++i) {
		op = gi(); x = gi(); y = gi();
		if (op == 1) modify1(1, 1, n, x, y, gi());
		else if (op == 2) modify2(1, 1, n, x, y, gi());
		else printf("%d\n", query(1, 1, n, x, y));
	}
	
	return 0;
}