poj 1195(二维树状数组)
2016-07-09 00:30
267 查看
Mobile phones
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
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 18031 | Accepted: 8314 |
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 题意:四种操作,询问加更新。 题解:二维树状数组维护,下标从0开始。
#include <iostream> #include <stdio.h> #include <string.h> #include <stack> using namespace std; const int N = 1100; int c ,n; int lowbit(int x){ return x&(-x); } void update(int x,int y,int v){ for(int i=x;i<=n;i+=lowbit(i)){ for(int j=y;j<=n;j+=lowbit(j)){ c[i][j] += v; } } } int getsum(int x,int y){ int sum = 0; for(int i=x;i>=1;i-=lowbit(i)){ for(int j=y;j>=1;j-=lowbit(j)){ sum+=c[i][j]; } } return sum; } int main() { int opr; while(scanf("%d",&opr),opr!=3){ if(opr==0){ scanf("%d",&n); memset(c,0,sizeof(c)); }else if(opr==1){ int x,y,v; scanf("%d%d%d",&x,&y,&v); update(x+1,y+1,v); }else{ int l,b,r,t; scanf("%d%d%d%d",&l,&b,&r,&t); printf("%d\n",getsum(r+1,t+1)-getsum(l,t+1)-getsum(r+1,b)+getsum(l,b)); } } return 0; }
相关文章推荐
- 正能量文章技术文章
- java lang NoClassDefFoundError org springframework util MimeType
- LA4119--算法入门经典训练指南
- HTML5实测体验
- 5.1.2 I/O控制方式
- 2016年全国各省市高考状元详情汇总一览
- MYSQL博客
- 2016年全国各省市高考状元详情汇总一览
- Python 语言及其应用 Chapter_10 Exercise
- 树结构练习——排序二叉树的中序遍历(sdut_2128)
- Linux4.4 TCP源码分析
- 使用CSS样式对表格进行美化并对伪类的使用进行解析
- Tcp_tw_reuse、tcp_tw_recycle 使用场景及注意事项
- 套接字和文件描述符
- Java中巧用字符串连接
- 设计模式系列:(3)Abstract Factory Patterns
- net.ipv4.tcp_tw_recycle
- 李洪强漫谈iOS开发[C语言-008]- C语言重难点
- html的选择器使用
- Lua脚本语言简明入门教程