题目
Mobile phones
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 17263 Accepted: 7966
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
题意
给一个矩阵,可以更改任意一个点的值。求任意俩个点为对角线的小矩形内所有数的和。
题解
树状数组可以很容易的扩展到高维。因为本质上树状数组存储的就是有二进制规律的前缀和。那么对高维也一样,因为一维坐标满足这样二进制分解的规律,扩展到二维后对二维的每一维也是一样满足。复杂度为O(logn*logn)。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <string>
#include <set>
#include <cmath>
#include <map>
#include <queue>
#include <sstream>
#include <vector>
#define m0(a) memset(a,0,sizeof(a))
#define mm(a) memset(a,0x3f,sizeof(a))
#define m_1(a) memset(a,-1,sizeof(a))
#define f(i,a,b) for(i = a;i<=b;i++)
#define fi(i,a,b) for(i = a;i>=b;i--)
#define lowbit(a) ((a)&(-a))
#define FFR freopen("data.in","r",stdin)
#define FFW freopen("data.out","w",stdout)
using namespace std;
typedef long long ll;
int n;
ll G[2000][2000];
void b_add(int a,int b,int c){
int i,j;
for(i = a;i<=n;i+=lowbit(i))
for(j = b;j<=n;j+=lowbit(j))
G[i][j]+=c;
}
ll b_sum(int a,int b){
int i,j;
ll sum = 0;
for(i = a;i;i-=lowbit(i))
for(j = b;j;j-=lowbit(j))
sum+=G[i][j];
return sum;
}
int main()
{
// ios_base::sync_with_stdio(false); cin.tie(0);
int x;
while(scanf("%d",&x)&&x!=3){
if(x==0){
scanf("%d",&n);
m0(G);
}else if(x==1){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
b_add(a+1,b+1,c);
}else if(x==2){
int x1,x2,y1,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
x1++;y1++;
x2++;y2++;
printf("%I64d\n",b_sum(x2,y2)-b_sum(x1-1,y2)-b_sum(x2,y1-1)+b_sum(x1-1,y1-1));
}
}
return 0;
}