ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1699. Turning Turtles

Have wa #12
Posted by cap_prot 27 Jan 2013 18:46
My program is more advanced than LCA. It uses BFS and could work on arbitrary graphs. Could somebody help with this test? I know that if there is no bug with my program then there is a problem with connectivity of graph from start point to end point.
Re: Have wa #12
Posted by ძამაანთ [Tbilisi SU] 6 Aug 2013 19:17
Check for cases when start = end.

also don't use incorrect comparison. for example:

newPoint = point+delta

if(0<=newPoint && newPoint<w*h)