ACM 深搜
文章平均质量分 90
青山绿水之辈
奋斗青春年华
展开
-
hdu1518(DFS+剪枝 Square )
Problem DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form a square?InputThe first line of input contains N, the number of test cases. Each原创 2013-07-30 10:01:41 · 1384 阅读 · 0 评论 -
FZOJ2110 star(DFS)
Overpower often go to the playground with classmates. They play and chat on the playground. One day, there are a lot of stars in the sky. Suddenly, one of Overpower’s classmates ask him: “How many acu原创 2013-08-11 22:24:00 · 1148 阅读 · 0 评论 -
hdu1198Farm Irrigation (DFS)
Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has原创 2013-09-11 22:46:59 · 873 阅读 · 0 评论 -
hdu2181哈密顿绕行世界问题(DFS)
Problem Description一个规则的实心十二面体,它的 20个顶点标出世界著名的20个城市,你从一个城市出发经过每个城市刚好一次后回到出发的城市。Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m=1.m=0退出.Output输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路原创 2013-11-09 20:57:43 · 954 阅读 · 0 评论 -
hdu2079选课时间(题目已修改,注意读题)
Problem Description又到了选课的时间了,xhd看着选课表发呆,为了想让下一学期好过点,他想知道学n个学分共有多少组合。你来帮帮他吧。(xhd认为一样学分的课没区别)Input输入数据的第一行是一个数据T,表示有T组数据。每组数据的第一行是两个整数n(1 接着有k行,每行有两个整数a(1 Output对于每组输入数据,输出一个整数原创 2013-11-14 17:57:54 · 995 阅读 · 0 评论 -
poj1664放苹果(dfs与递推,两种方法)
Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。Input第一行是测试数据的数目t(0 Output对输入的每组数据M和N,用一行输出相应的K。Sample Input17 3Sample Output8解题:由题可知,每个盘子都一样,原创 2013-12-01 00:46:25 · 2062 阅读 · 0 评论 -
poj2531Network Saboteur(DFS,注要是题目难明)
DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order原创 2013-12-10 13:09:05 · 1053 阅读 · 0 评论 -
蓝桥杯,剪格子 (dfs)
问题描述如下图所示,3 x 3 的格子中填写了一些整数。+--*--+--+|10* 1|52|+--****--+|20|30* 1|*******--+| 1| 2| 3|+--+--+--+我们沿着图中的星号线剪开,得到两个部分,每个部分的数字和都是60。本题的要求就是请你编程判定:对给定的m x n 的格子中的整数,是否可以分割为原创 2014-02-23 12:28:12 · 1144 阅读 · 0 评论 -
hdu1247Hat’s Words (组合单词,字典树+DFS)
Problem DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat’s words in a dictionary.Input原创 2014-07-26 14:36:13 · 1051 阅读 · 0 评论 -
zoj2977Strange Billboard (状态压缩+枚举)
Strange BillboardTime Limit: 2 Seconds Memory Limit: 65536 KB The marketing and public-relations department of the Czech Technical University has designed a new reconfigurable mechanical Fli原创 2014-08-10 00:07:56 · 2577 阅读 · 0 评论 -
HDU3810 Magina(搜索+用优先队列模拟01背包)经典
MaginaTime Limit: 60000/30000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 528 Accepted Submission(s): 177Problem DescriptionMagina, also known as A原创 2015-01-14 20:55:37 · 1398 阅读 · 0 评论 -
HDU3926Hand in Hand(搜索 或 并查集)
Problem DescriptionIn order to get rid of Conan, Kaitou KID disguises himself as a teacher in the kindergarten. He knows kids love games and works out a new game called "hand in hand".Initiall原创 2015-03-19 22:55:44 · 892 阅读 · 0 评论 -
BNUOJ33568 Glass Pyramid(DFS)
Glass PyramidTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on Ural. Original ID: 196864-bit integer IO format: %lld Java class name: (Any)Prev Submit St原创 2015-04-19 22:05:26 · 941 阅读 · 0 评论 -
POJ1128 Frame Stacking(拓扑排序)经典
Frame StackingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4454 Accepted: 1509DescriptionConsider the following 5 picture frames placed on an 9 x 8 a原创 2015-04-28 21:24:16 · 806 阅读 · 0 评论 -
HDU4876ZCC loves cards(多校题)
ZCC loves cardsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2362 Accepted Submission(s): 590Problem DescriptionZCC loves playing car原创 2014-10-18 14:18:50 · 1159 阅读 · 0 评论 -
hdu 4628 Pieces(状态压缩+记忆化搜索)
PiecesTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1811 Accepted Submission(s): 932Problem DescriptionYou heart broke in原创 2015-07-05 19:48:12 · 1136 阅读 · 0 评论 -
计算之道 (置换的玩笑)搜索
小蒜头又调皮了。这一次,姐姐的实验报告惨遭毒手。姐姐的实验报告上原本记录着从 1 到 n 的序列,任意两个数字间用空格间隔。但是“坑姐”的蒜头居然把数字间的空格都给删掉了,整个数字序列变成一个长度为 1 到 100 的且首部没有空格的数字串。现在姐姐已经怒了,蒜头找你写个程序快点把试验数据复原。输入输入文件有一行,为一个字符串——被蒜头搞乱的实验数据。字符串的长度在 1 到 1原创 2015-07-14 14:46:40 · 1407 阅读 · 2 评论 -
hdu1208Pascal's Travels (DFS+记忆化搜索(DP))
Problem DescriptionAn n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate path from the upper left corner to the lower right c原创 2013-08-08 11:56:19 · 1523 阅读 · 0 评论 -
hdu1978How many ways (记忆化搜索+DFS)
Problem Description这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下:1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走,并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一条可行路径后,当他走到这条路径的终点时,他将只有终点所标记的能量。原创 2013-08-08 10:19:31 · 1115 阅读 · 0 评论 -
hdu1312(DFS Red and Black )
Problem 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 one of four adjace原创 2013-07-30 10:46:50 · 1623 阅读 · 0 评论 -
hdu1175连连看 (超强的 剪枝+DFS)
Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现在已经酿成大祸,就只能将原创 2013-07-30 19:11:00 · 1223 阅读 · 0 评论 -
hdu1258 Sum It Up (DFS)
Problem DescriptionGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], t原创 2013-07-30 15:53:38 · 961 阅读 · 0 评论 -
hdu2952(DFS Counting Sheep )
Problem DescriptionA while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother suggested I tried counting sheep after I'd gone t原创 2013-07-30 11:17:24 · 1067 阅读 · 0 评论 -
hdu2660 Accepted Necklace (DFS)
Problem DescriptionI have N precious stones, and plan to use K of them to make a necklace for my mother, but she won't accept a necklace which is too heavy. Given the value and the weight of each pr原创 2013-07-31 16:17:30 · 1196 阅读 · 0 评论 -
hdu1010(深搜 +剪枝)
Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He re原创 2013-07-24 20:09:07 · 1079 阅读 · 0 评论 -
hdu1016(素数环)
Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.原创 2013-07-25 11:13:32 · 1070 阅读 · 0 评论 -
hdu1716(排序2 )
Problem DescriptionRay又对数字的列产生了兴趣:现有四张卡片,用这四张卡片能排列出很多不同的4位数,要求按从小到大的顺序输出这些4位数。Input每组数据占一行,代表四张卡片上的数字(0Output对每组卡片按从小到大的顺序输出所有能由这四张卡片组成的4位数,千位数字相同的在同一行,同一行中每个四位数间用空格分隔。每组输出数据原创 2013-07-25 11:17:37 · 1138 阅读 · 0 评论 -
hdu2212 DFS
Problem DescriptionA DFS(digital factorial sum) number is found by summing the factorial of every digit of a positive integer.For example ,consider the positive integer 145 = 1!+4!+5!, so it's原创 2013-08-01 23:51:02 · 1549 阅读 · 0 评论 -
hdu1015(Safecracker )
Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, a原创 2013-07-26 23:49:43 · 964 阅读 · 0 评论 -
hdu1572 下沙小面的(2)
Problem Description前文再续,书接上一题。话说当上小面的司机的Lele在施行他的那一套拉客法则以后,由于走的路线太长,油费又贵,不久便亏本了。(真可怜~)于是他又想了一个拉客的办法。对于每一次拉客活动,他一次性把乘客都拉上车(当然也不会超过7个,因为位置只有7个)。然后,Lele计算出一条路线(出于某些目的,Lele只把车上乘客的目的地作为这条路线上的站点),把所有乘原创 2013-07-27 15:22:51 · 971 阅读 · 0 评论 -
hdu1241(DFS Oil Deposits )
Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a原创 2013-07-28 23:51:20 · 985 阅读 · 0 评论 -
hdu2553(n皇后)
Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的N,求出有多少种合法的放置方法。Input共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示结束。Output共有若干行,每行一个正整原创 2013-07-28 09:44:45 · 913 阅读 · 0 评论 -
hdu4414(DFS 找十字架数量)
Problem DescriptionThe Nazca Lines are a series of ancient geoglyphs located in the Nazca Desert in southern Peru. They were designated as a UNESCO World Heritage Site in 1994. The high, arid platea原创 2013-07-28 23:59:09 · 1473 阅读 · 0 评论 -
hdu1195 Open the Lock (DFS)
Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.Each time, you can add or minus 1 to any原创 2013-08-03 20:34:00 · 1097 阅读 · 0 评论 -
hdu1142A Walk Through the Forest (最短路+BFS+DFS )
Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even n原创 2013-08-07 22:52:32 · 1106 阅读 · 0 评论 -
HDU 5348 MZL's endless loop(思想用的是深搜)经典
MZL's endless loopTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1343 Accepted Submission(s): 282Special JudgeProblem Descriptio原创 2015-08-05 15:41:12 · 966 阅读 · 0 评论