Need help in solving the following Codechef problem :
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
25:15:50
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
25:15:50
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 16:19:10 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by yesnomaybe (previous revision, new revision, compare).
Auto comment: topic has been updated by yesnomaybe (previous revision, new revision, compare).
You can interpret the tasks as nodes in a graph. There is a directed edge (because of the index restriction) $$$v \rightarrow u$$$ if $$$u$$$ can be completed immediately after $$$v$$$. Since there are $$$10^3$$$ tasks, the maximum number of edges is around $$$10^6$$$, which is fine.
The problem can be understood as "choosing the minimum number of directed paths such that you visit each vertex exactly once". I have seen this problem here and the only editorial I know of is this YouTube video.