BFS&DFS
BLF2
这个作者很懒,什么都没留下…
展开
-
poj 3278 ——Catch That Cow(bfs)
Catch That CowTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 48099Accepted: 15070DescriptionFarmer John has been informed of the location of a fugit原创 2014-10-22 15:50:20 · 545 阅读 · 0 评论 -
SDUTOJ 2138 图结构练习——BFSDFS——判断可达性(以边表为数据结构)
题目描述 在古老的魔兽传说中,有两个军团,一个叫天灾,一个叫近卫。在他们所在的地域,有n个隘口,编号为1..n,某些隘口之间是有通道连接的。其中近卫军团在1号隘口,天灾军团在n号隘口。某一天,天灾军团的领袖巫妖王决定派兵攻打近卫军团,天灾军团的部队如此庞大,甚至可以填江过河。但是巫妖王不想付出不必要的代价,他想知道在不修建任何通道的前提下,部队是否可以通过隘口及其相关通道到达近卫军团展开攻击。原创 2014-04-18 00:30:10 · 1373 阅读 · 0 评论 -
SDUTOJ 3058 路线冲突问题 ——bfs记录路径
路线冲突问题Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述给出一张地图,地图上有n个点,任意两点之间有且仅有一条路。点的编号从1到n。现在兵团A要从s1到e1,兵团B要从s2到e2,问两条路线是否会有交点,若有则输出交点个数,否出输出”success”。输入原创 2014-12-13 20:39:26 · 564 阅读 · 0 评论 -
SDUTOJ 2193 救基友3 用二进制作为第三维坐标的BFS
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述 话说CZ由于不守基道,被妖怪抓走了,好基友WP在努力讨好高富帅RQ救出CZ的同时,CZ也意识到了自己的错误,然后努力的想逃出妖怪的闺房。 妖怪的闺房是一个n*m的矩阵,并且某些地方安装了带锁的门,钥匙藏在闺房另外的某些地方。刚开始WP被关在(sx,sy)的原创 2014-08-01 20:40:43 · 832 阅读 · 0 评论 -
POJ 3083 Children of the Candy Corn BFS算法
Children of the Candy CornTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10144Accepted: 4405DescriptionThe cornfield maze is a popular Halloween tre原创 2015-01-19 18:26:28 · 548 阅读 · 0 评论 -
POJ 2488 A Knight's Journey --- DFS
A Knight's JourneyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 32838Accepted: 11182DescriptionBackground The knight is getting bored of seeing t原创 2015-02-19 23:51:40 · 495 阅读 · 0 评论 -
ZOJ 1649 Rescue
RescueTime Limit: 2 Seconds Memory Limit: 65536 KB Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to原创 2015-03-25 19:24:11 · 489 阅读 · 0 评论 -
ZOJ 2412 Farm Irrigation 建图BFS
Farm IrrigationTime Limit: 2 Seconds Memory Limit: 65536 KB Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water原创 2015-04-20 16:12:35 · 573 阅读 · 0 评论 -
ZOJ 2165 POJ 1979 Red and Black DFS水题
Red and BlackTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 24766Accepted: 13359DescriptionThere is a rectangular room, covered with square tiles. E原创 2015-04-20 16:28:34 · 666 阅读 · 0 评论 -
POJ 2049 Finding Nemo 建图/BFS
Finding NemoTime Limit: 2000MSMemory Limit: 30000KTotal Submissions: 7923Accepted: 1829DescriptionNemo is a naughty boy. One day he went into the deep sea all原创 2015-01-18 17:24:16 · 599 阅读 · 0 评论 -
UVA 253 ---Cube painting BFS
Cube paintingTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluDescription Cube painting We have a machine for painting cubes. It is suppl原创 2014-12-21 18:54:12 · 825 阅读 · 0 评论 -
UVAOJ 10010 —— Where's Waldorf? 搜索(照着一个方向一直搜)
Where's Waldorf? Given a m by n grid of letters, ( ), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line o原创 2014-12-03 10:28:24 · 704 阅读 · 0 评论 -
SDUTOJ 2142 数据结构实验图论一:基于邻接表的广度优先搜索遍历
数据结构实验之图论二:基于邻接表的广度优先搜索遍历Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述给定一个无向连通图,顶点编号从0到n-1,用广度优先搜索(BFS)遍历,输出从某个顶点出发的遍历序列。(同一个结点的同层邻接点,节点编号小的优先遍历)输入输入第一行为整数n原创 2014-08-19 15:56:31 · 833 阅读 · 0 评论 -
poj 1753 Flip Game——DFS(分类是枚举)
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 29494 Accepted: 12762DescriptionFlip game is played on a rectangular 4x4 field with two-sided p原创 2014-06-15 21:35:37 · 754 阅读 · 0 评论 -
UVA 657 The die is cast ——bfs+dfs
The die is castInterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market analysis has alerted them to the原创 2014-08-18 09:16:43 · 615 阅读 · 0 评论 -
SDUTOJ 2141 ——数据结构实验图论一:基于邻接矩阵的广度优先搜索遍历
数据结构实验图论一:基于邻接矩阵的广度优先搜索遍历Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述给定一个无向连通图,顶点编号从0到n-1,用广度优先搜索(BFS)遍历,输出从某个顶点出发的遍历序列。(同一个结点的同层邻接点,节点编号小的优先遍历)输入输入第一行为整数n原创 2014-08-19 16:10:57 · 766 阅读 · 0 评论 -
SDUTOJ 2780 ——Pots BFS
PotsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述You are given two pots, having the volume of A and B liters respectively. The following operations can be performed原创 2014-09-17 21:55:29 · 551 阅读 · 0 评论 -
poj 2965 The Pilots Brothers' refrigerator——DFS(分类是枚举)
The Pilots Brothers' refrigeratorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17929Accepted: 6794Special JudgeDescriptionThe game “The Pil原创 2014-06-18 18:38:56 · 539 阅读 · 0 评论 -
HDOJ 1253 ——胜利大逃亡 三维BFS
胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25283 Accepted Submission(s): 9676Problem DescriptionIgnatius被魔王抓走了,有一天魔王出原创 2014-08-01 20:44:16 · 617 阅读 · 0 评论 -
POJ 3026 —— Borg Maze BFS + 最小生成树
Borg MazeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9071Accepted: 3019DescriptionThe Borg is an immensely powerful race of enhanced humanoids fr原创 2015-01-26 20:07:41 · 576 阅读 · 0 评论 -
ZOJ 1091 POJ 2935 Knight Moves BFS水题
Knight MovesTime Limit: 2 Seconds Memory Limit: 65536 KB A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knig原创 2015-04-21 20:10:37 · 703 阅读 · 0 评论