ACM_搜索
关注
分享
扫一扫
文章平均质量分 84
AC_Dreameng
行有余力,则来刷题!
展开
-
HDU 2553 N皇后问题(还是DFS呀)
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15739 Accepted Submission(s): 7154Problem Description在N*N的方格棋盘放置了N个皇后，使得原创 2016-03-29 13:55:22 · 931 阅读 · 0 评论 -
HDU 1045&ZOJ 1002 Fire Net (还是DFS呀...)
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9172 Accepted Submission(s): 5341Problem DescriptionSuppose that we hav原创 2016-03-27 22:23:54 · 1321 阅读 · 0 评论 -
HDU 1010 Tempter of the Bone(DFS,奇偶剪枝)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 101688 Accepted Submission(s): 27539Problem DescriptionThe原创 2016-04-26 23:30:21 · 5345 阅读 · 3 评论 -
HDU 1978 How many ways（第一道记忆化搜索+DP）
How many waysTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4610 Accepted Submission(s): 2726Problem Description这是一个简单的生存游戏，原创 2016-07-05 19:25:49 · 3014 阅读 · 0 评论 -
HDU 2162 Find a way(双BFS+最短路)
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9772 Accepted Submission(s): 3187Problem DescriptionPass a year lea原创 2016-07-06 14:58:06 · 2134 阅读 · 0 评论 -
HDU 1044 Collect More Jewels 【经典BFS+DFS】
Collect More JewelsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6597 Accepted Submission(s): 1527Problem DescriptionIt is原创 2016-07-17 19:49:31 · 2392 阅读 · 0 评论 -
HDU 1142 A Walk Through the Forest （记忆化搜索+Dijkstra算法）
A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7583 Accepted Submission(s): 2791Problem Description原创 2016-07-12 22:47:03 · 1801 阅读 · 0 评论 -
HDU 1195 Open the Lock （不一样的BFS）
Open the LockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6045 Accepted Submission(s): 2697Problem DescriptionNow an emerg原创 2016-07-11 19:30:21 · 2465 阅读 · 0 评论 -
HDU1518 & POJ2362 & ZOJ1909 Square(DFS,剪枝是关键呀)
SquareTime Limit : 10000/5000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 4Problem DescriptionGiven a set of sticks of v原创 2016-03-23 21:34:50 · 2490 阅读 · 0 评论 -
POJ 1573 Robot Motion【是搜索，就不要纠结是DFS还是BFS】
Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12845 Accepted: 6234DescriptionA robot has been programmed to follow the instructions原创 2016-08-08 11:17:17 · 2255 阅读 · 1 评论 -
HNNU 11657 简单的图论问题？【湖南省第十一届大学生计算机程序设计竞赛，双BFS】
原题链接：http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=11657&courseid=0正如好手所说，搜索玩得就是标记第一种方式稍微简单一点，第二种方式需要一个三维的标记，增加一个方向的标记，就和迷宫问题转弯次数一样。AC代码：#include #include #include #include #原创 2016-08-23 16:36:21 · 1187 阅读 · 0 评论 -
NYOJ 20 吝啬的国度 【BFS+链式前向星建图，Vector建图】
吝啬的国度时间限制：1000 ms | 内存限制：65535 KB难度：3描述在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。输入第一行输入一个整数M表示测试数据共有M(1每组测试数据原创 2016-08-24 16:18:36 · 827 阅读 · 0 评论 -
HDU 1495 非常可乐【隐式图搜索，BFS】
就是以前老人常考小孩的倒香油问题，以前就做过，直接模拟，但是TLE，因为有的状态重复出现过，网上有人说用BFS，但是当时自己太菜（现在也是），并且网上的代码很繁琐，现在看到一份比较简洁的代码，就参考了一下。原创 2016-10-25 22:45:51 · 1743 阅读 · 0 评论 -
HDU 1258 Sum It Up (还是DFS)
Sum It UpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5691 Accepted Submission(s): 2967Problem DescriptionGiven a specifie原创 2016-04-19 17:03:24 · 1895 阅读 · 1 评论 -
HDU 1428 漫步校园（最短路+记忆化搜索）
漫步校园Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3991 Accepted Submission(s): 1235Problem DescriptionLL最近沉迷于AC不能自拔，每天寝室、机房原创 2016-07-14 22:42:28 · 2521 阅读 · 1 评论 -
HDU 1242 Rescue (第一道优先队列+BFS)
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25484 Accepted Submission(s): 9021Problem DescriptionAngel was caught b原创 2016-07-13 21:46:12 · 2083 阅读 · 0 评论 -
POJ Knight Moves(BFS呀,但也有坑呀)
Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23833 Accepted: 11202DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asse原创 2016-03-20 22:37:40 · 2369 阅读 · 9 评论 -
HDU 1241/UVa572 Oil Deposits(DFS&BFS)
Oil DepositsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Problem DescriptionThe GeoSurvComp geolo原创 2016-03-22 18:14:35 · 1680 阅读 · 0 评论 -
HDU 1312 Red and Black(经典搜索,DFS&BFS三种方式)
Red and BlackProblem DescriptionThere 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原创 2016-03-18 23:19:49 · 4760 阅读 · 0 评论 -
HDU 1016 Prime Ring Problem(搜索入门题 DFS,多种方式)
州），英雄互娱（杭州）Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39066 Accepted Submission(s): 17239Probl原创 2016-03-18 20:55:48 · 1329 阅读 · 0 评论 -
HDU1372&POJ2243Knight Moves(BFS呀,转换一下)
Knight MovesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13145 Accepted: 7369DescriptionA friend of you is doing research on the Traveling Knight Pro原创 2016-03-20 22:47:14 · 978 阅读 · 0 评论 -
HDU 1078 FatMouse and Cheese (记忆化搜索)
FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7730 Accepted Submission(s): 3202Problem DescriptionFatMou原创 2016-04-25 11:12:18 · 1374 阅读 · 2 评论 -
HDU 2181哈密顿绕行世界问题(还是DFS)
哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2670 Accepted Submission(s): 1673Problem Description一个规则的实心十二面体，它的 2原创 2016-04-23 22:19:16 · 1177 阅读 · 0 评论 -
HDU 1426 Sudoku Killer(数独,划分区域是关键)
Sudoku KillerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6283 Accepted Submission(s): 1981Problem Description自从2006年3月10日原创 2016-05-06 19:14:06 · 2212 阅读 · 0 评论 -
HDU 3152Obstacle Course (BFS ,记忆化???)
Obstacle CourseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 312 Accepted Submission(s): 187Problem DescriptionYou ar原创 2016-05-07 20:00:36 · 1388 阅读 · 0 评论 -
HDU 3111 Sudoku(数独,还是深搜)
SudokuTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 464 Accepted Submission(s): 302Problem DescriptionA Sudoku puzzle, once原创 2016-05-07 21:30:32 · 1521 阅读 · 0 评论 -
HDU 1240 Asteroids! （三维BFS）
Asteroids!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4749 Accepted Submission(s): 3048Problem DescriptionYou're in space原创 2016-07-09 20:03:04 · 1859 阅读 · 0 评论 -
HDU 1026 Ignatius and the Princess I 【优先队列+路径输出】
题意：一个人从左上角出发，到达有下角，‘.’是路，‘X’是墙，数字代表怪物，遇到怪物要把它消灭才能通过，消灭怪兽的时间等于其数值。很明显的要用优先队列+BFS，但记录路径有点困难。路径怎么记录呢？先举一个简单的例子，假设路径只是一个点，我们用a[]表示，其值与下标的关系：若a[x]=y，代表到达x这个点的上一点的坐标是y。此题要用一个结构体的数组，每次BFS的时候，如果下一步可以走，便把当前坐标（上一步）记录下来。输出的时候倒着输出就可以了。原创 2016-07-22 22:47:16 · 1376 阅读 · 0 评论 -
2016-蓝桥杯省赛-C语言大学B组_方格填数_【DFS&全排列】
蓝桥杯的题，用暴力也是可以的，因为只需要一个结果。但是，用搜索却是很好的选择！此题，由于方格是残缺的，这增加了一点困难，但是，我们补上残缺的角，便成为了规则的图形。原创 2017-04-03 21:36:18 · 2209 阅读 · 0 评论