LITE  Light Switching
Farmer John tries to keep the cows sharp by letting them play with intellectual toys. One of the larger toys is the lights in the barn. Each of the N (2 <= N <= 100,000) cow stalls conveniently numbered 1..N has a colorful light above it.
At the beginning of the evening, all the lights are off. The cows control the lights with a set of N pushbutton switches that toggle the lights; pushing switch i changes the state of light i from off to on or from on to off.
The cows read and execute a list of M (1 <= M <= 100,000) operations expressed as one of two integers (0 <= operation <= 1).
The first kind of operation (denoted by a 0 command) includes two subsequent integers S_i and E_i (1 <= S_i <= E_i <= N) that indicate a starting switch and ending switch. They execute the operation by pushing each pushbutton from S_i through E_i inclusive exactly once.
The second kind of operation (denoted by a 1 command) asks the cows to count how many lights are on in the range given by two integers S_i and E_i (1 <= S_i <= E_i <= N) which specify the inclusive range in which the cows should count the number of lights that are on.
Help FJ ensure the cows are getting the correct answer by processing the list and producing the proper counts.
Input
Line 1: Two spaceseparated integers: N and M
Lines 2..M+1: Each line represents an operation with three spaceseparated integers: operation, S_i, and E_i
Output
Lines 1..number of queries: For each output query, print the count as an integer by itself on a single line.
Example
Input:
4 5
0 1 2
0 2 4
1 2 3
0 2 4
1 1 4
Output:
1
2
hide comments
deepak_bulani1:
20170517 17:13:10
use int instead of long long int and update lazy node everywhere in update method,costed me many WA. 

sultania23:
20170322 15:50:06
Good for learning lazy prop... 

sultania23:
20170322 15:50:06
Good for learning lazy prop... 

shahzada:
20170322 07:40:47
silly mistakes > 5WA


iam_ss:
20170316 16:46:11
Very basic question for learning Lazy Propagation in Segmented Trees. 

cake_is_a_lie:
20170302 02:36:56
cin/cout + segtree; O(N log^2(N)); 0.26s 

vengatesh15:
20170119 08:12:06
AC in 1 go:) 

satyam_22:
20170118 10:58:34
AC in one go !!!!!!!! 

akhil3sh:
20161112 18:27:34
ac in one go!! 

mrinal_aich:
20160811 09:46:47
Easy Implementation of Segment Trees. Use Lazy Propagation to meet the Time limit. 
Added by:  Iqram Mahmud 
Date:  20100903 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: OBJC VB.NET 
Resource:  USACO November 08 