IOI '01 - Tampere, Finland

Mobile Phones

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.

InstructionParametersMeaning
0SInitialize the matrix size to S×S containing all zeros. This instruction is given only once and it will be the first instruction.
1X Y AAdd A to the number of active phones in table square (X, Y). A may be positive or negative.
2L B R TQuery the current sum of numbers of active mobile phones in squares (X, Y), where LXR, BYT
3Terminate program. This instruction is given only once and it will be the last instruction.

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.

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.

Example

stdinstdoutexplanation
0 4
Initialize table size to 4×4.
1 1 2 3
Update table at (1, 2) with +3.
2 0 0 2 2
Query sum of rectangle 0 ≤ X ≤ 2, 0 ≤ Y ≤ 2.
3
Answer the query.
1 1 1 2
Update table at (1, 1) with +2.
1 1 2 -1
Update table at (1, 2) with -1.
2 1 1 2 3
Query sum of rectangle 1 ≤ X ≤ 2, 1 ≤ Y ≤ 3.
4
Answer the query.
3
Terminate the program.

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

Constraints

Table sizeS×S1×1 ≤ S×S ≤ 1024×1024
Cell value V at any timeV0 ≤ V ≤ 215−1 (= 32767)
Update amountA-215A ≤ 215−1 (= 32767)
No. of instructions in inputU3 ≤ U ≤ 60002
Maximum number of phones in the whole tableMM = 230

All Submissions
Best Solutions


Point Value: 15 (partial)
Time Limit: 1.00s
Memory Limit: 8M
Added: Jun 24, 2014

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

Comments (Search)

It's quiet in here...