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
shivam077:
20190322 08:31:16
cin,cout > TLE


abhimanyu_1998:
20190310 05:52:01
AC in one go


vinayakii:
20190115 08:29:58
tle in java 

shan61916:
20181225 15:59:02
Everyone, who just copy pasted FLIPCOIN from codechef, keep in mind that FLIPCOIN had a zero(0) based indexing while this question has a 1 based indexing. 

yaseenmollik:
20181115 00:29:21
AC in 2 go _ . Got TLE on first submission just for using cin, cout! Then used fast I/O and got accepted. Btw, it is my first problem using Lazy Propagation. Last edit: 20181115 00:31:00 

pola_pawaad59:
20181101 17:43:08
can anyone help me with this problem?


atharva_sarage:
20181028 20:38:54
easy peasy lemon squeezy 

ihg_2_26:
20181006 15:35:36
ez pz 

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 
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 