Search found 2 matches
Search found 2 matches • Page 1 of 1
- Fri Dec 18, 2009 6:57 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10762 - Treasure Castle
- Replies: 12
- Views: 8978
I'm trying to solve this problem but i only get TLE. A changed my algorithm several times and my final algorithm is the best in performance. I implemented the A-star algorithm, with the manhatanian distance plus the number of steps being the value inserted in the priority queue. To skip the irreleva...
Please, i'm needing help... I had tried everything with this problem but I only get WA. I'm using backtracking+DP... Can anyone give me some test cases where my code fails? #include<iostream> #include<deque> #include<sstream> #include<string> #include<algorithm> #define LESTE 0 #define NORTE 1 #defi...