![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
bfs
soul11201
这个作者很懒,什么都没留下…
展开
-
bit 1038 Red and Black
Red and Black 时间限制: 1秒 内存限制: 64M Description There 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, h原创 2013-02-06 21:30:41 · 410 阅读 · 0 评论 -
bit 1030 Knight Moves
Knight Moves 时间限制: 1秒 内存限制: 64M Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits eac原创 2013-02-12 00:03:29 · 413 阅读 · 0 评论 -
hdu 1240 Asteroids!
入队错误,从昨天一直调到今天。先前在这句话 if((temp_x >=0 &&temp_x =0&&temp_y=0 &&temp_z 是这样: if(!visited[temp_z][temp_y][temp_x]&&(temp_x >=0 &&temp_x=0&&temp_y=0 &&temp_z RE了老半天。。。 #include #include原创 2013-02-21 09:31:56 · 497 阅读 · 0 评论 -
hdu 1548
都说人间自有真情在,这道题写的我都快没有爱了。 if(num[begin]&&!visited[begin]&&(begin + num[begin] >=1)&&(begin + num[begin] <= N)){ Q[tail++] = begin + num[begin]; } if(num[begin]&&!visited[begin]&&(begin - num[b原创 2013-02-20 16:53:40 · 425 阅读 · 0 评论 -
hdu 1253 胜利大逃亡
先前在次处漏掉了,could_come的判断,结果一直wa。 if(step > T||!could_come){} #include #include struct { int x,y,z; }Q[150000]; int head,tail,step,add_step_flag; int input[52][52][52]; int end_x,end_y,end_z原创 2013-02-21 10:53:29 · 432 阅读 · 0 评论 -
hdu diy contest 创业中心之鼠
创业中心之鼠 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other) Total Submission(s) : 52 Accepted Submission(s) : 14 Font: Times New Roman | Verdana | Georgia Fon原创 2013-02-27 10:29:14 · 585 阅读 · 0 评论