→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
09:32:54
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
09:32:54
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.11.2024 08:02:07 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
When someone takes first place in top contributors list you write blog. So again 'A week with second place in top contributors list'.
Of course that's the only reason Petr writes his blogs. You nailed it
Let's go further. That's why he became a programmer. What an attention seeker.
And we downvote each other, didn't you know?
So you are commenting to return it to recent actions and to allow to get even more pluses.
The truth has been revealed......
Does anyone know how to properly solve problem H? It looks like we screwed this one since we were the only team with >=6 problems which hasn't solved it, but I haven't heard about anyone who solved it faster than O(n3), everybody just "won with tests", solution presented on problem analysis turned out to be O(n3), not
as it was intended to and nobody knew how to fix it. Maybe some people were too shy to share their solution during problem analysis or someone not present on Petrozavodsk has solved it? Maybe Egor :)?
I've posted a link to a paper which provides a O(n*n) solution in the topic on the corresponding Opencup contest. Sorry for not linking here — CF textarea and search are still not that friendly to mobile devices, but you should still be able to find it.