Link to the question:- https://www.interviewbit.com/problems/rook-movement/
I tried BFS where in each state I store min steps,direction (up,down,left or right). I am getting TLE for large inputs.
Can someone help me ?
Thanks.
№ | Пользователь | Рейтинг |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
Link to the question:- https://www.interviewbit.com/problems/rook-movement/
I tried BFS where in each state I store min steps,direction (up,down,left or right). I am getting TLE for large inputs.
Can someone help me ?
Thanks.
Название |
---|
Why do you need to store the direction? BFS will never revisit the same cell due to the shortest number of steps property. And I also don't understand how you can get TLE because the input is small. Try posting your code here.
I thought that direction is required.
Consider the eg:-
000111
000000
where '1' denotes obstacles.
We can visit (1,2) in 2 steps in 2 ways from (0,0):-
1) (0,2) and (1,2)
2) (1,0) and (1,2).
Now if destination is (1,3), we would prefer 2nd) option over first as using first option would give 3 steps as answer but optimal answer to reach (1,3) should be 2.
Anyway, your method works as well. Just that I don't understand how you got TLE. Posting some code would certainly help people to determine the cause of the problem.
Added my code.