随笔分类 - ACM—BFS
摘要:帮同学写的八数码,启发式搜索 创建两个表open,close,分别用的stl中的优先队列priority_queue和map,好久没写过代码了,bug调了半天
阅读全文
摘要:Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21384 Accepted Submission(s): 5180
阅读全文
摘要:Prime Path Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15325 Accepted: 8634 Description The ministers of the cabinet were quite upset b
阅读全文
摘要:Meteor ShowerTime Limit:1000MSMemory Limit:65536KTotal Submissions:12816Accepted:3451DescriptionBessie hears that an extraordinary meteor shower is co...
阅读全文
摘要:Red and BlackTime Limit:1000MSMemory Limit:30000KTotal Submissions:27891Accepted:15142DescriptionThere is a rectangular room, covered with square tile...
阅读全文
摘要:Catch That CowTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10166Accepted Submission(s): 3179Pro...
阅读全文
摘要:PetTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2052Accepted Submission(s): 1007Problem Descrip...
阅读全文
摘要:Knight MovesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8831Accepted Submission(s): 5202Proble...
阅读全文
摘要:1 #include 2 #include 3 #include 4 #include 5 #define size 10 6 #define Max 100000 7 using namespace std; 8 struct point{ 9 int x,y,now,l;10 ...
阅读全文
摘要:八数码问题,广度优先搜索,数组记录最短路径,然后打印2 6 4 1 3 7 0 5 88 1 5 7 3 6 4 0 2 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 using na...
阅读全文
摘要:亡命逃窜时间限制:1000ms | 内存限制:65535KB难度:4描述 从前有个叫hck的骑士,为了救我们美丽的公主,潜入魔王的老巢,够英雄吧。不过英雄不是这么好当的。这个可怜的娃被魔王抓住了,倍受折磨,生死一线。有一天魔王出去约会了,这可是一个千载难逢的逃命机会。你现在的任务就是判断一下这个英雄...
阅读全文
摘要:春天到了,师大的园丁们又开始忙碌起来了.京师广场上有一块空地,边界围成了一个多边形,内部被划分成一格一格的.园丁们想在这个多边形内的每一格内种植一些花.现在请你帮忙计算一下一共最多可以种多少花.广场用一个M*N的字符数组表示,"."和"*"代表一个方格,其中"*"代表空地的边界,"."是空格,只有边...
阅读全文
摘要:最少步数时间限制:3000ms | 内存限制:65535KB难度:4描述这有一个迷宫,有0~8行和0~8列:1,1,1,1,1,1,1,1,11,0,0,1,0,0,1,0,11,0,0,1,1,0,0,0,11,0,1,0,1,1,0,1,11,0,0,0,0,1,0,0,11,1,0,1,0,1...
阅读全文

浙公网安备 33010602011771号