Mobile phones(二维树状数组)
来源:互联网 发布:淘宝店铺名字大全楚 编辑:程序博客网 时间:2024/04/28 19:04
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
解题思路:
完全就是二维树状数组的模板,不过多阐述。
AC代码:
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int maxn = 1030;int c[maxn][maxn], s;int lowbit(int a){ return a & (-a);}void Update(int x,int y,int a){ for(int i = x; i <= s; i += lowbit(i)) for(int j = y; j <= s; j += lowbit(j)) c[i][j] += a;}int Sum(int x,int y){ int sum = 0; for(int i = x; i > 0; i -= lowbit(i)) for(int j = y; j > 0; j -= lowbit(j)) sum += c[i][j]; return sum;}int main(){ int order, x, y, a, l, b, r, t; memset(c, 0, sizeof(c)); scanf("0 %d",&s); while(scanf("%d", &order)) { if(order == 3) break; if(order == 1) { scanf("%d%d%d", &x, &y, &a); Update(x + 1, y + 1, a); } if(order == 2) { scanf("%d%d%d%d", &l, &b, &r, &t); printf("%d\n", Sum(r + 1,t + 1) - Sum(r + 1, b) - Sum(l, t + 1) + Sum(l, b)); } } return 0;}
0 0
- Mobile phones(二维树状数组)
- Mobile phones(二维树状数组)
- (POJ1195)Mobile phones <二维树状数组>
- poj_1195 Mobile phones(二维树状数组)
- poj1195 Mobile phones(二维树状数组)
- 【IOI2001】Mobile phones(二维树状数组)
- poj1195 Mobile phones(二维树状数组)
- Mobile phones(二维树状数组)
- POJ Mobile phones(1195)(二维树状数组)
- pku 1195 Mobile phones(二维树状数组)
- POJ 1195 MOBILE PHONES(二维树状数组)
- POJ 1195 Mobile phones(二维树状数组)
- POJ 1195--Mobile phones (二维树状数组)
- poj 1195 Mobile phones(二维树状数组基础)
- POJ1195 Mobile phones(简单二维树状数组)
- POJ 1195 Mobile phones (二维树状数组)
- [poj 1195] Mobile phones(二维树状数组)
- Mobile phones(二维树状数组模版题)
- [leetcode] Subsets II
- Linux下Nginx+Tomcat整合的安装与配置
- 从ubuntu 12.04的Terminal访问网络中Windows系统中共享share目录
- 做一个努力的人
- 怎样充分借助互联网自学?
- Mobile phones(二维树状数组)
- Android自动检测版本及自动升级
- 我小的时候也曾有人问过同样的问题
- Primavera P6R8.3 WebAccess 打开问题分析
- BUPT Summer Journey #test7 D
- 尚硅谷 第三课全 java-变量类型转换-字符与字符串-算数运算符-赋值运算符-三元运算符-.switch语句-循环结构-while 循环语句 do-while 循环语句
- Android TextView 自动换行问题
- HDOJ3783
- POJ_2253_Frogger_最短路