POJ-1195 Mobile phones (二维树状数组 单点修改 区块查询)
来源:互联网 发布:深圳网络安全工程师 编辑:程序博客网 时间:2024/06/01 18:24
Mobile phones
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 20845 Accepted: 9634
Description
Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns numbered from 0 to S-1. Each square contains a base station. The number of active mobile phones inside a square can change because a phone is moved from a square to another or a phone is switched on or off. At times, each base station reports the change in the number of active phones to the main base station along with the row and the column of the matrix.
Write a program, which receives these reports and answers queries about the current total number of active mobile phones in any rectangle-shaped area.
Write a program, which receives these reports and answers queries about the current total number of active mobile phones in any rectangle-shaped area.
Input
The input is read from standard input as integers and the answers to the queries are written to standard output as integers. The input is encoded as follows. Each input comes on a separate line, and consists of one instruction integer and a number of parameter integers according to the following table.
The values will always be in range, so there is no need to check them. In particular, if A is negative, it can be assumed that it will not reduce the square value below zero. The indexing starts at 0, e.g. for a table of size 4 * 4, we have 0 <= X <= 3 and 0 <= Y <= 3.
Table size: 1 * 1 <= S * S <= 1024 * 1024
Cell value V at any time: 0 <= V <= 32767
Update amount: -32768 <= A <= 32767
No of instructions in input: 3 <= U <= 60002
Maximum number of phones in the whole table: M= 2^30
The values will always be in range, so there is no need to check them. In particular, if A is negative, it can be assumed that it will not reduce the square value below zero. The indexing starts at 0, e.g. for a table of size 4 * 4, we have 0 <= X <= 3 and 0 <= Y <= 3.
Table size: 1 * 1 <= S * S <= 1024 * 1024
Cell value V at any time: 0 <= V <= 32767
Update amount: -32768 <= A <= 32767
No of instructions in input: 3 <= U <= 60002
Maximum number of phones in the whole table: M= 2^30
Output
Your program should not answer anything to lines with an instruction other than 2. If the instruction is 2, then your program is expected to answer the query by writing the answer as a single line containing a single integer to standard output.
Sample Input
0 41 1 2 32 0 0 2 2 1 1 1 21 1 2 -12 1 1 2 3 3
Sample Output
34
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define maxn 1030int c[maxn][maxn];inline int lowbit(int x){ return x & (-x);}void add(int x, int y, int v, int n){ while(x <= n){ int cur = y; while(cur <= n){ c[x][cur] += v; cur += lowbit(cur); } x += lowbit(x); }}int query(int x, int y){ int ans = 0; while(x){ int cur = y; while(cur){ ans += c[x][cur]; cur -= lowbit(cur); } x -= lowbit(x); } return ans;}int main(){ int op, n, l, b, r, t, a; memset(c, 0, sizeof(c)); scanf("%d %d", &op, &n); while(scanf("%d", &op) != EOF){ if(op == 3){ return 0; } if(op == 1){ scanf("%d %d %d", &l, &r, &a); l++; r++; add(l, r, a, n); } else{ scanf("%d %d %d %d", &l, &b, &r, &t); l++; b++; r++; t++; printf("%d\n", query(r, t) - query(r, b - 1) - query(l - 1, t) + query(l - 1, b - 1)); } }} /*题意:1024*1024的区间,每次操作要么修改某点的值,要么查询某个区块的值和。思路:二维树状数组。*/
阅读全文
0 0
- POJ-1195 Mobile phones (二维树状数组 单点修改 区块查询)
- POJ 1195 - Mobile phones 二维树状数组(单点更新..区间查询)
- POJ 1195 Mobile phones(二维树状数组,点修改,区间查询)
- POJ——1195Mobile phones(二维树状数组点修改矩阵查询)
- POJ 1195 Mobile phones 二维树状数组
- POJ 1195 Mobile phones【二维树状数组】
- POJ 1195 Mobile phones 二维树状数组
- poj 1195 Mobile phones 二维树状数组
- POJ 1195 Mobile phones 二维树状数组
- poj 1195 Mobile phones +二维树状数组
- POJ 1195 Mobile phones 二维树状数组
- Mobile Phones poj 1195--二维树状数组
- POJ 1195 Mobile phones【二维树状数组】
- POJ 1195 Mobile phones(二维树状数组)
- POJ 1195 Mobile phones(二维树状数组)
- POJ 1195 Mobile phones(二维树状数组)
- poj 1195 mobile phones 二维树状数组
- POJ 1195 Mobile phones 二维树状数组
- Nginx + Linux 性能调优
- 面试记录第二十一节——(进程保活)
- Perfmon
- R_REmap包
- 彻底理解JAVA动态代理
- POJ-1195 Mobile phones (二维树状数组 单点修改 区块查询)
- 【翻译】SSD: Single Shot MultiBoxDetector
- 谷歌开源图像分类工具TF-Slim,定义TensorFlow复杂模型
- shell 多个程序 log 的备份(一)
- Qt 5.9安装及配置环境变量的注意事项
- JS中的作用域以及全局变量的问题
- GoogleNet inception-v4概述及python实现方法
- CSS块级元素和行内元素
- node.js升级造成gulp无法使用的解决问题