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
lamia2658:
20180613 21:05:46
if(lazy[node]%2 == 1)


dipankar12:
20180403 13:31:36
Time limit for JAVA is not correct. Got the same code AC with cpp 

vivek_shah98:
20180325 04:54:54
Same as FLIPCOIN problem on Codechef....


imperfectboy:
20180315 14:05:37
changing cout to printf ==== time 0.65>0.35 !!!! 

imperfectboy:
20180315 13:49:52
first lazy propagation problem !! phewww 

hitman007:
20180211 18:44:06
Anyone got accepted in Java ? I am getting TLE at test# 10. 

siva2697:
20180211 16:53:31
Funny and Nice


shubham_kira:
20180210 08:23:49
what do you mean @rareguy


ramini1996:
20180203 12:45:02
For 10th test case keep in mind that if you want to flip a range which already needs to be flipped then there is no need to flip at all. So, take care of it (just flip the boolean values of left and right child in lazy array instead of setting them to true !!! BTW nice question !!! 

shub120798:
20180131 19:10:19
segtree+node+lazy+swap. Finally learnt how to apply lazy propagation on nodes of seg tree 
Added by:  Iqram Mahmud 
Date:  20100903 
Time limit:  0.165s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: OBJC VB.NET 
Resource:  USACO November 08 