Hi,
I was thinking about 442-div 2-D problem and I come up with noting except a bad solution.
as I say it was a bad solution because it run from O(n*m*k) thus it should get TLE but I got an AC!?
can anybody say just why?????
sorry for bad Eng.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 06.11.2026 05:56:38 (k1).
Десктопная версия, переключиться на мобильную.
При поддержке
Your solution isn't O(nmk) due to
if(...||mrk[x][y][i])break;. Try to construct a worse case scenario for simple map with m=1 and you'l see that factor k doesn't apply.So you mean I didn't implement what I wanted??
and could you say why that
if(...||mrk[x][y][i])break;make Order better????Can we tell that worst case complexity is O(n*m) by bfs?
You can't enter in vertex more than 4 times, so your solution is O(nm).
WoW.!!!!! Tank you.