27412번 - Matrix 서브태스크다국어언어 제한함수 구현

You wake up as usual and, during the day, you start noticing certain glitches in the world. By the end of the day, you are sure you are in the Matrix and you want to get out. The Architect finds you and offers you a way out if you manage to aid him in a problem.

The Architect has an N × M matrix, where initially all of the cells are 0. During the day, parts of the matrix are modified and sometimes the Architect wants to find something about a certain cell in the matrix.

The Architect tells you that the matrix has N rows and M columns, then he sends you K operations as follows:

• UPDATE X Y₁ Y₂: all of the cells on row X between the columns Y₁ and Y₂ inclusively have their value increased by 1.
• QUERY X Y: find the value of the cell on row X and column Y.

Because the Architect doesn't trust you completely, this problem is NOT going to be judged the usual batch way. Instead, you have to implement the following functions:

• void initialize(long long N, long long M)
• void update(long long X, long long Y1, long long Y2)
• int query(long long X, long long Y)

in your source file, with these exact prototypes. You may implement other functions and declare local and global variables. Your submissions must not interact in any way with standard input/output, nor with any other file. Do not declare a main function. Your source file will be compiled and linked together with a source file provided by the committee, which will handle the input/output and will call the functions your source file has declared (grader.cpp).

• 1 ≤ N, M ≤ 10¹⁸
• 0 ≤ K ≤ 500,000
• Rows and columns are numbered starting from 1.

After the last operation, the matrix looks like this:

0 1 0 0 0
1 2 2 2 1