Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:这题要全搜的,怎么不会超时?

Posted by tzkq at 2010-06-18 13:29:56 on Problem 1154
In Reply To:Re:这题要全搜的,怎么不会超时? Posted by:fishing_test at 2009-04-22 19:42:00
And every position has most 3 directions to expand.

In this case, as the R,C's range and something unknown, the directions mostly less than 3, maybe 0,1,2.

So the time complexity upper limit is far below 3^25(8.47e11)

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator