Help required in a Problem

Revision en3, by apoorv_01, 2020-05-12 14:48:02

I recently solved this problem using a simple backtracking algorithm. I thought it should give me TLE as the time complexity goes upto O(9^m) where max value of m = 1000, but it gave me AC. Can anyone explain me why?

Problem My Code

Tags time complexity, #tle

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English apoorv_01 2020-05-12 14:48:02 0 (published)
en2 English apoorv_01 2020-05-12 14:46:59 6
en1 English apoorv_01 2020-05-12 14:46:09 374 Initial revision (saved to drafts)