The 2019 Asia Nanchang First Round Online Programming Contest I. Yukino With Subinterval CDQ分治

 https://nanti.jisuanke.com/t/41356

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<cstring>
#include<set>
#include<iterator>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<cmath>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<iomanip>
//#include<unordered_set>
using namespace std;
#define lowbit(x) x&(-x)
typedef long long ll;
typedef pair<int, int> P;
const int N = 2e5 + 10;
const int M = 2e6 + 10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
int n, m;
struct Node
{
	int op, x1, y1, y2, id, val;
	Node(int op = 0, int x1 = 0, int y1 = 0, int y2 = 0, int id = 0, int val = 0) :op(op), x1(x1), y1(y1), y2(y2), id(id), val(val) {}
}o[5 * N], temp[5 * N];
int a[N], b[N];
int c[N];
void update(int x, int val)
{
	for (int i = x; i <= n; i += lowbit(i))
	{
		c[i] += val;
	}
}
int ask(int x)
{
	int sum = 0;
	for (int i = x; i; i -= lowbit(i))
	{
		sum += c[i];
	}
	return sum;
}
int ans[N];
void cdq(int l, int r)
{
	// cout << l << " " << r << endl;
	if (l == r)
		return;
	int m = (l + r) >> 1;
	cdq(l, m);
	cdq(m + 1, r);
	int p = l, q = m + 1, cnt = p;
	for (; q <= r; q++)
	{
		while (p <= m && o[p].x1 <= o[q].x1)
		{
			if (o[p].op == 1)
				update(o[p].y1, o[p].val);
			temp[cnt++] = o[p++];
		}
		temp[cnt++] = o[q];
		if (o[q].op == 2)
		{

			ans[o[q].id] -= ask(o[q].y2) - ask(o[q].y1 - 1);
		}
		else if (o[q].op == 3)
		{

			ans[o[q].id] += ask(o[q].y2) - ask(o[q].y1 - 1);
		}
	}
	for (int i = l; i < p; i++)
	{
		if (o[i].op == 1)
			update(o[i].y1, -o[i].val);
	}
	while (p <= m)
		temp[cnt++] = o[p++];
	while (q <= r)
		temp[cnt++] = o[q++];
	for (int i = l; i <= r; i++)
	{
		o[i] = temp[i];
	}
}
int main()
{
	scanf("%d%d", &n, &m);
	int cnt = 1;
	int qid = 1;
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);
		if (i == 1 || a[i] != a[i - 1])
			b[i] = 1;
		else
			b[i] = 0;
	}
	for (int i = 1; i <= n; i++)
	{
		if (b[i])
			o[cnt++] = Node(1, i, a[i], 0, 0, 1);
	}
	for (int i = 1; i <= m; i++)
	{
		int op;
		scanf("%d", &op);
		if (op == 1)
		{
			int x1, y1;
			scanf("%d%d", &x1, &y1);
			if (b[x1])
				o[cnt++] = Node(1, x1, a[x1], 0, 0, -1);
			a[x1] = y1;
			b[x1] = x1 == 1 || a[x1] != a[x1 - 1] ? 1 : 0;
			if (b[x1])
				o[cnt++] = Node(1, x1, a[x1], 0, 0, 1);
			if (x1 < n)
			{
				int temp = b[x1 + 1];
				b[x1 + 1] = a[x1 + 1] != a[x1] ? 1 : 0;
				if (!b[x1 + 1] && temp)
					o[cnt++] = Node(1, x1 + 1, a[x1 + 1], 0, 0, -1);
				if (b[x1 + 1] && !temp)
				{
					o[cnt++] = Node(1, x1 + 1, a[x1 + 1], 0, 0, 1);
				}
			}
		}
		else
		{
			int l, r, x, y;
			scanf("%d%d%d%d", &l, &r, &x, &y);
			if (x <= a[l] && a[l] <= y)
				ans[qid] = 1;
			o[cnt++] = Node(2, l, x, y, qid, 0);
			o[cnt++] = Node(3, r, x, y, qid, 0);
			qid++;
		}
	}
	cdq(1, cnt - 1);
	for (int i = 1; i < qid; i++)
	{
		printf("%d\n", ans[i]);
	}
	return 0;
}