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
Arjav:
2015-12-30 21:56:09
Easy with BIT as well !!! |
|
naruto09:
2015-12-29 06:50:02
use long long for that v variable.. |
|
anshal dwivedi:
2015-12-24 12:31:08
Direct implementation of segment tree with lazy propagation...! XD |
|
deepak bhagat:
2015-12-18 17:40:56
changed long long from int and it got accepted. |
|
sharif ullah:
2015-12-18 13:46:42
check if you initialize nodes and array with 0 after test cases! |
|
Mit:
2015-12-11 11:42:07
remember to reset your arrays after each test case ;) |
|
karthik1997:
2015-12-07 17:56:06
1 year back , I was like how to do this and now AC in one go :)
|
|
Kruti K Mohanta:
2015-12-06 10:39:22
Good question to learn segment tree with lazy propagation; |
|
Siddharth Singh:
2015-10-29 02:03:11
This problem literally translates into "please implement a Segment tree with lazy propagation " |
|
Siddharth Singh:
2015-10-29 02:03:07
This problem literally translates into "please implement a Segment tree with lazy propagation " |
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. |