uva 816 BFS求最短路的经典问题……
2015-01-15 15:00
375 查看
一开始情况没有考虑周全,直接WA掉了,
然后用fgets()出现了WA,给改成scanf就AC了
题目不是很难,用心就好……
SAMPLE 3 1 N 3 3 1 1 WL NR * 1 2 WLF NR ER * 1 3 NL ER * 2 1 SL WR NF * 2 2 SL WF ELF * 2 3 SFR EL * 0 NOSOLUTION 3 1 N 3 2 1 1 WL NR * 1 2 NL ER * 2 1 SL WR NFR * 2 2 SR EL * 0 MyMaze 1 3 1 N 1 1 0 MyMaze 2 3 1 N 3 1 0 MyMaze 3 3 1 N 2 1 0 MyMaze 4 2 2 W 3 2 1 1 NR * 1 2 ER * 2 1 WR * 2 2 SF * 0 MyMaze 5 2 2 N 2 3 1 1 WL * 1 2 NL * 2 1 SF * 2 2 NR * 3 1 SL * 3 2 EL * 0 Circle 2 1 N 2 1 1 1 NR * 1 2 ER * 2 2 SF * 3 1 WR * 3 2 SR * 0 Robert Abbott's Atlanta Maze 4 2 N 4 3 1 1 NR WL * 1 2 NLR WF EFR * 1 3 EFR WFR NL * 1 4 ER NL * 2 1 SFL WL NFR * 2 2 EL SFLR WFRL NFL * 2 3 EFLR SF NF WFRL * 2 4 SR ELR NF * 3 1 WR SL * 3 2 EFL SLR WR NF * 3 3 EFL SLR WL * 3 4 EL SR * 0 ENDView Code
SAMPLE (3,1) (2,1) (1,1) (1,2) (2,2) (2,3) (1,3) (1,2) (1,1) (2,1) (2,2) (1,2) (1,3) (2,3) (3,3) NOSOLUTION No Solution Possible MyMaze 1 No Solution Possible MyMaze 2 No Solution Possible MyMaze 3 (3,1) (2,1) MyMaze 4 (2,2) (2,1) (1,1) (1,2) (2,2) (3,2) MyMaze 5 (2,2) (1,2) (1,1) (2,1) (3,1) (3,2) (2,2) (2,3) Circle (2,1) (1,1) (1,2) (2,2) (3,2) (3,1) (2,1) Robert Abbott's Atlanta Maze (4,2) (3,2) (2,2) (1,2) (1,3) (1,4) (2,4) (2,3) (2,2) (3,2) (3,1) (2,1) (1,1) (1,2) (2,2) (2,3) (2,4) (3,4) (3,3) (4,3)
相关文章推荐
- 【算法竞赛入门经典】6.4.2用BFS求最短路 例题6-14 UVa816
- UVA816(用BFS求最短路)(wf)
- Abbott的复仇(Abbott's Revenge, ACM/ICPC World Finals 2000, UVa 816)<经典BFS>
- 图-用DFS求连通块- UVa 1103和用BFS求最短路-UVa816。
- UVa 816 (BFS求最短路)
- UVA 816 Abbott's Revenge BFS求最短路+路径输出(详细注释)
- Uva oj 816 Abbott Revenge(BFS最短路)
- bfs Abbott的复仇 UVA 816
- UVA 11367 Full Tank?(bfs最短路)
- UVA 11367 Full Tank?(bfs最短路)
- UVA - 12124 Assemble(经典二分函数问题)
- UVA 11235 经典RMQ问题
- UVA - 524 Prime Ring Problem (经典回溯问题)
- 八数码问题 经典搜索 bfs
- UVALive 6665 Dragon&#226;s Cruller --BFS,类八数码问题
- UVa 816 - Abbott's Revenge(BFS+记录状态判重)
- UVALive 6665 Dragonâs Cruller --BFS,类八数码问题
- hdu1495(经典bfs,平分水问题)
- [算法入门经典] 区间最少覆盖问题 UVA 10020 - Minimal coverage
- POJ 1852 Ants || UVA 10881 - Piotr's Ants 经典的蚂蚁问题