Poj1195 mobile phones [two-dimensional tree array]

Mobile phones

Time limit:5000 Ms		Memory limit:65536 K
Total submissions:14288		Accepted:6642

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 has es 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 particle, 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 shocould 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

[Problem description]

Assume that the receiving and receiving stations of the fourth generation of mobile phones run like this. The entire area is divided into small squares. All squares form a matrix of S * s, with rows and columns ranging from 0 ~ S-1 number. Each small square contains a receiving and receiving station. The number of mobile phones in each cell phone box can be constantly changed, because mobile phone users move between cells, and some users start or shut down. Once the number of mobile phones started on a square changes, the receiving and receiving station in the square sends a message to the headquarters to indicate the number of mobile phones changed.

The Headquarters requires you to write a program to manage the information received from each receiving station. The boss may always ask: How many mobile phones are started in a given rectangle? Your program must be able to answer the boss's questions at any time.

[Input and Output Data]

Read integers from the standard input and write your answers to the boss to the standard output.

The format of input data is as follows: each input is a separate row. An input includes an indicator number and some parameters, as shown in the following table:

Number of indicators	Parameters	Meaning
0	S	Initial command. The entire area consists of S * s small squares. This command only appears at the beginning.
1	X y	The number of mobile phones on the square (x, y) increases by. A may be a positive number or a negative number.
2	L B R T	Ask how many mobile phones are started in the rectangle (L, B)-(R, t. The rectangular area (L, B)-(R, T) includes all the grids (x, y) that meet the conditions of L <= x <= r, B <= Y <= T.
3		Terminate the program. This command appears only once.

All data is always within the specified range and you do not need to make any mistakes. In particular, if A is a negative number, you can think that this operation will not change the number of mobile phones on the grid to a negative number. The Grid number starts from 0. For example, in a 4*4 area, all the grids (x, y) should be represented: 0 <= x <= 3, 0 <= Y <= 3.

Your program should not output anything except 2. If the indication is 2, your program should write an integer to the standard output.

[Data restrictions]

Region size	S * s	1*1 <= S * S <= 1024*1024
Value of each grid	V	0 <= V <= 32767
Increase/decrease	A	-32768 <= A <= 32767
Total number of commands	U	3 <= U <= 60002
Sum of all grids	M	M = 2 ^ 30

The first time I used the function pointer array in the OJ question, I felt very simple.

# Include <stdio. h> int tree [1030] [1030], size; int lowbit (int n) {return N & (-N);} void getsize () {scanf ("% d", & size) ;}void Update () {int X, Y, Val; scanf ("% d", & X, & Y, & Val); ++ X; ++ y; int temp; while (x <= size) {temp = y; while (temp <= size) {tree [x] [temp] + = val; temp + = lowbit (temp);} X + = lowbit (x) ;}} int getsum (int x, int y) {int sum = 0, temp; while (x> 0) {temp = y; while (temp> 0) {sum + = tree [x] [temp]; Te MP-= lowbit (temp);} X-= lowbit (x);} return sum;} void query () {int X1, Y1, X2, Y2; scanf ("% d", & X1, & Y1, & X2, & Y2); ++ x1; ++ Y1; ++ X2; + + y2; int sum = getsum (X2, Y2)-getsum (X2, Y1-1)-getsum (x1-1, Y2) + getsum (x1-1, y1-1); printf ("% d \ n", sum);} void (* funarr []) () = {getsize, update, query }; // function pointer array int main () {int com; while (scanf ("% d", & Com), com! = 3) (* funarr [COM]) (); Return 0 ;}