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)



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.


Print the answers of the queries.


8 6
0 2 4 26
0 4 8 80
0 4 5 20
1 8 8
0 5 7 14
1 4 8


hide comments
aditya81070: 2019-03-09 22:34:54

In question they have described that there will be an array of N integers but in the sample test case, they have not provided any array in input.

itssanat: 2019-03-02 14:06:04

my 50th on spoj :):)

joueur: 2019-01-23 16:58:01

2 BIT .... AC

vinaytop: 2019-01-14 18:57:50

showing tle in java (even for taking input)

johaer_wasif: 2018-12-17 10:50:58

If you are using global array then make sure that you set all element of tree, lazy and array to zero after every test-case.

Rahul Kathuria: 2018-11-19 14:23:01

nice qsn :)

akshaybhatia95: 2018-11-13 16:34:56

make sure tree size is 4*n

phoemur: 2018-10-15 04:10:30

AC in std::numeric_limits<long long>::max() go !!!

freakash: 2018-10-09 08:46:22

Nice Question (solved using ST+lazy prop)
watch Tushar Roy video on youtube for learning lazy prop and ST !
Getting wrong Answer? Convert all int to long long int
Getting Runtime error(SIGSEGV)? set the upper bound of array to 4000001

harry_shit: 2018-09-27 15:20:11

ac in 100000000th time

Added by:Iqram Mahmud
Time limit:2.329s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own. Thanks to Emir Habul.