USACO Training 5.1 Snail Trials DFS Time Complexity

Revision en1, by miniluigi, 2016-10-30 17:00:41

Hello, I recently solved Snail Trails (problem statement here, and I have no idea why my code did not TLE. In fact, it finished in 0.011 seconds on all test cases. To summarize my approach, it's a brute-force DFS on every possible option. Can anyone help me analyze the time complexity of my code? Any help and insight would be appreciated. Thanks!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English miniluigi 2016-10-30 17:00:41 464 Initial revision (published)