TCO17 Algorithm Round 2B will start at 12 noon EDT, Saturday, July 8, 2017.
Let's discuss the problems after contest here.
→ Обратите внимание
До соревнования
2023 Post World Finals Online ICPC Challenge powered by Huawei
43:02:17
Зарегистрироваться »
2023 Post World Finals Online ICPC Challenge powered by Huawei
43:02:17
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 04.05.2024 22:57:43 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
Approach for 300?
Choose the smallest string with "largest prefix of length k".
Well my linear hard fell with TL at some test with small double numbers. It works 3s at this particular maxtest (at others < 100ms). And changing long double to double speeds up the solution in 7 times. That's how I lost the first place.)
At least you became target again.
Approach for 500 pts?
For each connected component of equal letters find minimal and maximal height [l, r]. now you have the set of segments. And answer is number of ways to choose some segments so that their union covers the entire array of heights, this can be calculated with dp.
Solution for 1000?