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.


Line 1: Two space-separated integers: N and M
Lines 2..M+1: Each line represents an operation with three space-separated integers: operation, S_i, and E_i


Lines 1..number of queries: For each output query, print the count as an integer by itself on a single line.


4 5
0 1 2
0 2 4
1 2 3
0 2 4
1 1 4


hide comments
Davit Safrastyan: 2016-12-10 18:41:43

Find the solutions of this problem in

akhil3sh: 2016-11-12 18:27:34

ac in one go!!

mrinal_aich: 2016-08-11 09:46:47

Easy Implementation of Segment Trees. Use Lazy Propagation to meet the Time limit.

satyroxx1397: 2016-08-03 05:58:28

Dont use long long int ! use int !- cost me several tle's! :(

weramajstor: 2016-07-16 14:13:33

My first lazy it took me 10 freaking hours summed to solve this.I can't describe my happiness now.

narutorocks: 2016-05-17 21:53:05

TLE with cin,cout and ios_base but AC(0.53) with scanf,printf

gohanssj9: 2016-05-17 10:54:47

Using fast i/o helps reducing time. Without fast i/o 0.50 s, with fast i/o 0.30s :)

SANDEEP KUMAR: 2016-01-26 13:17:26

May the laziness be with you...AC using C in 0.38s :)

minhthai: 2016-01-13 11:23:21

the laziness is high with this one :)
how to not get TLE with java ?

anshal dwivedi: 2015-12-24 13:52:42

Some times it's good to be lazy.... :)

Added by:Iqram Mahmud
Time limit:0.165s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: objc
Resource:USACO November 08