I have applied BFS and i am getting TLE for it tell how to do that??
I have applied BFS and i am getting TLE for it tell how to do that??
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | nor | 154 |
5 | maroonrk | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Название |
---|
You haven't posted your code so I have to guess. :p
Maybe from a given position (x, y), you are checking ALL the positions you can move to, in a single move (there are O(N) positions for each (x,y)). This gives you a time complexity of O(N*N*N) instead of O(N*N). Instead, from (x, y), you can just check the 8 immediate adjacent positions you can move to and update cost accordingly. Along with (x, y), store a parameter dir storing the direction you are moving in currently. So, if you keep moving along the same direction, you incur a cost of 0, while it costs 1 to change direction. Final ans is the total number of times you change direction.