Description
Input
Output
Sample Input
4 5 17 @A.B. a*.*. *..*^ c..b* 4 5 16 @A.B. a*.*. *..*^ c..b*
Sample Output
16 -1
#include<iostream> #include<cstdio> #include<cmath> #include<map> #include<queue> #include<cstring> #include<algorithm> #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rev(i,a,b) for(int i=(a);i>=(b);i--) #define clr(a,x) memset(a,x,sizeof a) typedef long long LL; using namespace std; const int maxn=25; const int maxm=25; char g[maxn][maxn]; int mp[maxn][maxn],done[maxn][maxn][1<<11]; int sx,sy,n,m,k; int dx[]={0,0,1,-1}; int dy[]={1,-1,0,0}; struct node { int x,y,w,key; node(int xx=0,int yy=0,int ee=0,int k=0) { x=xx;y=yy;w=ee;key=k; } }; bool is_ill(int x,int y) { return x<0||y<0||x>=n||y>=m; } int bfs() { queue<node>q; memset(done,0,sizeof done); q.push(node(sx,sy,0,0)); done[sx][sy][0]=1; while(!q.empty()) { node e=q.front();q.pop(); if(e.w>=k-1)return -1; for(int i=0;i<4;i++) { int curx=e.x+dx[i]; int cury=e.y+dy[i]; int curk=e.key|mp[curx][cury]; if(is_ill(curx,cury)||done[curx][cury][curk]||g[curx][cury]=='*')continue; if(g[curx][cury]=='^')return e.w+1; if(g[curx][cury]>='A'&&g[curx][cury]<='J'&&(curk&(1<<(g[curx][cury]-'A')))==0)continue; q.push(node(curx,cury,e.w+1,curk)); //printf("%d %d %d\n",curx,cury,x.w+1); done[curx][cury][curk]=1; } } return -1; } int main() { while(~scanf("%d%d%d",&n,&m,&k)) { rep(i,0,n) scanf("%s",g[i]); memset(mp,0,sizeof mp); rep(i,0,n) rep(j,0,m) if(g[i][j]=='@')sx=i,sy=j; else if(g[i][j]>='a'&&g[i][j]<='j')mp[i][j]=1<<(g[i][j]-'a'); printf("%d\n",bfs()); } return 0; }