线段树-- POJ - 1195 Mobile phones
2015-11-01 00:31
351 查看
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.
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
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
Sample Output
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.
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
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 4 1 1 2 3 2 0 0 2 2 1 1 1 2 1 1 2 -1 2 1 1 2 3 3
Sample Output
3 4
#include <cstdio> using namespace std; const int maxn = 1026; int mt[maxn][maxn], n; int lowbit(int x) { return x&(-x); } void update(int x, int y, int a) { for(int i=x; i<=n; i+=lowbit(i)) for(int j=y; j<=n; j+=lowbit(j)) mt[i][j] += a; } int sum(int x, int y) { int ans = 0; for(int i=x; i>0; i-=lowbit(i)) for(int j=y; j>0; j-=lowbit(j)) ans += mt[i][j]; return ans; } int main() { int cmd; while(~scanf("%d", &cmd)) { if(cmd == 3) break; if(cmd == 0) scanf("%d", &n); else if(cmd == 1) { int x, y, a; scanf("%d%d%d", &x, &y, &a); update(x+1, y+1, a); } else if(cmd == 2) { int x1, y1, x2, y2; scanf("%d%d%d%d", &x1, &y1, &x2, &y2); int a = sum(x2+1, y2+1), b = sum(x2+1, y1); int c = sum(x1, y2+1), d = sum(x1, y1); printf("%d\n", a-b-c+d); } } return 0; }
相关文章推荐
- 简单的指南针开发
- Android MVP 模式:简单易懂的介绍方式
- nyoj 取石子(二) 135 (博弈&&思想)
- Struts2 注解零配置方法(convention插件使用)
- 舞伴配对问题
- Java基础之静态static
- IBatis.Net获取执行的Sql语句
- MySQL CMake 安装说明
- C# 结构体 struct
- iOS项目开发实战——实现UICollectionView的动态增加Cell与Section
- struts2 的 @Result 和 @ResultPath 联合使用
- Java动态代理
- IOS控件之ScrollView,PageControl---APP首次打开引导页面效果实现~
- 浅谈SQL Server中的快照
- 第七次作业——团队作业——项目冲刺———第四天
- 大数乘(正整数)
- 数据结构实验二
- 大二专题第一周 E - Hyper Prefix Sets
- 轻开纯HTML5的公司网站介绍
- 哈弗曼编码对文件进行压缩解压