HI,
After I got the idea of this problem and solved it true, it's my first time to solve E during contest but sadly I got TLE it seems that the time limit is too strict.
I used loop in My Ternary search (my loop limit is 400 ) and It got TLE ,after the contest I changed it to 398 and it suddenly passed.
I asked about that in a comment and ho-jo-bo-ro-lo told me he use 500 in loop and it passed but I have to use cin.tie(0);
what about submitting the same code twice with cin.tie(0) one got TLE and the other got Accepted.
Accepted
Time limit exceeded on test 22
during the contest I got TLE on Testcase #15 so if the TLE because reading and writing speed I think testcase 13,14 has the maximum limit and similar numbers so why it passed them and failed in 15.
Thanks
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 164 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 15.05.2026 02:16:15 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Why ternary? Binary, let's look. It's easier and faster. Second. 400 — it's too much. 100-200 for ternary search it's enough, 30-50 it's enough for binary(i used 100 because time limit was very good)
Why ternary? This is the idea I came with during the contest
also I know that 400 is large number but I think making test-cases passed for 398 and TLE on 400 is really weird.
Nothing weird. You're just unlucky man. But my solution show you that you can solve this problem without any hacks like change loop limit
:D but what about submitting the same solution twice with different results (I used cin.tie(0) for both :D
Just random. It can happened.
actually 64 is enough in all cases because each iteration sets at least 1 correct bit in answer
You're right. But at this problem 40 is enough
Technically, yes, this is possible, but it requires every step of the binary search to partition the set of remaining values exactly in half. The set of numbers that can be represented by floats (or (long) doubles for that matter) is more dense around 0 than it is towards 1e300. If you use (l + r) / 2 as a midpoint formula, you won't get a nice 50/50 partition, and you will require more than 64 iterations.
This isn't true for doubles since they have exponential bits. As an example you have to halve 1.0 1075 times for it to become zero.