HORRIBLE - Horrible Queries
World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the legendary Bad Horse has retired, now you have to correctly answer the evil questions of Dr. Horrible, who has a PhD in horribleness (but not in Computer Science). You are given an array of N elements, which are initially all 0. After that you will be given C commands. They are -
* 0 p q v - you have to add v to all numbers in the range of p to q (inclusive), where p and q are two indexes of the array.
* 1 p q - output a line containing a single integer which is the sum of all the array elements between p and q (inclusive)
Input
In the first line you'll be given T, number of test cases.
Each test case will start with N (N <= 100 000) and C (C <= 100 000). After that you'll be given C commands in the format as mentioned above. 1 <= p, q <= N and 1 <= v <= 10^7.
Output
Print the answers of the queries.
Example
Input:
1
8 6
0 2 4 26
0 4 8 80
0 4 5 20
1 8 8
0 5 7 14
1 4 8
Output:
80
508
hide comments
|
karan_batra:
2016-08-30 21:30:03
The limits given are correct. |
|
montassar0111:
2016-08-23 20:44:50
you have to increase the size of the segment tree , if you'r using one ,
|
|
iharsh234:
2016-08-19 19:33:02
if you trying using BIT do this first
|
|
deepansh_946:
2016-08-10 17:06:37
Awesome Question |
|
threat_:
2016-08-04 10:24:41
only BIT :v |
|
vaibhav138:
2016-07-30 14:31:15
For each test case update whole lazy array to zero(2*100000) |
|
devender issar:
2016-07-25 11:53:21
I think input limits are wrong , looks like n can go beyond 100000 also.
|
|
liuxueyang:
2016-07-24 14:50:24
@Dushyant Singh Thank you so much. :-) |
|
akshayv3:
2016-07-24 01:38:59
SQRT Decomposition+BIT (AC) |
|
Dushyant Singh:
2016-07-22 15:31:23
@liuxueyang: v <= 10^7 and N<=10^5. That makes sum<=10^12 which will not fit in int. |
| Added by: | Iqram Mahmud |
| Date: | 2010-12-04 |
| Time limit: | 2.329s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
| Resource: | Own. Thanks to Emir Habul. |
RSS