CSE Python LAB: Question 2} You initially start with a binary string S0 which is of length N and has all 0s. You are then given U updates, which keep transforming the string. The i-th update transforms the string Si-1 into Si, and hence after all the U updates you will be left with SU. A single update is of the form (Li, Ri), which means that all the 1s in the range [Li, Ri] (both end points included) should be changed into 0s, and all the 0s in that range should be changed to 1s. You need to find out which among the U+1 binary strings: S0, S1, .., SU, is lexicographically the largest, and print that string. You have to develop a python program that output a single line containing one binary string Sample Input: 10 10 9 10 6 10 9 10 1 8 3 5 3 3 3 4 3 9 4 8 7 7 Sample Output: 1111100011
CSE Python LAB:
Question 2} You initially start with a binary string S0 which is of length N and has all 0s. You are then given U updates, which keep transforming the string. The i-th update transforms the string Si-1 into Si, and hence after all the U updates you will be left with SU. A single update is of the form (Li, Ri), which means that all the 1s in the range [Li, Ri] (both end points included) should be changed into 0s, and all the 0s in that range should be changed to 1s. You need to find out which among the U+1 binary strings: S0, S1, .., SU, is lexicographically the largest, and print that string.
You have to develop a python program that output a single line containing one binary string
Sample Input:
10 10
9 10
6 10
9 10
1 8
3 5
3 3
3 4
3 9
4 8
7 7
Sample Output:
1111100011
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
