1 solutions
-
2
#include<bits/stdc++.h> using namespace std; typedef pair<int,int> PII; #define x first #define y second int dx[]={-2,-2,-1,-1,1,1,2,2}; int dy[]={1,-1,2,-2,2,-2,1,-1}; const int N=160; char g[N][N]; int dist[N][N]; int n,m; int sx,sy,ex,ey; int bfs() { queue<PII> q; q.push({sx,sy}); memset(dist,0x3f,sizeof dist); dist[sx][sy]=0; while(q.size()) { PII t=q.front(); q.pop(); if(t.x==ex&&t.y==ey) { return dist[ex][ey]; } for(int i=0;i<8;i++) { int a=t.x+dx[i],b=t.y+dy[i]; if(a<1||a>n||b<1||b>m) { continue; } if(g[a][b]=='*') { continue; } if(dist[a][b]!=0x3f3f3f3f) { continue; } dist[a][b]=dist[t.x][t.y]+1; q.push({a,b}); } } } int main() { cin>>m>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { cin>>g[i][j]; if(g[i][j]=='H') { sx=i,sy=j; } if(g[i][j]=='K') { ex=i,ey=j; } } } cout<<bfs()<<endl; return 0; }
- 1
Information
- ID
- 230
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 50
- Accepted
- 17
- Uploaded By