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
direct implementation of lazy propagation...
Don't forget to clear segment tree array and lazy array after each test case. It costed me 4 WAs.
Try using long(java) or long long int(c++) for every variable except for array index which will be in int. I got mine excepted this way..Last edit: 2019-10-15 22:10:07
RIP long long int..
AC in one go
baba black sheep have you any wool yes sir yes sir three bags fool
Several WA using 2 BIT finally AC.
Good question to learn lazy propagation in segment tree.
acc in 1000 go
AC IN 2 GOs.