搜索--BFS
codancer
为信仰而战斗
展开
-
POJ3278 Catch That Cow
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,0...原创 2018-02-08 12:10:12 · 122 阅读 · 0 评论 -
【HDU 1242】Rescue(基础bfs)
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37157 Accepted Submission(s): 12913 Problem DescriptionAngel was caught by the ...原创 2018-08-03 10:02:43 · 130 阅读 · 0 评论 -
【洛谷 P1141】01迷宫(记忆化BFS)
P1141 01迷宫 6.4K 通过 32.7K 提交 题目提供者 评测方式 云端评测 标签 高性能 难度 普及/提高- 时空限制 1000ms / 128MB提示:收藏到任务计划后,可在首页查看。 最新讨论 推荐的相关题目 题目描述 有一个仅由数字00与11组成的n \times nn×n格迷宫。若你位于一格0上,那么你可以移动到相邻44格中的某一格11上,同样若你...原创 2018-08-31 13:58:05 · 575 阅读 · 1 评论 -
【HDU 1104】Remainder (BFS+数论)
Remainder Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4720 Accepted Submission(s): 1192Problem Description Coco is a clever boy, wh...原创 2018-09-04 09:25:59 · 183 阅读 · 0 评论 -
2013GCPC C题 Chess(BFS+路径打印)
https://www.jisuanke.com/contest/1546/100748 基础的BFS和路径输出,方向开多一点就好了。#include<bits/stdc++.h>using namespace std;const int maxn = 100050;struct point{ int x,y; int pre; int step...原创 2018-09-04 15:50:30 · 194 阅读 · 0 评论 -
【2018 ICPC北京网赛】 A Saving Tang Monk II(BFS)
《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng’en during the Ming Dynasty. In this novel, Monkey King Sun Wukong, pig ...原创 2018-09-22 17:52:34 · 326 阅读 · 0 评论