poj1195 Mobile phones（二维树状数组）

Posted 2020-11-21 changeg1824

时间限制(普通/Java):5000MS/15000MS     内存限制:65536KByte

 

描述

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. 

 

输入

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 

 

输出

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.

 

样例输入

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

样例输出

3
4

 

二维树状数组，单点更新+区间查寻

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 const int N=1030;
 5 int tree[N][N];
 6 int n;
 7 
 8 int lowbit(int i)
 9 {
10     return i&(-i);
11 }
12 void add(int x,int y,int a)
13 {
14     for( int i=x;i<=n;i+=lowbit(i))
15         for( int j=y;j<=n;j+=lowbit(j))
16             tree[i][j]+=a;
17 }
18 int sum(int l,int r)
19 {
20     int ans=0;
21     for(int i=l;i>0;i-=lowbit(i))
22         for( int j=r;j>0;j-=lowbit(j))
23             ans+=tree[i][j];
24     return ans;
25 }
26 int query(int l,int b,int r,int t)
27 {
28     return sum(r,t)+sum(l-1,b-1)-sum(l-1,t)-sum(r,b-1);
29 }
30 int main()
31 {
32     int k,x,y,v,l,b,r,t;
33     while(scanf("%d",&k),k!=3){
34         if(k==0){
35             scanf("%d",&x);
36             n=x;
37         }
38         else if(k==1){
39             scanf("%d%d%d",&x,&y,&v);
40             x++,y++;
41             add(x,y,v);
42         }
43         else if(k==2){
44             scanf("%d%d%d%d",&l,&b,&r,&t);
45             l++,b++,r++,t++;
46             printf("%d
",query(l,b,r,t));
47         }
48     }
49 }