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
mulx20:
20200718 18:33:19
urielguz33 Thanxx 

mestu_paul:
20200707 17:11:10
AC in one go and it is first segment tree problem in my coding life that i got ac in one go


aayush_b1999:
20200610 00:14:01
spoj has a system to tell the verdict after processing all test cases. So you may be failing any of the 10 test cases, not a specific one 

shammya:
20200519 08:26:53
Great problem to start with segment tree lazy propagation


amansahu112:
20200421 12:04:14
AC in 1 go.


perdedor_9:
20200415 14:20:09
naive algorithom with optimization got ac in one go


urielguz33:
20191226 23:30:24
For the 10th case, try updating a segment that shares nodes that are both turned off and on. My error was assuming that if a whole segment was to be changed then there were only two possibilities: either the sum is 0 (because the segment is completely turned off) or the sum is the size of the segment (because the segment is completely turned on), then I realized there is an intermediate state: when you turn things on and off in the same segment, resulting in the difference between the size of the interval and the nodes that *will* be turned off. After fixing that I got acc :). Last edit: 20191226 23:32:42 

duet_cse16:
20191123 15:44:46
Last edit: 20191123 15:45:10 

codefresher:
20191123 10:24:54
AC in one go....But How to solve this without lazy propagation??? 

bad_bat:
20191005 17:58:02
AC in one go!

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 