There are q<=5*10^5 online queries of 2 types for a set of integers:
- Add an integer 1<=x<=10^9 to the set
- Find the minimum element >=x that isn't present in the set
Is there a way to efficiently process these queries?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 159 |
| 5 | atcoder_official | 156 |
| 6 | djm03178 | 153 |
| 6 | adamant | 153 |
| 8 | luogu_official | 149 |
| 9 | awoo | 148 |
| 10 | TheScrasse | 146 |
→ Find user
→ Recent actions
MEX Data structure
Revision en1, by kaldiuo, 2018-02-21 12:32:12
History
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/17/2025 07:01:47 (j1).
Desktop version, switch to mobile version.
Supported by
