I tried many times, but I still don’t understand the test case. Could someone please explain it to me? Thank you so much!
https://onlinejudge.org/external/5/532.pdf
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 21.04.2026 03:34:54 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
This problem is the 3D version of finding the shortest path between two cells in a 2D grid. The dungeon is given to you in layers since it is 3D.
sorry but i still can't understand, could you explaint more detail (example path way from S to E in 11 minute)
First layer:go to cell (4, 4), that takes 8 minutes then go up, that takes 1 minute, now you are on the second layer in cell (4, 4) Second layer:go right to cell (4, 5), and then up, that takes two minutes Now you are on the third layer and in the end cell Total:11 minutes
okay i was understand, thank you so much