Mokia HYSBZ - 1176 CDQ分治

最新推荐文章于 2022-08-01 00:05:32 发布

M_theory004

最新推荐文章于 2022-08-01 00:05:32 发布

阅读量122

点赞数

分类专栏： CDQ分治&&整体二分

本文链接：https://blog.csdn.net/qq_43313637/article/details/100674186

版权

CDQ分治&&整体二分专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#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 s, n;
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) {}
}a[N], b[N];
int c[M];
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)
{
	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 && a[p].x1 <= a[q].x1)
		{
			if (a[p].op == 1)
				update(a[p].y1, a[p].val);
			b[cnt++] = a[p++];
		}
		b[cnt++] = a[q];
		if (a[q].op == 2)
		{
			
			ans[a[q].id] -= ask(a[q].y2) - ask(a[q].y1 - 1);
			//printf("ans[%d] == %d\n",a[q].id, ans[a[q].id]);
		}
		else if (a[q].op == 3)
		{
			
			ans[a[q].id] += ask(a[q].y2) - ask(a[q].y1 - 1);
			//printf("ans[%d] == %d\n",a[q].id, ans[a[q].id]);	
		}
	}
	for (int i = l; i < p; i++)
	{
		if (a[i].op == 1)
			update(a[i].y1, -a[i].val);
	}
	while (p <= m)
		b[cnt++] = a[p++];
	while (q <= r)
		b[cnt++] = a[q++];
	for (int i = l; i <= r; i++)
	{
		a[i] = b[i];
	}
}
int main()
{
	scanf("%d%d", &s, &n);
	int cnt = 1;
	int qid = 1;
	int op;
	while (1)
	{
		scanf("%d", &op);
		if (op == 1)
		{
			int x, y, val;
			scanf("%d%d%d", &x, &y, &val);
			a[cnt++] = Node(1, x, y, 0, 0, val);		
		}
		else if (op == 2)
		{
			int x1, x2, y1, y2;
			scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
			a[cnt++] = Node(2, x1 - 1, y1, y2, qid, 0);
			a[cnt++] = Node(3, x2, y1, y2, qid, 0);
			ans[qid] += s * (y2 - y1 + 1)*(x2 - x1 + 1);
			qid++;
		}
		else
		break;
	}
	cdq(1, cnt - 1);
	for (int i = 1; i < qid; i++)
	{
		printf("%d\n", ans[i]);
	}
	return 0;
}