c语言网上编程搜题目,十八期编程比赛的那道搜索题目

#include

#include

#include

#include

const int inf= 10000000;

char map[10][10];

int d[10][10];

int kill[10][10];

int n,m,k;

int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};

void dfs(int x,int y,int &ans,int sum,int killed)

{

if(map[x][y]=='#')return ;

if(sum>=ans)return ;

if(x==n-1 && y==m-1){

if(map[x][y]!='O')ans=sum;

else if(killed>=k)ans=sum;

return ;

}

int xx,yy,i;

char tmpm=map[x][y];

int tmpd=d[x][y];

int tmpk=kill[x][y];

for(i=0;i<4;i++){

xx=x+dir[i][0];yy=y+dir[i][1];

if(xx>=0 && xx=0 && yy

if(map[x][y]=='o'){

map[x][y]='.';

d[x][y]=sum+1;

kill[x][y]=killed+1;

dfs(xx,yy,ans,sum+1,killed+1);

map[x][y]=tmpm;

d[x][y]=tmpd;

kill[x][y]=tmpk;

}

if(map[x][y]=='O'&&killed>=k){

map[x][y]='.';

d[x][y]=sum+1;

kill[x][y]=killed;

dfs(xx,yy,ans,sum+1,killed);

d[x][y]=tmpd;

kill[x][y]=tmpk;

map[x][y]=tmpm;

}

if(map[x][y]=='.'){

if((d[x][y]>sum+1) || (kill[x][y]

d[x][y]=sum+1;

kill[x][y]=killed;

dfs(xx,yy,ans,sum+1,killed);

d[x][y]=tmpd;

kill[x][y]=tmpk;

}

}

}

}

}

int main()

{

int i,j;

while(scanf(\"%d%d%d\",&n,&m,&k)!=EOF)

{

for(i=0;i

for(i=0;i

memset(kill,0,sizeof(kill));

int ans=inf;

dfs(0,0,ans,0,0);

if(ans!=inf)printf(\"%d\n\",ans+1);

else printf(\"-1\n\");

}

return 0;

}