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
The constraints are not wrong. A single v is at most 10^7 but since there are 10^5 numbers the sum of all v can be up to 10^12
getting TLE with lazy propagation. Any suggestions?? working fine with TC
if you got WA and did everything right, the constraints are wrong. You must use long long for v.
don't forget to clear the segment tree and other arrays if you have used to zero after each test case.
what am I missing, I thought answer for the given test case in the problem should be
Take every variable long long int and get AC. what the fuck!!!
Not clearing the global variables costed me WAs.
Last edit: 2020-09-22 22:32:32
Am so noob. Did everythin correct. Used long long and SegTree with lazy propagation but counted 1 less zero in the range of N. So dumb of me. Costed me 2 WA's. :(
if you use BIT,then declare atleast 2*(1e5) size array