Description

Input

Output

Sample Input

样例输入1

4 4 1

#@##

**##

###+

****

样例输入2

4 4 2

#@##

**##

###+

****

Sample Output

样例输出1

6

样例输出2

4

#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define INF 0x3f3f3f3f
#define MM(x,y) memset(x,y,sizeof(x))
typedef pair<int,int> pii;
typedef long long LL;
const double PI=acos(-1.0);
const int N=205;
struct info
{int x;int y;int zkl;int step;int h;bool operator<(const info &b)const{if(step+h!=b.step+b.h)return step+h>b.step+b.h;if(step!=b.step)return step>b.step;if(zkl!=b.zkl)return zkl>b.zkl;}
};
info S,T,direct[4]={{0,1,1,0},{0,-1,1,0},{1,0,1,0},{-1,0,1,0}};
inline info operator+(const info &a,const info &b)
{info c;c.x=a.x+b.x;c.y=a.y+b.y;c.step=a.step+b.step;return c;
}
inline bool operator==(const info &a,const info &b)
{return (a.x==b.x&&a.y==b.y);
}
int n,m,t;
char pos[N][N];
int vis[N][N][10];
priority_queue<info>Q;
void init()
{MM(pos,0);MM(vis,0);while (!Q.empty())Q.pop();
}
bool check(const info &a)
{return (a.x>=0&&a.x<m&&a.y>=0&&a.y<n&&a.zkl<=t&&!vis[a.x][a.y][a.zkl]);
}
inline int ABS(const int &n)
{return n<0?-n:n;
}
int main(void)
{int i,j,r;while (~scanf("%d%d%d",&m,&n,&t)){r=-1;init();for (i=0; i<m; i++){scanf("%s",pos[i]);for (j=0; j<n; j++){if(pos[i][j]=='@'){S.x=i;S.y=j;S.step=0;S.zkl=0;}else if(pos[i][j]=='+'){T.x=i;T.y=j;}}}S.h=S.step+ABS(S.x-T.x)+ABS(S.y-T.y);Q.push(S);vis[S.x][S.y][S.zkl]=1;while (!Q.empty()){info now=Q.top();Q.pop();if(now==T){r=now.step;break;}for (i=0; i<4; i++){info v=now+direct[i];v.zkl=now.zkl+(pos[v.x][v.y]=='#');if(check(v)){v.step=now.step+1;v.h=v.step+ABS(v.x-T.x)+ABS(v.y-T.y);Q.push(v);vis[v.x][v.y][v.zkl]=1;}}}printf("%d\n",r);}return 0;
}