em.......
by goodlearndaydayup @ 2018-06-14 13:14:03
发到那一题的讨论版去不好么
by diltraser @ 2018-06-14 13:15:13
@[diltraser](/space/show?uid=91823) 好的啦,能教本蒟蒻嘛
by goodlearndaydayup @ 2018-06-14 13:27:49
https://www.luogu.org/recordnew/show/7838626
在你代码的基础上改的,自己找区别(其实只是一个**愚蠢的细节**)
@[违规用户名XRSq*3EK](/space/show?uid=69922)
by 夏夜空 @ 2018-06-14 13:47:53
```cpp
#include<iostream>
#include<fstream>
#include<algorithm>
#include<cstring>
using namespace std;
int map[105][105][105],f[1000][1000],x1,y1,z1,r1,c1,r2,c2,ans,sum;
char a;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
int dfs(int x,int y,int z)//xy表示坐标点,z为剩下时间
{
if(x<=0||x>x1||y<=0||y>y1||f[x][y]==1||z<0) return 0;//超界,树,时间判断
if(map[x][y][z]!=-1) return map[x][y][z];//记忆
int way=0;
if(z==0&&x==r2&&y==c2) return 1;
for(int i=0;i<4;i++)
if(f[x+dx[i]][y+dy[i]]!=1) way+=dfs(x+dx[i],y+dy[i],z-1);//求种数
map[x][y][z]=way;
return map[x][y][z];
}
int main()
{
memset(map,-1,sizeof(map));
cin>>x1>>y1>>z1;
for(int i=1;i<=x1;i++)
for(int j=1;j<=y1;j++)
{
cin>>a;
if(a=='*')f[i][j]=1;
else f[i][j]=0;
}
cin>>r1>>c1>>r2>>c2;
cout<<dfs(r1,c1,z1);
return 0;
}
```
by 夏夜空 @ 2018-06-14 13:49:50
@[天,依然蓝](/space/show?uid=44658)
谢谢大佬~~(还真是个愚蠢的细节)~~
by goodlearndaydayup @ 2018-06-14 13:58:14