Initially the array contain all 1s.
There are two type of operation:
1 A: update arr[A] = 0.
2 A: Find index of Ath 1 in the array.
Number of elements, 1<=N<=(1e6)
Number of queries, 1<=Q<=(1e6)
I tried tree statistic. However, it didn't pass.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Query solving in most optimised way
Initially the array contain all 1s.
There are two type of operation:
1 A: update arr[A] = 0.
2 A: Find index of Ath 1 in the array.
Number of elements, 1<=N<=(1e6)
Number of queries, 1<=Q<=(1e6)
I tried tree statistic. However, it didn't pass.
Name |
---|