I want to code A. Get together with approach by limiting value of f(t) ? but i cant get through it ? can i use sweep line algorithm.... after limiting value?and how to code it?here is link to question https://mirror.codeforces.com/edu/course/2/lesson/6/3/practice/contest/285083/problem/A
Пожалуйста, прочтите новое правило об ограничении использования AI-инструментов.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 164 |
| 2 | Um_nik | 163 |
| 3 | atcoder_official | 158 |
| 3 | cry | 158 |
| 3 | -is-this-fft- | 158 |
| 6 | awoo | 156 |
| 7 | adamant | 154 |
| 7 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 11.10.2024 01:25:57 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
You can binary search on the answer, and maintain a segment that everyone can reach. If the segment is non-empty then the value is ok.
i find function to be unimodal so ternary search is most optimal then binary search.
How is the function unimodal?
by general intution plot will be minima type where at local minima there will be minimum time requird for all peoples to collect at place.
still can get more precise
What is your definition of $$$f(t)$$$?
Not understood can you tell briefly about it
https://pastebin.com/FyrFZyUw <= my code
I am getting ans = 1.4 on
5 -1 5 10 3 4 2 7 10 8 1
but the ans is 1.5