BFS+DFS
文章平均质量分 78
陶鸿杰
这个作者很懒,什么都没留下…
展开
-
HDU - 1312 Red and Black————搜索
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’...原创 2018-08-05 10:12:22 · 398 阅读 · 0 评论 -
FZU2109 Mountain Number——————数位DP
Mountain NumberAccept: 351 Submit: 875Time Limit: 1000 mSec Memory Limit : 32768 KBProblem DescriptionOne integer number x is called “Mountain Number” if:(1) x>0 and x is an integer;(2)...原创 2019-04-10 20:57:45 · 202 阅读 · 0 评论 -
FZU 2107 Hua Rong Dao——————DFS
Hua Rong DaoAccept: 523 Submit: 1086Time Limit: 1000 mSec Memory Limit : 32768 KBProblem DescriptionCao Cao was hunted down by thousands of enemy soldiers when he escaped from Hua Rong Dao. ...原创 2019-04-10 20:16:37 · 342 阅读 · 0 评论 -
HDU 1269迷宫城堡——————强连通模板(Kosaraju算法)
Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4952 Accepted Submission(s): 2205Problem DescriptionTo see a World in a Gr...原创 2019-05-14 18:49:29 · 204 阅读 · 0 评论 -
POJ 2186 Popular Cows——————(Kosaraju求强连通分量,缩点)
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 42216 Accepted: 17135DescriptionEvery cow’s dream is to become the most popular cow in the herd. In a herd of N (1 <= N &...原创 2019-05-14 18:57:20 · 232 阅读 · 0 评论 -
HDU 1827 Summer Holiday——————(Kosaraju求强连通分量,缩点)
Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4954 Accepted Submission(s): 2207Problem DescriptionTo see a World in a Gr...原创 2019-05-14 19:00:28 · 203 阅读 · 0 评论 -
HDU 2767 Proving Equivalences——————Kosaraju求强连通分量
Proving EquivalencesProblem DescriptionConsider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove that the following statements are equivalent:A i...原创 2019-05-15 18:32:16 · 188 阅读 · 0 评论 -
HDU 3836Equivalent Sets——————Kosaraju求强连通分量
Equivalent SetsProblem DescriptionTo prove two sets A and B are equivalent, we can first prove A is a subset of B, and then prove B is a subset of A, so finally we got that these two sets are equiva...原创 2019-05-15 20:45:42 · 193 阅读 · 0 评论 -
POJ 3669 Meteor Shower——————bfs
Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31235 Accepted: 8037DescriptionBessie hears that an extraordinary meteor shower is coming; reports say that these meteors w...原创 2019-07-29 08:25:06 · 169 阅读 · 0 评论 -
POJ 3050 Hopscotch——————dfs
HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6738 Accepted: 4338DescriptionThe cows play the child’s game of hopscotch in a non-traditional way. Instead of a linear set of ...原创 2019-07-29 08:29:18 · 178 阅读 · 0 评论 -
POJ 3009 Curling 2.0——————dfs
Curling 2.0今年的奥运会之后,在行星mm-21上冰壶越来越受欢迎。但是规则和我们的有点不同。这个游戏是在一个冰游戏板上玩的,上面有一个正方形网格。他们只用一块石头。游戏的目的是让石子从起点到终点,并且移动的次数最小图1显示了一个游戏板的例子。一些正方形格子可能被砖块占据。有两个特殊的格子,起始点和目标点,这是不占用块。(这两个方块是不同的)一旦石头开始移动就不会停下,除非它击中砖块块...原创 2019-07-20 16:27:16 · 268 阅读 · 0 评论 -
I - 放苹果
HPU专题训练(2)BFS&amp;&amp;DFS___I - 放苹果 把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。Input第一行是测试数据的数目t(0 <= t <= 20)。以下每行均包含二个整数M和N,以空格分开。1<=M,N<=10。Ou...原创 2018-03-16 13:10:45 · 239 阅读 · 0 评论 -
P1101 单词方阵——————暴力或者DFS
P1101 单词方阵题目描述给一n \times nn×n的字母方阵,内可能蕴含多个“yizhong”单词。单词在方阵中是沿着同一方向连续摆放的。摆放可沿着 88 个方向的任一方向,同一单词摆放时不再改变方向,单词与单词之间可以交叉,因此有可能共用字母。输出时,将不是单词的字母用*代替,以突出显示单词。例如:输入: 8 输出: qyiz...原创 2019-01-12 23:54:29 · 296 阅读 · 0 评论 -
Codefoces 977E - Cyclic Components——————dfs
Cyclic ComponentsYou are given an undirected graph consisting of n vertices and m edges. Your task is to find the number of connected components which are cycles.Here are some definitions of graph t...原创 2018-12-11 19:40:54 · 305 阅读 · 0 评论 -
HDU 2612 Find a way ——————BFS + 打表
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24190 Accepted Submission(s): 7911Problem D...原创 2018-09-09 09:08:34 · 226 阅读 · 0 评论 -
POJ 2251 Dungeon Master ——————BFS
Dungeon MasterLanguage:DefaultDungeon MasterTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 48826Accepted: 18436DescriptionYou are trapped in a 3D dungeon and need to find the quickest ...原创 2018-09-09 21:54:47 · 217 阅读 · 0 评论 -
POJ 3278 Catch That Cow —————— BFS
Language:DefaultCatch That CowTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 120100Accepted: 37481DescriptionFarmer John has been informed of the location of a fugitive cow and wants to ...原创 2018-09-09 22:42:03 · 158 阅读 · 0 评论 -
POJ 2312 Battle City ——————BFS
Language:DefaultBattle CityTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10110Accepted: 3364DescriptionMany of us had played the game “Battle city” in our childhood, and some people (li...原创 2018-09-12 22:47:01 · 214 阅读 · 0 评论 -
HDU 2011 How Many Equations Can You Find ——————DFS
How Many Equations Can You FindTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1477 Accepted Submissi...原创 2018-09-07 10:13:14 · 143 阅读 · 0 评论 -
HDU 1241 Rescue ——————BFS , 优先队列
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37778 Accepted Submission(s): 13101Problem Desc...原创 2018-09-07 11:12:44 · 309 阅读 · 0 评论 -
HDU 1372 Knight Moves——————BFS , 优先队列
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13742 Accepted Submission(s): 8060Problem...原创 2018-09-07 13:45:04 · 276 阅读 · 0 评论 -
POJ 1426 Find The Multiple ——————DFS
Find The Multiple Language:DefaultFind The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 42225Accepted: 17735Special JudgeDescriptionGiven a positive integer n, write a program ...原创 2018-09-10 23:11:57 · 174 阅读 · 0 评论 -
POJ 3984 迷宫问题 —————— BFS
Language:Default迷宫问题Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 34377Accepted: 19563Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0...原创 2018-09-13 17:09:15 · 221 阅读 · 0 评论 -
LightOJ - 1141 Number Transformation ——————BFS+素因子分解
Number Transformation In this problem, you are given an integer number s. You can transform any integer number A to another integer number B by adding x to A. This x is an integer number which is a ...原创 2018-09-13 22:00:32 · 189 阅读 · 0 评论 -
Aize 0558 Cheese——————BFS
Cheese問題在H * W的地图上有N个奶酪工厂,每个工厂分别生产硬度为1-N的奶酪。有一只老鼠准备从出发点吃遍每一个工厂的奶酪。老鼠有一个体力值,初始时为1,每吃一个工厂的奶酪体力值增加1(每个工厂只能吃一次),且老鼠只能吃硬度不大于当前体力值的奶酪。 老鼠从当前格到上下左右相邻的无障碍物的格需要时间1单位,有障碍物的格不能走。走到工厂上时即可吃到该工厂的奶酪,吃奶酪时间不计。问吃遍所有奶...原创 2019-07-20 19:46:41 · 176 阅读 · 0 评论