Mobile phones
| Time Limit: 5000MS | Memory Limit: 65536K | |
| Total Submissions: 15013 | Accepted: 6957 |
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
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
——————————————————分割线——————————————
题目大意：
给一个s*s的矩阵，有4种操作
0：将矩阵初始化每个点为0
1：(x,y,a)将点（x,y）增加a
2：(l,b,r,t)查询左下角为(l,b),右上角为(r,t)的矩形区域中数的总和
3：结束输入
思路：
二维树状数组基础题吧/
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define M 1024+10
using namespace std;
int c[M][M];
void update(int x,int y,int v)
{
for(int i=x;i<=M;i+=i&-i){
for(int j=y;j<=M;j+=j&-j){
c[i][j]+=v;
}
}
}
int getsum(int x,int y)
{
int sum=0;
for(int i=x;i>0;i-=i&-i){
for(int j=y;j>0;j-=j&-j){
sum+=c[i][j];
}
}
return sum;
}
int main()
{
int in,pa,n,x,y,a,l,r,b,t;
while(scanf("%d",&in)!=EOF){
if(in==3) break;
if(in==0){scanf("%d",&n);memset(c,0,sizeof(c));}
if(in==1){scanf("%d %d %d",&x,&y,&a);x++,y++,update(x,y,a);}
if(in==2){
scanf("%d %d %d %d",&l,&b,&r,&t);
l++,b++,r++,t++;
printf("%d\n",getsum(r,t)-getsum(l-1,t)-getsum(r,b-1)+getsum(l-1,b-1));
}
}
return 0;
}