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.
0 1 2
0 2 4
1 2 3
0 2 4
1 1 4
|Added by:||Iqram Mahmud|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: SCM chicken VB.net|
|Resource:||USACO November 08|
use scanf and printf instead of cout and cin .... gives TLE
My first lazy feeling :D :P
Wow...For the first time I am feeling LAZY....
DEEPAK KUMAR SINGH:
Wonderful..My first lazy Propogation+segment tree...
cant believe my own stupidity.... got so many TLE for using cout -_-Last edit: 2014-12-29 03:06:50
long long gives TLE.. AC with int
There's nothing mysterious about the 10th test-case at all, a trivial flaw related to calculation of lit lights by combining lazy updates and current values was my cause of WA. Just go through the code carefully once.
Please, give some example with the same trick, as in test 10. I'm using segment tree with lazy propagation, updating the nodes everywhere, where needed, and pushing down correctly, still got WA. My code: http://ideone.com/Hh0mqL
Use faster input output to avoid TLE.
exactly same as flipcoin only difference is that flipcoin has 0 based indexing and here its 1 based costed me 5 WA