problem-https://cses.fi/problemset/task/1193/ code-Your text to link here... Time Limit exceed
problem-https://cses.fi/problemset/task/1193/ code-Your text to link here... Time Limit exceed
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
By looking at your code I guess you are visiting the same cell many times to find the shortest path from A to B and it is causing TLE. You can use the bfs to find the shortest path easily without visiting the same cell many times.
Can this problem solve using DFS?
I don't remember the question properly but I think it was not necessary to find the shortest path from A to B. I am not sure but I think you can solve it using dfs
I don't think you can as you're finding the shortest path. Your visited array isn't being used.