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
subodh898: 2019-11-15 06:24:49

segment tree + Lazy +Fast I/O only

sourav1996: 2019-09-20 19:47:30

Can it be solved without lazy propagation?

rezagoodarzi: 2019-08-08 06:03:48

badihi jat

landofkings: 2019-07-28 05:31:57

A good problem to learn lazy propogation.

saurabh8522: 2019-07-10 18:50:22

AC in one go !!!!!!!

namtruong: 2019-06-27 18:35:36

i didn't use bit operations and still got AC :))

Last edit: 2019-06-27 18:35:46
vph12112016: 2019-06-27 16:31:54

if u got TLE, let use bit instead of normal operation.... use k >> 1 instead of k * 2

Last edit: 2019-06-27 16:34:43
sagar_june97p: 2019-05-30 15:40:15

Use static array instead of vector and optimize for not visiting unnecessary nodes while update and query.
Also use Fast IO.

amantu_amir: 2019-04-03 23:10:06

AC after trying about a week,,
Nice problem,,

zakir068: 2019-03-30 07:39:58

woho 1st ac with lazy approach


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