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
if(lazy[node]%2 == 1)
Time limit for JAVA is not correct. Got the same code AC with cpp
Same as FLIPCOIN problem on Codechef....
changing cout to printf ==== time 0.65---->0.35 !!!!
first lazy propagation problem !! phewww
Anyone got accepted in Java ? I am getting TLE at test# 10.
Funny and Nice
what do you mean @rareguy
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 !!!
segtree+node+lazy+swap. Finally learnt how to apply lazy propagation on nodes of seg tree