勇敢前进的ACMer

胜利大逃亡Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38775    Accepted Submission(s): 13641Problem DescriptionIgnatius被魔王抓走了,有一天

传送门：Safe Path题意：问你能否从起始点到达出发点。注意，在地图的一些地区有怪兽，只要怪兽能在d步内到达你现在的位置，你会被立刻杀死。。分析：BFS裸题，注意，N*M是2e5大小，把地图进行压缩一下~代码如下：#include <cstdio>#include <cstring>#include <queue>using namespace std...

题意：给定一个n长度的01字符串，下标为1到n。每次前进的跳跃步数不能超过d，假定当前位置为x，当且仅当x+i位置为1，i问从起点1到终点n最少步数是多少。分析：属于很简单的搜索题，我用的是BFS，因为DFS超时了，想不到更好的剪枝...代码如下：#include #include #include using namespace std;const int INF = 10000000

倒水问题，不是很能理解为什么刘汝佳的蓝书把该题归类为最短路。简单的BFS，注意用优先队列。#include #include #include using namespace std;const int maxn = 200+5;struct node{ int water,va,vb,vc; bool operator <(const node &rhs) con

湫湫系列故事——设计风景线Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 5286 Accepted Submission(s): 973Problem Description 　　随着杭州西湖的知名度的进一步提升，园林规划专家湫

Asteroids!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5551    Accepted Submission(s): 3531Problem DescriptionYou're in space

Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19737 Accepted Submission(s): 6422 Special JudgeProblem Descript

Catch That CowTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16157    Accepted Submission(s): 4837Problem DescriptionFarmer Joh

连连看Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37107    Accepted Submission(s): 9176Problem Description“连连看”相信很多人都玩过。没玩过也没

RescueTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32204    Accepted Submission(s): 11245Problem DescriptionAngel was caught

题目链接：G-Coloring Tree 题意：N个节点的树，可以染色K种要求相同颜色节点的距离为D，求问方案总数。 分析：BFS  构造函数f(D) 表示相同颜色节点距离至少为D的方案总数，那么最后答案就是f(D)-f(D+1)对于当前节点，找出已经访问过的节点中与当前节点的距离小于D 的节点。这些节点任意两个之间的距离一定小于 D ,所以这些节点的颜色是互不相同...