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
EZ AC ONE GO
Make sure to clear the arrays :)
Don't forget to update the lazy to 0 after every testcase
If anyone is facing any problem with segment tree size you can try out submitting here
AC in 1 go, Solved using fenwick tree
Don't use 32 bit integers anywhere.
Solved with segment tree + lazy propagation, just gotta remember about those long longs
1 segment tree AC in 2 go
If you are getting sigsev error , then try to declare array size as 20*1e5.It worked for me.