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
nitish_verma26:
2020-10-26 16:18:25
Not clearing the global variables costed me WAs. |
|
gnomegeek:
2020-08-06 01:28:26
Am so noob. Did everythin correct. Used long long and SegTree with lazy propagation but counted 1 less zero in the range of N. So dumb of me. Costed me 2 WA's. :( |
|
zobayer_abedin:
2020-06-30 17:26:55
if you use BIT,then declare atleast 2*(1e5) size array
|
|
jopdhiwaala:
2020-06-14 17:17:14
Change everything to long long unsigned int and got ac :) |
|
coolboy7:
2020-06-08 14:29:56
what is the use of making an array? why can't we just initialize a segment tree with values as 0?? |
|
faraday_vij:
2020-06-04 13:14:26
people unable to debug go to udebug and find the input's. they are good |
|
noobbbbbb:
2020-06-03 17:44:50
finally got ac after lots of efforts
|
|
kkdrummer:
2020-06-03 10:56:57
if using segment tree , make a dynamic instead of array
|
|
codificador:
2020-05-29 21:45:59
I think the constraints given are incorrect, costed me 3 WA. I changed everything to long long and voila! |
|
i_gots_this:
2020-05-27 21:22:55
Standard BIT problem... Use Fast i/o and long long
|
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. |