We hope that you enjoyed the contest.
Let's discuss the problems.
UPD We are grateful to MikeMirzayanov for the opportunity to host the contest on Codeforces.
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
36:06:14
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
36:06:14
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| 3 | atcoder_official | 162 |
| 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
Время на сервере: 22.11.2024 05:28:47 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
It seems there are few participants whose results divided into 2 lines in ranklist
It looks like they used different accounts on different days. This will be corrected in the official results.
nice contest, me and oleh1421 have enjoyed it)) how many participants will get gold medal?
Will the test cases be published too?
How to solve task E (Challenges of urban planning) with centroid decomposition? I don't quite understand the idea of the editorial :(
What do you think how medals will be distributed?
Observe that if al < ar and dpl,r = true than al < al+1 < .. < ar−1 < ar. Hence there are only one m such that am = al+ar 2 . Find it using two pointers or binary search. al > ar similar.
I didnt understand this part, can someone expain it?
Problem B. Zhylan.io, It seems tutorial contains an error, you need to look for the maximum value a_i — pref_i-1 to check answer, not the minimal(subtask 3 and 4)
998kover, will be test cases and jury solutions added?
Is there any good explanations of IZHO 2022 problem's solution.