码迷,mamicode.com
首页 >  
搜索关键字:tempter of the bone    ( 343个结果
杭电1010---Tempter of the Bone
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 83349    Accepted Submission(s): 22707  Problem Description The doggie ...
分类:其他好文   时间:2015-04-29 21:50:28    阅读次数:100
hdu 2602 Bone Collector 01背包
Bone CollectorTime Limit: 1 SecMemory Limit: 256 MB题目连接http://acm.hdu.edu.cn/showproblem.php?pid=2602DescriptionMany years ago , in Teddy’s hometown t...
分类:其他好文   时间:2015-04-25 12:12:32    阅读次数:117
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): 82702Accepted Submission(s): 2...
分类:其他好文   时间:2015-04-23 19:36:09    阅读次数:87
hdu Tempter of the Bone
很典型的dfs题,但是涉及到很多的剪枝 。奇偶剪枝:是数据结构的搜索中,剪枝的一种特殊小技巧。现假设起点为(sx,sy),终点为(ex,ey),给定t步恰好走到终点,s|||+———e如图所示(“|”竖走,“—”横走,“+”转弯),易证abs(ex-sx)+abs(ey-sy)为此问题类中任意情况下...
分类:其他好文   时间:2015-04-17 17:52:48    阅读次数:91
HDU 2602 (0-1背包)
Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 35815Accepted Submission(s): 14753Pr...
分类:其他好文   时间:2015-04-15 19:27:34    阅读次数:186
hdu 2639 Bone Collector II
Bone Collector II Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2759    Accepted Submission(s): 1428 Problem Description The title of...
分类:其他好文   时间:2015-04-06 17:20:44    阅读次数:163
杭电 2603 Bone Collector(简单01背包)
Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 35296    Accepted Submission(s): 14531 Problem Description Many year...
分类:其他好文   时间:2015-04-06 15:50:44    阅读次数:159
HDU 1010 Tempter of the Bone DFS 简单题 注意剪枝
题意:一只小狗要刚好在t时刻从起点都到终点,问可不可以。注意剪枝。 1 #include 2 #include 3 #include 4 using namespace std; 5 int maze[9][9]; 6 bool vis[9][9]; 7 int n,m,t; 8 bool ans;...
分类:其他好文   时间:2015-04-05 23:22:08    阅读次数:186
hdu 1010 Tempter of the Bone
这题是深搜的典型题,要在时间 t 内准确到达终点,处理不好要么 wa 要么 TLE。有两个很重要的剪枝:一是奇偶剪枝,必须提前判断好 'S'和'D' 之间的曼哈顿距离和时间 t 是否同奇偶,否则会 TLE;二是判断 '.' 的数量是否大于或等于 t-1,这个能使程序快很多,但不是必要的,我试了下.....
分类:其他好文   时间:2015-04-05 14:29:33    阅读次数:122
HDU1010 Tempter of the Bone
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 reali...
分类:其他好文   时间:2015-04-02 09:12:26    阅读次数:142
343条   上一页 1 ... 22 23 24 25 26 ... 35 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!