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
Nice Question Solved using Lazy Propagation finally AC(0.61s) after 7 WA's
AC with BIT in 0.12 s
TLE In Java even by using BIT
getting TLE with java, AC with C++ for same code. WHY???????
Got AC(0.73 s), used cin and cout,no problemm.its all about your coding style..and yes remember to reset the arrays after each test cases...(which i realised after 4 WA's)
done with BIT..but still not confident with it
Do BIT tree, much easier and faster to code.
Thomas Dybdahl Ahle:
The question has 0 accepted Python solutions, so I assume it isn't possible given the time constraints?
Reset the whole lazy and tree arrays for each test case not only that portion req by the new test case.
Easy with BIT as well !!!