Submit | All submissions | Best solutions | Back to list |
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 Si and Ei (1 ≤ Si ≤ Ei ≤ N) that indicate a starting switch and ending switch. They execute the operation by pushing each pushbutton from Si through Ei 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 Si and Ei (1 ≤ Si ≤ Ei ≤ 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 space-separated integers: N and M
Lines 2 to M+1: Each line represents an operation with three space-separated integers: operation, Si, and Ei
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
Added by: | Iqram Mahmud |
Date: | 2010-09-03 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: OBJC VB.NET |
Resource: | USACO November 08 |
hide comments
|
||||||||||||||
2017-11-24 04:23:59
using cin, cout gave me TLE but scanf, printf got accepted. happened with anyone else? |
||||||||||||||
2017-10-24 18:10:36
A related problem is ``LightOJ 1080`` Last edit: 2017-10-24 18:11:33 |
||||||||||||||
2017-09-29 12:53:00
Lazyness Rocks.. :D Those getting WA at Test Case 10 kindly check the condition when lazy updates itself. :) |
||||||||||||||
2017-09-26 08:03:34
DO not forget to use boosting techniques like ios_base::sync_with_stdio(false),cin.tie(0) long long did work tho |
||||||||||||||
2017-09-04 13:29:53
Is this a USACO Problem? |
||||||||||||||
2017-08-09 10:36:47
You don't need to update the lazy array in the query function. Always check whether the lazy passing is correct. |
||||||||||||||
2017-07-22 22:10:31
AC in 1 go........... |
||||||||||||||
2017-07-21 22:17:03
good question for learning lazy propogation |
||||||||||||||
2017-07-01 08:00:15
Try Multiple of 3 question after this similar to this |
||||||||||||||
2017-06-11 14:08:02
long long int-->TLE , int->AC |