Hello Codeforces community,
Here is a problem: http://www.spoj.com/problems/SOLVING/
How would you solve it? I don't want to skew your view, so I just leave the question without mentioning my (apparently too slow) solution.
Thanks, tom
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hello Codeforces community,
Here is a problem: http://www.spoj.com/problems/SOLVING/
How would you solve it? I don't want to skew your view, so I just leave the question without mentioning my (apparently too slow) solution.
Thanks, tom
Название |
---|
Hm?
Did you try using A-Star algorithm? I think search space is too big even for this algorithm but you can give it a try. Since optimal solution is not required you may use non-consistent heuristic to speed up the search.
Yes. My algorithm looks as follows:
My heuristic is simple sum of manhattan distances between current point and destination point for tiles <= i.
It works well except two last rows. Sometimes it takes a lot of time to finish them.
My bad XDDDD, ignore, its stupid
Look at the constraints, board can be up to 10x10