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
can be done using sqrt decomposition.
1.Naive segment tree with lazy propagation
Took me two days to solve it.
not using lazy propagation cost me two tle, one run time error for two small array size, and 8 WA for not using long long int and some silly mistakes. Now finally AC.
Segmentation fault with less than 4*n as size for Segment Tree's arrayLast edit: 2020-01-13 22:41:40
Solve it using c++ 4.3.2 i'm using c++ 8.3 and it gave WA =((((
sometimes, p and q don't satisfy that condition: `1 <= p, q <= N`.Last edit: 2020-01-02 12:10:15
Just undestand this:-
when you have WA try to increase the array size, 1.000.000 works.
Clear your array properly....