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)
Input
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.
Output
Print the answers of the queries.
Example
Input:
1
8 6
0 2 4 26
0 4 8 80
0 4 5 20
1 8 8
0 5 7 14
1 4 8
Output:
80
508
hide comments
Obliterator:
2015-07-13 12:30:15
@Akash, try using long long in place of int. Apparently there is a problem of overflow. |
|
AAKASH SHINGHAL:
2015-07-12 05:34:05
Is there any corner edge in this problem? I'm repeatedly getting wrong answer after many tries |
|
Obliterator:
2015-07-11 07:28:43
@Mayank, I was just trying to help. Well, suit yourself |
|
Aditya Kumar:
2015-07-10 19:06:31
really nice question to start with lazy propagation.
|
|
[Mayank Pratap]:
2015-07-09 14:43:14
My first seg tree + lazy propagation ...... NIce Prob :) |
|
[Mayank Pratap]:
2015-07-08 12:53:37
@Obliterator .... Please solve the problem first .... :P |
|
Obliterator:
2015-07-07 22:27:49
@Mayank Try BIT |
|
[Mayank Pratap]:
2015-07-05 18:55:49
Has anyone done it without lazy propagation .?? |
|
Tony T.:
2015-06-30 10:42:51
edit: AC after reading some explanations. Needed to understand how to do range queries. Last edit: 2015-06-30 12:20:19 |
|
Gaurav kumar:
2015-06-22 18:30:44
feels good to learn lazy propagation...:) |
Added by: | Iqram Mahmud |
Date: | 2010-12-04 |
Time limit: | 2.329s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own. Thanks to Emir Habul. |