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
AC in one GO
I am doing everything right making array of 4*n making it zero after each test case using segment trees and lazy propog running good on tc on spoj toolkit still getting wa
Hurray! 100th on Spoj!
why is O(N) solution not getting accepted ?
I solved this by taking the array size as 4 * n + 1. Can anyone tell me why 2 * nextpowerof2(n) - 1 is giving wrong answer.
@batyr Don't build the tree initially directly update the values as all the values are zero initially.
why do I have TLE??
anyone can explain the second test case
https://ideone.com/WSB1ro , by the way , anyone has any idea how to solve it using binary search ?
Why should array size be 4*n instead of pow(ceil(log2(n)+1) ?