Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

用了heap，但100多ms，0ms是用的什么方法？

Posted by xiaolonghingis at 2006-10-04 21:29:17 on Problem 1475

Followed by:

图论 (0) sunmoonstar_love 2006-10-05 00:00:04
- Dijkstra? (0) xiaolonghingis 2006-10-05 00:02:31
  - 我再想想 (0) sunmoonstar_love 2006-10-05 00:07:33
    - 2次BFS (0) LegendaryDan 2006-10-05 00:08:37
      - 2次BFS？能具体点么？我就用了一次bfs+heap (0) xiaolonghingis 2006-10-05 00:13:11
        sorry, 没看清，我的也只有7Xms，先BFS箱子，然后BFS人. (0) LegendaryDan 2006-10-05 00:29:02
        恩，这个方法不错，普通bfs就可以搞定了。。 (0) xiaolonghingis 2006-10-05 00:54:00
        问个问题…… (93) byron 2006-10-27 20:24:30
        内详 (89) LegendaryDan 2006-10-27 20:45:47
        理解错了 2次的意思了。。。重写吧~~ (99) 411465294 2007-10-15 09:21:51
        通过割点和桥...可以直接确定出路径...O(MN)的...不过复杂了些... (99) lunatic 2007-10-15 10:28:51

Post your reply here:

Home Page Go Back To top

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