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.
0 2 4 26
0 4 8 80
0 4 5 20
1 8 8
0 5 7 14
1 4 8
Very good problem for clearing basics of Segment Trees and Lazy Propagation, took my 4 hours, but totally worth it. Remember to take all long long values .
My first Lazy. AC :D
Yes, someone earlier mentioned that v must be long long, I agree -- turned my WA into AC.
Moments of happiness when AC in one go after hours of implementation and testing !!
Solved it first using Segment Trees. Then learnt BIT and solved it... Number of lines of code reduced to more then 2 times the original
Finally AC after 3 WA :) Nice Start for Segment Tree & Lazy Propagation.
Direct implementation of Seg trees+lazy!
Encountering a WA? Change every single int to long long.
Be careful with 1ll*(e-s+1)*tree[node]