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

比较好的想法

Posted by tzkq at 2009-11-14 00:54:24 on Problem 2676
把每个为0的点抽离出来作为待迭代的节点, 并根据原始宫格限制得到它能够达到的状态

再把所有节点按照它们的状态数来排序, 状态数越小的优先

一个简单的例子, 如果一个节点只有5这一种可能状态, 那么它应该先被扩展

当然任何一个节点状态数为0, 那么这个宫格fail



这样下来ac的时间是32ms, 不作排序的话大概是10倍左右






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