POJ1195
来源:互联网 发布:音乐加快节奏软件 编辑:程序博客网 时间:2024/05/14 21:12
Mobile phones
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 11365 Accepted: 5212
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
Source
IOI 2001
二维树状数组,注意X,Y是大于等于0,小于等于S。
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;const int maxn=1030;int tree[maxn][maxn];int S,X,Y,A,L,B,R,T;inline int Lowbit(int x){ return x&(-x);}void Update(int x,int y,int c){ int i,j; for(i=x; i<=S; i+=Lowbit(i)) for(j=y; j<=S; j+=Lowbit(j)) tree[i][j]+=c;}int Getsum(int x,int y){ int s=0,i,j; for(i=x; i>0; i-=Lowbit(i)) for(j=y; j>0; j-=Lowbit(j)) s+=tree[i][j]; return s;}int main(){ int c; while(scanf("%d",&c)!=-1&&c!=3) { if(c==0) { scanf("%d",&S); for(int i=1; i<=S; i++) for(int j=1; j<=S; j++) tree[i][j]=0; } else if(c==1) { scanf("%d%d%d",&X,&Y,&A); X++,Y++; Update(X,Y,A); } else if(c==2) { scanf("%d%d%d%d",&L,&B,&R,&T); R++,T++; int ans=Getsum(R,T)+Getsum(L,B)-Getsum(R,B)-Getsum(L,T); printf("%d\n",ans); } } return 0;}
- poj1195
- POJ1195
- POJ1195
- poj1195
- poj1195
- poj1195解题报告
- POJ1195 Mobile phones
- poj1195 Mobile phones
- poj1195 Mobile phones
- poj1195 二维树状数组
- poj1195(二维树状数组)
- POJ1195-二维数组
- 二维树状数组--poj1195
- 【树转数组】poj1195
- poj1195 Mobile phones
- poj1195 二维线段树
- Mobile phones-POJ1195
- 二维树状数组poj1195
- 堆栈的进栈以及出栈
- [開發紀錄] 語音辨識 - 基本結構
- 【编程之美】读书笔记:给定一个整数N,求N!末尾有多少个0
- 常用的库的角度制和弧度制
- Internet Explorer 已不再尝试还原此网站 该网站看上去仍有问题
- POJ1195
- ios与android语音通用方案 编译libopencore-amr xcode4.5/ios6版本
- Linux应用编程之进程编程
- 进程的三种状态及转换
- 栈的push、pop序列
- [iOS] APNS: 如何check valid device token
- 博客破万
- 100个经典的C算法(C语言帝国)
- android 换行符(\n) 在TextView中显示不正常的问题