Zeros and Ones

★★★★★

4.5

42 votes

Bit Manipulation, Data Structures, Easy, Segment Trees

Details

Submissions

Discussion

Editorial

Problem

You are given an array A which contains initially only ones. You can perform two operations:

$0\;I$ : Given an index I, update the value of $A_I$ to zero.
$1\;K$ : Given the value K, print the index of $K^{th}$ one in the array A. If there is no such index then print 1.

Input:
The first line of input contains N, the size of the array. The second line contains Q, number of operations. Next Q line contains one of the two operations.

Output:
Print the output for the second type of queries in a new line.

Constraints:
$1 \le N \le 10^6$
$1 \le Q \le 10^6$
$1 \le I \le N$
$1 \le K \le N$

Time Limit: 2

Memory Limit: 256

Source Limit:

Explanation

The initial array A: $[1, 1, 1, 1, 1, 1]$

$5^{th}$ one is at position 5.
Update the $2^{nd}$ index to zero. After update array A: $[1, 0, 1, 1, 1, 1]$
$5^{th}$ one is at position 6.