随笔分类 -  ACM — 搜索

上一页 1 2
1001. How can I go? （soj）（bfs或者dp）
摘要：DescriptionIn the year 2012, Departyment finally finished building Freedam. From then on, all people can only smilence in the Chintranet. If you want to go some where, you need to obey some rules.One day, Shitizen wants to go somewhere. He(/she/it?) starts from (X, 0), and wants to go to any place w 阅读全文
posted @ 2013-04-29 20:15 crazy_apple 阅读(283) 评论(0) 推荐(0)
[1441] Babelfish noj（宁波）
摘要：http://ac.nbutoj.com/Problem/view.xhtml?id=1441[1441] Babelfish时间限制: 1000 ms　内存限制: 65535 K问题描述You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.输入Input consists of u 阅读全文
posted @ 2013-04-26 20:06 crazy_apple 阅读(217) 评论(0) 推荐(0)
hdu 3325 Arithmetically Challenged(dfs全排+暴力枚举破解+set集合的应用)
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=3325Arithmetically ChallengedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 331Accepted Submission(s): 139Problem DescriptionChallenge 24 is a popular mathematics game used in many grade schools. In each g 阅读全文
posted @ 2013-04-08 19:55 crazy_apple 阅读(307) 评论(0) 推荐(0)
hdu 1213 How Many Tables（dfs）
摘要：hdu 1213 How Many TablesProblem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with stran 阅读全文
posted @ 2013-04-04 16:41 crazy_apple 阅读(123) 评论(0) 推荐(0)
hdu 1501 Zipper（dfs）
摘要：hdu 1501 ZipperProblemDescriptionGiventhreestrings,youaretodeterminewhetherthethirdstringcanbeformedbycombiningthecharactersinthefirsttwostrings.Thefirsttwostringscanbemixedarbitrarily,buteachmuststayinitsoriginalorder.Forexample,considerforming"tcraete"from"cat"and"tree&quo 阅读全文
posted @ 2013-04-04 16:36 crazy_apple 阅读(284) 评论(0) 推荐(0)
hdu 1253 胜利大逃亡（bfs）
摘要：hdu 1253 胜利大逃亡ProblemDescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一个.现在给你城堡的地图,请你计算出Ignatius能否在魔王回来前离开城堡(只要走到出口就算离开城堡,如果走到出口的时候魔王刚好回来也算逃亡成功),如果可以请输出需要多少分钟才 阅读全文
posted @ 2013-04-04 16:26 crazy_apple 阅读(206) 评论(0) 推荐(0)
hdu 1010 Tempter of the Bone（bfs）
摘要：hdu 1010 Tempter of the Bonehttp://acm.hdu.edu.cn/showproblem.php?pid=1010ProblemDescriptionThedoggiefoundaboneinanancientmaze,whichfascinatedhimalot.However,whenhepickeditup,themazebegantoshake,andthedoggiecouldfeelthegroundsinking.Herealizedthatthebonewasatrap,andhetrieddesperatelytogetoutofthisma 阅读全文
posted @ 2013-04-04 16:25 crazy_apple 阅读(219) 评论(0) 推荐(0)
hdu 1548 A strange lift（bfs||dijkstra）
摘要：hdu 1548 A strange lifthttp://acm.hdu.edu.cn/showproblem.php?pid=1548ProblemDescriptionThereisastrangelift.Theliftcanstopcanateveryfloorasyouwant,andthereisanumberKi(0<=Ki<=N)oneveryfloor.Thelifthavejusttwobuttons:upanddown.Whenyouatfloori,ifyoupressthebutton"UP",youwillgoupKifloor,i 阅读全文
posted @ 2013-04-04 16:24 crazy_apple 阅读(127) 评论(0) 推荐(0)
hdu 1072 Nightmare（bfs）
摘要：hdu 1072 Nightmarehttp://acm.hdu.edu.cn/showproblem.php?pid=1072ProblemDescriptionIgnatiushadanightmarelastnight.Hefoundhimselfinalabyrinthwithatimebombonhim.Thelabyrinthhasanexit,Ignatiusshouldgetoutofthelabyrinthbeforethebombexplodes.Theinitialexplodingtimeofthebombissetto6minutes.Topreventthebomb 阅读全文
posted @ 2013-04-04 16:09 crazy_apple 阅读(143) 评论(0) 推荐(0)
hdu 1195 Open the Lock（BFS）
摘要：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 digit. When add 1 to '9', the digit will change to be '1' and when minus 1 to '1', 阅读全文
posted @ 2013-02-25 20:49 crazy_apple 阅读(222) 评论(0) 推荐(0)
hdu2531Catch him(广度搜索bfs)
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2531Problem Description在美式足球中，四分卫负责指挥整只球队的进攻战术和跑位，以及给接球员传球的任务。四分卫是一只球队进攻组最重要的球员，而且一般身体都相对比较弱小，所以通常球队会安排5-7名大汉来保护他，其中站在四分卫前方、排成一线的5名球员称为进攻锋线，他们通常都是135公斤左右的壮汉。 对防守方来说，攻击对手的四分卫当然是最直接的限制对手进攻的方法。如果效果好，就可以在对方四分卫传球之前将其按翻在地，称之为擒杀。擒杀是最好的鼓舞防守队士气的方法，因为对方连传球的机会都没有，进攻就结. 阅读全文
posted @ 2012-12-22 19:52 crazy_apple 阅读(200) 评论(0) 推荐(0)
hdu 4287 Intelligent IME (字典树+dfs)
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=4287Problem Description We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the number buttons may correspond to some English letters respectively, as shown below: 2 : a, b, c3 :.. 阅读全文
posted @ 2012-09-10 21:06 crazy_apple 阅读(362) 评论(0) 推荐(0)
hdu 4158 GO （广搜BFS）
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=4158Problem DescriptionIn the game of Go, two players alternate placing black and white stones on lattice points of an n × n grid, each attempting to surround as much territory (i.e., regions of unfilled lattice points) as possible. At the end of the ga 阅读全文
posted @ 2012-08-30 14:12 crazy_apple 阅读(247) 评论(0) 推荐(0)
hdu 1258 Sum It Up ( dfs )
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1258Problem 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], then there are four different sums that equal 4: 4,3+1,2+ 阅读全文
posted @ 2012-08-19 10:25 crazy_apple 阅读(169) 评论(0) 推荐(0)

上一页 1 2