POJ 1195:Mobile phones 二维树状数组
来源:互联网 发布:织梦软件频道 编辑:程序博客网 时间:2024/05/16 11:46
Mobile phones
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 16893 Accepted: 7789
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 <iostream>#include <algorithm>#include <cmath>#include <vector>#include <string>#include <cstring>#pragma warning(disable:4996)using namespace std;#define MY_MAX 1100int C[MY_MAX][MY_MAX];int s;int lowbit(int x){return x&(-x);}void Add(int y,int x,int a){while(y<=s){int temp=x;while(temp<=s){C[y][temp]+=a;temp +=lowbit(temp);}y +=lowbit(y);}}int QuerySum(int y,int x){int nSum=0;while(y>0){int temp=x;while(temp>0){nSum += C[y][temp];temp -= lowbit(temp);}y -=lowbit(y);}return nSum;}int main(){//freopen("i.txt","r",stdin);//freopen("o.txt","w",stdout);int oper;int x,y,a,le,b,r,t;while(true){scanf("%d",&oper);if(oper==0){scanf("%d",&s);memset(C,0,sizeof(C));}else if(oper==1){scanf("%d%d%d",&x,&y,&a);Add(x+1,y+1,a);}else if(oper==2){scanf("%d%d%d%d",&le,&b,&r,&t);printf("%d\n",QuerySum(r+1,t+1) + QuerySum(le,b)- QuerySum(le,t+1) - QuerySum(r+1,b));}else if(oper==3){break;}}//system("pause");return 0;}
0 0
- 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 二维树状数组
- Poj 1195 Mobile phones 二维树状数组
- poj 1195 Mobile phones(二维树状数组)
- poj 1195 Mobile phones 二维树状数组
- POJ 1195 Mobile phones (二维树状数组)
- Android动画学习总结---中
- 网络编程 学习参考的几个链接
- UGUI点击响应事件
- AI设计---robot_v2.0(感情机制的简单模拟)
- 条款35(考虑virtual函数以外的其他选择)之Template Method模式和Strategy模式
- POJ 1195:Mobile phones 二维树状数组
- 三种传递数据的方法
- unity官方demo学习之Stealth(二)警报灯设定
- 安装Adobe系列产品出现致命错误:FATAL: Payload
- C++primer学习:string类的练习(2)
- 【NOIP模拟】20151004模拟
- CF 582A(GCD Table-贪心)
- Android UI ActionBar功能-Action Bar 左上角的向上或返回按钮
- C语言的链接属性的个人理解