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.
→ Pay attention
Before contest
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
3 days
Register now »
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
3 days
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/14/2026 20:58:42 (g2).
Desktop version, switch to mobile version.
Supported by
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.