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大学生程序设计竞赛训练》暑期课面向全球招生!

spfa, 至少n*n, 居然C++ 297MS 过了

Posted by lddlinan at 2020-07-23 20:19:02 on Problem 1206
按rank分组从大到小对每个节点spfa,统计rank小于等于当前节点的interesting个数
如果知道某个节点最小距离的有某个上限,那么如果正在处理这个节点的时候最小距离比预估上限还大的时候那就不用着急用当前节点relax。
最小距离的上限可以按rank分组更新


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