PAT--Saving James Bond - Hard Version
来源:互联网 发布:执行仪表板软件 编辑:程序博客网 时间:2024/06/07 15:32
这题算是经典BFS了,不贴代码,只说两件事。
用例四没过说明,“If there are many shortest paths, just output the one with the minimum first jump, which is guaranteed to be unique.”这句话你没看到。。
额,我看到了,但是我以为是下标最小,事实上是第一只鳄鱼距离出发点最近的那个。。。
用例五没过说明,额,007能够不借助鳄鱼直接跳到岸上的情况你没考虑,汗。。。。。这个。。
0 0
- PAT--Saving James Bond - Hard Version
- Saving James Bond - Hard Version
- PAT-Saving James Bond - Easy Version (25)
- PAT 数据结构 06-图4. Saving James Bond - Hard Version (30)
- 06-1. Saving James Bond - Hard Version (30) BFS
- 07-图4. Saving James Bond - Hard Version (30)
- 06-图4. Saving James Bond - Hard Version (30)
- 06-图4. Saving James Bond - Hard Version (30)
- 06-图4. Saving James Bond - Hard Version (30)
- 06-图4. Saving James Bond - Hard Version (30)
- 07-图5 Saving James Bond - Hard Version
- MOOC PTA 07-图5 Saving James Bond - Hard Version
- 07-图5 Saving James Bond - Hard Version
- 07-图5 Saving James Bond - Hard Version
- 07-图5 Saving James Bond - Hard Version
- 07-图5 Saving James Bond - Hard Version (30分)
- 5-11 Saving James Bond - Hard Version (30分)
- pat 06-图2. Saving James Bond - Easy Version (25)
- 【云分析】之七《80%的企业正在或考虑使用行业云》
- C# StreamReader类 basestream.seek(0,seekorigin.begin)
- POJ 2479 Maximum sum ( DP )
- 二叉树的基本性质、存储方式与遍历(Python实现)
- github之Feature分支
- PAT--Saving James Bond - Hard Version
- Unity 3D
- HDU 4687 Boke and Tsukkomi (一般图匹配带花树)
- 分布式消息系统—kafka入门
- linux 动态链接库
- POJ 3041 - Asteroids(二分图匹配)
- Sizeof
- HDU 1593 find a way to escape
- hackerrank <Team Formation>