MULTQ3 - Multiples of 3


There are N numbers a[0],a[1]..a[N - 1]. Initally all are 0. You have to perform two types of operations :

1) Increase the numbers between indices A and B (inclusive) by 1. This is represented by the command "0 A B"
2) Answer how many numbers between indices A and B (inclusive) are divisible by 3. This is represented by the command "1 A B".

Input

The first line contains two integers, N and Q. Each of the next Q lines are either of the form "0 A B" or "1 A B" as mentioned above.

Output

Output 1 line for each of the queries of the form "1 A B" containing the required answer for the corresponding query.

Sample

Sample Input :
4 7
1 0 3
0 1 2
0 1 3
1 0 0
0 0 3
1 3 3
1 0 3

Sample Output :
4
1
0
2

Constraints

1 <= N <= 100000
1 <= Q <= 100000
0 <= A <= B <= N - 1


hide comments
harshit_walia: 2017-02-12 11:34:46

After 4 hrs of debugging.. it finally got accepted.
52nd ;')

shubham2305: 2017-01-23 20:54:27

c++ 4.3.2 compilation error
c++14 ac
don't now why compilation error for c++4.3.2

vivek4434: 2016-12-20 08:43:00

why i'm getting TLE ...
i'm using BIT..

conquistador: 2016-12-06 19:10:21

#caution #hint
just take care what you need to store in nodes and how many types of updates are possible........also take care while updating leaves of segment tree...

ashishranjan28: 2016-11-03 08:49:05

long long int causes several tle for me...
use int

uddhav: 2016-11-02 16:18:05

using long long int gives tle on test 9. Same code with int gives AC !!

pranavanurag: 2016-08-27 09:37:05

If getting WA, check the way you are propagating laziness. Took me a day to debug..

Last edit: 2016-08-27 10:04:44
force_sust: 2016-08-15 19:43:08

why its wa in test 9...??

ajay_5097: 2016-05-23 19:38:37

IT felt so good !
AC in 1 go :)
Segmented Tree + Lazy Propagation
O (n + Q*logn)

epsilon: 2015-08-26 13:48:38

thanks to vimarsh for fast i/o


Added by:Varun Jalan
Date:2010-09-12
Time limit:0.169s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS OBJC VB.NET
Resource:own problem