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

被楼大叔小骗一下。不要用bitset。。

Posted by userfriendly at 2009-02-19 02:13:19 on Problem 1742 and last updated at 2009-02-19 03:22:37
In Reply To:55用了楼大叔PPT的方法，多重背包化0－1和bitset，还是超（代码） Posted by:userfriendly at 2009-02-19 00:47:37 
用86085的数据
按楼大叔的男人PPT做法，用bitset要3.2秒。。。 STL害死人
改了不用bitset用bool[]+memcpy 0.4秒左右
虽然还是不能过，不过应该可以更快的

唉 用另外一个算法过了算了
用86085那组测试，第二个方法比第一个方法快大约0.1秒，提交就能过，第一个方法提交就不行
做男人真难啊！！！
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