POJ 1195 Mobile phones (二维线段树)

最新推荐文章于 2022-09-28 17:27:09 发布

SSL_MYD

最新推荐文章于 2022-09-28 17:27:09 发布

阅读量141

点赞数

分类专栏：数据结构文章标签：算法 c++ 数据结构板子

本文链接：https://blog.csdn.net/weixin_46975572/article/details/125173167

版权

数据结构专栏收录该内容

4 篇文章 0 订阅

订阅专栏

POJ 1195 Mobile phones (二维线段树)

title

Code

#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 64800010, M = 100010;

struct Segment {
	int s[N], rt[N], ch[N][2], tot, n, m;

	void clear(int n, int m, int k, int x) {
		tot = 0;
		this->n = n;
		this->m = m;
		for (int i = 0; i <= k; ++i) {
			s[i] = x;
			rt[i] = ch[i][0] = ch[i][1] = 0;
		}
		return ;
	}

	int query2(int k, int l, int r, int x, int y) {
		if (!k)
			return 0;
		if (x <= l && r <= y)
			return s[k];
		int mid = (l + r) >> 1, res = 0;
		if (x <= mid)
			res += query2(ch[k][0], l, mid, x, y);
		if (y > mid)
			res += query2(ch[k][1], mid + 1, r, x, y);
		return res;
	}

	void modify2(int &k, int l, int r, int x, int v) {
		if (!k)
			k = ++tot;
		s[k] += v;
		if (l == r)
			return;
		int mid = (l + r) >> 1;
		if (x <= mid)
			modify2(ch[k][0], l, mid, x, v);
		else
			modify2(ch[k][1], mid + 1, r, x, v);
	}

	int query1(int k, int l, int r, int xl, int xr, int yl, int yr) {
		if (!k)
			return 0;
		if (xl <= l && r <= xr)
			return query2(rt[k], 1, m, yl, yr);
		int mid = (l + r) >> 1, res = 0;
		if (xl <= mid)
			res += query1(ch[k][0], l, mid, xl, xr, yl, yr);
		if (xr > mid)
			res += query1(ch[k][1], mid + 1, r, xl, xr, yl, yr);
		return res;
	}

	void modify1(int &k, int l, int r, int x, int y, int v) {
		if (!k)
			k = ++tot;
		modify2(rt[k], 1, m, y, v);
		if (l == r)
			return ;
		int mid = (l + r) >> 1;
		
		if (x <= mid)
			modify1(ch[k][0], l, mid, x, y, v);
		else
			modify1(ch[k][1], mid + 1, r, x, y, v);

		return ;
	}


	int modify(int x, int y, int v) {
		int k = 1;
		modify1(k, 1, n, x, y, v);
		return k;
	}

	int query(int xl, int xr, int yl, int yr) {
		return query1(1, 1, n, xl, xr, yl, yr);
	}
} ;

Segment tr;

int main() {
	int n, opt, x, y, v, t;
	scanf("%*d %d", &n);
	tr.clear(n, n, 324 * n, 0);
	
	for (scanf("%d", &opt); opt != 3; scanf("%d", &opt)) {
		if (opt == 1) {
			scanf("%d %d %d", &x, &y, &v);
			tr.modify(x + 1, y + 1, v);
		} else {
			scanf("%d %d %d %d", &x, &y, &v, &t);
			printf("%d\n", tr.query(x + 1, v + 1, y + 1, t + 1));
		}
	}

	return 0;
}