ACM---搜索 - 随笔分类 - 芷水

搜索专题

摘要：1.hdu 1664 Different Digits2.hdu 3533 Escape 题意：有n*m的矩阵,有k个城堡攻打一个间谍A。A从(0,0)-->(n,m); A，可以向四周前进，花费1秒，可能在原地停留1秒。不能停留1秒以上。 k个城堡的攻击方向是固定的，而且攻击的子弹有... 阅读全文

posted @ 2014-04-18 23:31 芷水阅读(164) 评论(0) 推荐(0)

hdu 3085

摘要：Nightmare ⅡTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 720Accepted Submission(s): 136Problem D... 阅读全文

posted @ 2014-04-14 11:20 芷水阅读(214) 评论(0) 推荐(0)

hdu 2612

摘要：Find a wayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3451Accepted Submission(s): 1128Problem ... 阅读全文

posted @ 2014-04-12 08:53 芷水阅读(217) 评论(0) 推荐(0)

hdu 1401

摘要：SolitaireTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3077Accepted Submission(s): 954Problem De... 阅读全文

posted @ 2014-04-10 08:16 芷水阅读(385) 评论(0) 推荐(0)

hdu 2102

摘要：A计划Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8327Accepted Submission(s): 1973Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主阅读全文

posted @ 2014-04-05 13:53 芷水阅读(218) 评论(0) 推荐(0)

poj 1088

摘要：滑雪Time Limit:1000MSMemory Limit:65536KTotal Submissions:72231Accepted:26652DescriptionMichael喜欢滑雪百这并不奇怪，因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12 11 10 9一个人可以从某个点滑向上下左右相... 阅读全文

posted @ 2014-04-04 16:33 芷水阅读(189) 评论(0) 推荐(0)

hdu 1885

摘要：Key TaskTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 990Accepted Submission(s): 378Problem DescriptionThe Czech Technical University is rather old — you already know that it celebrates 300 years of its existence in 2007. Some of the university b 阅读全文

posted @ 2014-04-02 18:50 芷水阅读(204) 评论(0) 推荐(0)

hdu 1226

摘要：超级密码Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2142Accepted Submission(s): 675Problem DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0 2 #include 3 #include 4 #... 阅读全文

posted @ 2014-04-02 16:48 芷水阅读(250) 评论(0) 推荐(0)

hdu 1430

摘要：魔板Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1649Accepted Submission(s): 348Problem Description在魔方风靡全球之后不久，Rubik先生发明了它的简化版——魔板。魔板由8个同样大小的方块组成，每个方块颜色均不相同，可用数字1-8分别表示。任一时刻魔板的状态可用方块的颜色序列表示：从魔板的左上角开始，按顺时针方向依次写下各方块的颜色代号，所得到的数字序列即可表示此时魔板的状态。例如，序列(1 阅读全文

posted @ 2014-04-02 14:37 芷水阅读(220) 评论(0) 推荐(0)

hdu 1195 Open the Lock

摘要：Open the LockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3679Accepted Submission(s): 1611Problem 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. E 阅读全文

posted @ 2014-04-01 12:07 芷水阅读(168) 评论(0) 推荐(0)

csu 1356 Catch bfs（vector）

摘要：1356: CatchTime Limit: 2 SecMemory Limit: 128 MBSubmit: 96Solved: 40[Submit][Status][Web Board]DescriptionA thief is running away!We can consider the city where he locates as an undirected graph in which nodes stand for crosses and edges stand for streets. The crosses are labeled from 0 to N–1. The 阅读全文

posted @ 2014-03-10 21:59 芷水阅读(221) 评论(0) 推荐(0)

hdu 1026 Ignatius and the Princess I 搜索,输出路径

摘要：Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10312 Accepted Submission(s): 3125 Special JudgeProblem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Pri 阅读全文

posted @ 2013-10-28 12:23 芷水阅读(225) 评论(0) 推荐(0)

Tempter of the Bone 搜索---奇偶性剪枝

摘要：Tempter of the BoneTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 1Problem 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 th 阅读全文

posted @ 2013-10-28 08:06 芷水阅读(505) 评论(0) 推荐(0)

HDU 1240 Asteroids!

摘要：Asteroids!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2542 Accepted Submission(s): 1719 Problem DescriptionYou're in space. You want to get home. There are asteroids. You don't want to hit them.InputInput to this problem will consist 阅读全文

posted @ 2013-07-19 21:43 芷水阅读(348) 评论(0) 推荐(0)

HDU 1142

摘要：A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4386 Accepted Submission(s): 1576 Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax aft 阅读全文

posted @ 2013-07-18 23:54 芷水阅读(202) 评论(0) 推荐(0)

HDU 1428

摘要：漫步校园Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2183Accepted Submission(s): 627Problem DescriptionLL最近沉迷于AC不能自拔，每天寝室、机房两点一线。由于长时间坐在电脑边，缺乏运动。他决定充分利用每次从寝室到机房的时间，在校园里散散步。整个HDU校园呈方形布局，可划分为n*n个小方格，代表各个区域。例如LL居住的18号宿舍位于校园的西北角，即方格(1,1)代表的地方，而机房所在的第三实验阅读全文

posted @ 2013-07-18 17:35 芷水阅读(240) 评论(0) 推荐(0)

hdu 1978 How many ways 记忆化搜索经典例题

摘要：How many waysTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1869Accepted Submission(s): 1144Problem Description这是一个简单的生存游戏，你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下：1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走，并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一阅读全文

posted @ 2013-07-17 19:20 芷水阅读(322) 评论(0) 推荐(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): 3521Accepted Submission(s): 1394Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is label 阅读全文

posted @ 2013-07-17 19:16 芷水阅读(310) 评论(0) 推荐(0)

hdu 1258 Sum It Up

摘要：Sum It UpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2906Accepted Submission(s): 1455Problem 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 阅读全文

posted @ 2013-07-17 07:56 芷水阅读(165) 评论(0) 推荐(0)

hdu Rescue 1242

摘要：RescueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11566Accepted Submission(s): 4205Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M #include#define HH 11111111char a[2 阅读全文

posted @ 2013-07-16 16:12 芷水阅读(223) 评论(0) 推荐(0)

随笔分类 - ACM---搜索

公告