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
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | TheScrasse | 145 |
9 | nor | 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
Name |
---|
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