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.


8 6
0 2 4 26
0 4 8 80
0 4 5 20
1 8 8
0 5 7 14
1 4 8


hide comments
casio991ms: 2022-06-07 13:28:52

Don't forget to update the lazy to 0 after every testcase

ab_turjo44: 2022-04-23 06:36:01

If anyone is facing any problem with segment tree size you can try out submitting here
** It got accepted there but here gave wa
NB: use long long instead of int

Last edit: 2022-04-23 06:37:00
skywalkerps: 2022-02-03 18:29:54

AC in 1 go, Solved using fenwick tree

Jean-Ralph Aviles: 2021-08-27 19:48:21

Don't use 32 bit integers anywhere.

adam____: 2021-08-25 19:02:12

Solved with segment tree + lazy propagation, just gotta remember about those long longs

samarth5611: 2021-07-19 03:13:51

1 segment tree AC in 2 go

sicho_mohit: 2021-07-06 17:12:00

If you are getting sigsev error , then try to declare array size as 20*1e5.It worked for me.

sal_vat_ion: 2021-07-02 09:13:19

literally make everything long long and get AC.

khasrulalam: 2021-06-18 19:53:35

use long long

prmondal: 2021-05-31 15:09:21

Make sure you are updating lazy nodes correctly otherwise having SegTree with LP would not serve any purpose.

Added by:Iqram Mahmud
Time limit:2.329s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own. Thanks to Emir Habul.