Nộp bài  Các bài nộp  Làm tốt nhất  Về danh sách bài 
NKMOBILE  IOI01 Mobiles 
English  Vietnamese 
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 SxS 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 rectangleshaped area.
Input
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.
Instruction  Parameters  Meaning 
0  S  Initialize the matrix size to S´S containing all zeros. This instruction is given only once and it will be the first instruction. 
1  X Y A  Add A to the number of active phones in table square (X, Y). A may be positive or negative. 
2  L B R T  Query the current sum of numbers of active mobile phones in squares (X,Y), where L ≤ X ≤ R, B ≤ Y ≤ T 
3  .  Terminate 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 4x4, 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.
Constraints
 1 ≤ S ≤ 1024.
 Cell value V at any time: 0 ≤ V ≤ 2^{15}–1 (= 32767).
 Update amount A: 32768 ≤ A ≤ 32767.
 Number of instructions in input U: 3 ≤ U ≤ 60002.
 Maximum number of phones in the whole table M=2^{30}
Example
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 Output 3 4
Được gửi lên bởi:  Duc 
Ngày:  20071217 
Thời gian chạy:  1s 
Giới hạn mã nguồn:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Ngôn ngữ cho phép:  Tất cả ngoại trừ: ERL GOSU JSRHINO NODEJS PERL6 PYPY RUST SED VB.NET 
Nguồn bài:  IOI 2001  Finland 
hide comments


20181225 09:56:56
ez BIT 2D but i wonder can i do it with BIT 1D like ccost ??? Last edit: 20181225 10:05:58 

20180503 03:05:38
Chả hiểu các ông làm thế nào chứ tôi trâu cũng AC :D 

20180106 12:59:47
BIT 2D 3 đấm AC sai vụ hàng cột L R B T _ Last edit: 20180106 13:02:37 

20171018 12:57:48
1 Đấm AC BIT2D (lần đầu làm BIT2D) :>  frostpixel aka.How 2 AC 

20161007 11:43:25 THK6
BIT2D > 1 đấm AC :3 

20161005 12:08:55
IT 2d có 40 :'( , chắc code chưa tối ưu 

20161001 17:51:56
IT2D > tle BIT2D > AC :3 

20160522 15:53:27 Lê Thanh Phú
IT2D time >1s Last edit: 20160628 16:19:41 

20160522 10:00:40 Lê Thanh Phú
Bai nay cai bang BIT 2D cung hay 

20151123 08:53:17 Codeforces CHT
IT2D 1 đấm AC :v 