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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
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
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