HDU1044

这题要先用BFS求得每个点之间的最短路，然后用DFS就不会超时了。

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;

int w,h,l,m;
char maze[52][52];
int mark1[52][52];
int mark2[20];
int value[15];

int x_change[4]={0,1,0,-1};
int y_change[4]={1,0,-1,0};

int flag;
int ans;
int map[20][20];

int sum;       //总价值
class point
{
public:
	int x,y;
	int step;
	point(int x_,int y_,int s):x(x_),y(y_),step(s){}
	point(){}
};

bool judge(int x,int y)
{
	if(maze[x][y]!='*' && x>=1 && y>=1 && x<=h && y<=w && mark1[x][y]==0)
	{
		return true;
	}
	return false;
} 

void bfs(int x,int y,int p)
{
	memset(mark1,0,sizeof(mark1));         //清零
	int x_t,y_t;
	queue<point> aqueue;
	aqueue.push(point(x,y,0));
	mark1[x][y]=1;
	while(!aqueue.empty())
	{
		point now_p=aqueue.front();
		aqueue.pop();
		for(int i=0;i<4;i++)
		{
			x_t=now_p.x+x_change[i];
			y_t=now_p.y+y_change[i];
			if(judge( x_t,y_t ) )         //判断是否能走
			{
				mark1[x_t][y_t]=1;
				aqueue.push( point(x_t,y_t,now_p.step+1) );
				if(maze[x_t][y_t]=='@')              //建立map
				{
					map[p][0]=now_p.step+1;
				}
				else if(maze[x_t][y_t]=='<')
				{
					map[p][m+1]=now_p.step+1;
				}
				else if(maze[x_t][y_t]>='A' && maze[x_t][y_t]<='Z')
				{
					map[p][maze[x_t][y_t]-64]=now_p.step+1;
				}
			}
		}
	}
}

void dfs(int p,int v,int s)
{

	if(s>l||ans==sum)  //剪枝，如果步数超出或已经获得最大值，不需要继续搜索
	{
		return ;
	}
	if(p==m+1)
	{
		if(v>ans)
			ans=v;

		flag=1;
		return ;
	}
	for(int i=1;i<=m+1;i++)
	{
		if(!mark2[i]&&map[p][i])
		{
			mark2[i]=1;
			dfs(i,v+value[i],s+map[p][i]);
			mark2[i]=0;
		}
	}
}

int main()
{
	int t;
	int c=1;
	cin>>t;
	while(t--)
	{
		sum=0;
		memset(maze,'\0',sizeof(maze));
		memset(value,0,sizeof(value));
		memset(map,0,sizeof(map));
		memset(mark1,0,sizeof(mark1));
		memset(mark2,0,sizeof(mark2));
		flag=0;
		ans=0;

		cin>>w>>h>>l>>m;
		for(int i=1;i<=m;i++)
		{
			cin>>value[i];
			sum=sum+value[i];
		}

		value[m+1]=0;//终点
		value[0]=0;   //起点

		for(int i=1;i<=h;i++)        //输入迷宫
		{
			getchar();
			for(int j=1;j<=w;j++)
			{
				cin>>maze[i][j];
			}
		}

		for(int i=1;i<=h;i++)        //广搜迷宫
		{
			for(int j=1;j<=w;j++)
			{
				if(maze[i][j]=='@')
				{
					bfs(i,j,0);
				}
				else if(maze[i][j]>='A'&&maze[i][j]<='Z')
				{
					bfs(i,j,maze[i][j]-64);
				}
				else if(maze[i][j]=='<')
				{
					bfs(i,j,m+1);
				}
			}
		}

		mark2[0]=1;
		dfs(0,0,0);  //起始顶点、获得分数、步长
		
		if(flag==0)
		{
			cout<<"Case "<<c<<":"<<endl;
			cout<<"Impossible"<<endl;
		}
		else
		{
			cout<<"Case "<<c<<":"<<endl;
			cout<<"The best score is "<<ans<<"."<<endl;
		}
		if(t!=0)
		{
			cout<<endl;
		}
		c++;
		
	}
	return 0;
}