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
欢迎参加IJCAI 2020麻将智能体竞赛,大奖等你拿!Welcome to IJCAI 2020 Mahjong AI competition with amazing prizes! | 北京大学《ACM/ICPC大学生程序设计竞赛训练》暑期课面向全球招生!

我想写个线段树把1151和这个一起A了,结果在这个上面TLE了。。。 :P

Posted by userfriendly at 2009-03-19 20:05:33 on Problem 3277 and last updated at 2009-03-19 20:07:32
显然这个是1151的简化,用1151的 离散化+扫描+线段树应该是正确的,不过数据量大很多。。。
我用测试数据集的5000个的输入,还好,1秒不到,40000个数据的就算了3、4分钟才出结果,结果是对的。但是时间太长了。。郁闷。看来还是要按简化的思路来做。

。。。。。。
唉,做人不能懒惰到这个地步。。。

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