搜索
文章平均质量分 81
wchhlbt
这个作者很懒,什么都没留下…
展开
-
hdu 2553 N皇后问题 (DFS)
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18233 Accepted Submission(s): 8234Problem Description在N*N的方格棋盘放置了N个皇后,使得它们原创 2016-07-27 21:11:03 · 266 阅读 · 0 评论 -
codeforces 743D Chloe and pleasant prizes (DFS/树形DP)
D. Chloe and pleasant prizes传送门:http://codeforces.com/contest/743/problem/DGenerous sponsors of the olympiad in which Chloe and Vladik took part allowed all the participants to choose a prize for原创 2016-12-17 22:11:10 · 502 阅读 · 0 评论 -
BJTU 1703 Ficer的春运 (DFS)
传送门:http://acm.bjtu.edu.cn/problem/detail?pid=1703背景:本题在大一新生赛前曾看过一次,当时觉得好神奇,没想到这种需要思维的过程也能用算法实现,(当时自己还是too young too simple啊,现在Alphago都能战胜人类了。。。)经过假期的学习,还有开学后的讲座,掌握了DFS,BFS,记忆化搜索,终于发现这道题目也不是那么高不可攀了,原创 2016-04-03 14:02:17 · 534 阅读 · 0 评论 -
BJTU 1729 Ryan的弹幕游戏(BFS)
Ryan的弹幕游戏Time Limit: 1000 MS Memory Limit: 65535 KbTotal Submission: 8 Accepted: 3Description Ryan最近迷上了弹幕游戏。所谓弹幕游戏,指的是玩家操控一位角色对来袭的大量敌人进行攻击,并在过程中升级、强化自我的能力,最终打败Boss的原创 2016-04-28 00:31:20 · 1296 阅读 · 0 评论 -
POJ 2243 Knight Moves(BFS)
Knight MovesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13192 Accepted: 7395DescriptionA friend of you is doing research on the Traveling Knight Pro原创 2016-04-29 22:21:46 · 722 阅读 · 0 评论 -
hdu 2531 Catch him (块状BFS) + 常见BFS的错因
Catch himTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 963 Accepted Submission(s): 438Problem Description在美式足球中,四分卫负责指挥整只球队的进原创 2016-08-10 20:57:16 · 577 阅读 · 0 评论 -
hdu 1978 How many ways (记忆化搜索)
解题思路:记忆化搜索+DFS每次搜索所有可以走的格子,再对这些格子向下继续搜索,同时记录下这些格子到终点的路径数,避免重复搜索#include #include #include using namespace std;#define M 10000int dp [105][105];int map [105][105];int dx[2] = {0,1};int dy[2原创 2016-03-28 16:15:38 · 454 阅读 · 0 评论 -
POJ 1088 滑雪 (记忆化搜索)
DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14原创 2016-03-28 16:09:33 · 371 阅读 · 0 评论 -
hdu 1548 A strange lift (BFS)
解题思路:BFS注意点:每次查询结束后,要清空队列#include #include #include #include #define inf 0x3f3f3f3fusing namespace std;int k[205];int step[205];int n,a,b;void bfs(int a,int b)//a->start b->finish{原创 2016-03-24 13:21:31 · 296 阅读 · 0 评论 -
POJ 1979 && HDU 1312 Red and Black(DFS)
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 adjacent tiles原创 2016-03-23 01:04:55 · 290 阅读 · 0 评论 -
hdu 1253 胜利大逃亡 (BFS)
#include #include #include #include using namespace std;#define inf 0x3f3f3f3fint k,a,b,c,t;int map[60][60][60];int time[60][60][60];struct point{ int x,y,z;};queueP;int dx[6] = {0,原创 2016-03-20 21:29:30 · 353 阅读 · 0 评论 -
ZOJ 1709 Oil Deposits(DFS)
Oil DepositsTime Limit: 2 Seconds Memory Limit: 65536 KB The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large原创 2016-03-07 00:05:30 · 384 阅读 · 0 评论 -
ZOJ 2110 Tempter of the Bone (DFS)
Tempter of the BoneTime Limit: 2 Seconds Memory Limit: 65536 KB The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began t原创 2016-02-27 18:16:42 · 447 阅读 · 0 评论 -
codeforces 374C Inna and Dima (dfs+记忆化)
Inna and DimaInna and Dima bought a table of size n × m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A".Inna loves Dima, so she wants to go through原创 2016-08-20 17:35:28 · 522 阅读 · 0 评论 -
codeforces 788C The Great Mixing (bitset优化dp、bfs)
题目原文 http://codeforces.com/problemset/problem/788/CSasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentra原创 2017-03-31 17:17:20 · 1556 阅读 · 0 评论