Submit | All submissions | Best solutions | Back to list |
MATSUM - Matrix Summation |
A N × N matrix is filled with numbers. BuggyD is analyzing the matrix, and he wants the sum of certain submatrices every now and then, so he wants a system where he can get his results from a query. Also, the matrix is dynamic, and the value of any cell can be changed with a command in such a system.
Assume that initially, all the cells of the matrix are filled with 0. Design such a system for BuggyD. Read the input format for further details.
Input
The first line of the input contains an integer t, the number of test cases. t test cases follow.
The first line of each test case contains a single integer N (1 ≤ N ≤ 1024), denoting the size of the matrix.
A list of commands follows, which will be in one of the following three formats (quotes are for clarity):
- "SET x y num" - Set the value at cell (x, y) to num (0 ≤ x, y < N).
- "SUM x1 y1 x2 y2" - Find and print the sum of the values in the rectangle from (x1, y1) to (x2, y2), inclusive. You may assume that x1 ≤ x2 and y1 ≤ y2, and that the result will fit in a signed 32-bit integer.
- "END" - Indicates the end of the test case.
Output
For each test case, output one line for the answer to each "SUM" command. Print a blank line after each test case.
Example
Input: 1 4 SET 0 0 1 SUM 0 0 3 3 SET 2 2 12 SUM 2 2 2 2 SUM 2 2 3 3 SUM 0 0 2 2 END Output: 1 12 12 13
Added by: | Matthew Reeder |
Date: | 2006-10-29 |
Time limit: | 1.029s |
Source limit: | 30000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Al-Khawarizm 2006 |
hide comments
|
||||||||||
2017-06-20 17:43:54 sonu
Easy one if you Know 2d bit |
||||||||||
2017-06-03 04:41:10
It can be solved with 2D Segment Tree |
||||||||||
2017-02-28 17:24:28
cin/cout (optimized to avoid flushes); bit2d<int> 0.30s; bit2d<long long> 0.33s If you're not getting AC with long long you're doing something wrong. Also, the problem specifies that output values fit in signed ints. Intermediate overflow/underflow shouldn't be a concern since it will cancel itself out. |
||||||||||
2016-12-11 10:32:38
Nice problem to learn 2D BIT Use scanf printf :) |
||||||||||
2016-11-28 17:10:05 lt
2d-Segment Tree with most optimizations => TLE 2d - BIT => AC |
||||||||||
2016-11-09 05:40:09 Chandan Kumar Rai
In java , Bit2d give TLE .. any suggestions for AC |
||||||||||
2016-08-07 14:08:14
Hi guys ......if you got a Runtime error(SIGSEGV),change all the long long to int . |
||||||||||
2016-07-09 17:07:55 Mahtab
can any one give some test cases , I am getting error(SIGSEGV) . |
||||||||||
2016-06-15 18:37:24
NICE QUESTION TO LEARN 2D BIT |
||||||||||
2016-06-04 07:10:11
Damn Its 1024**** Costed me few WA. Int works too :) |