Description
定义一个二维数组:
int maze[5][5] = {
0, 1, 0, 0, 0,
0, 1, 0, 1, 0,
0, 0, 0, 0, 0,
0, 1, 1, 1, 0,
0, 0, 0, 1, 0,
};
它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。
Input
一个5 × 5的二维数组,表示一个迷宫。数据保证有唯一解。
Output
左上角到右下角的最短路径,格式如样例所示。
Sample Input
0 1 0 0 0
0 1 0 1 0
0 0 0 0 0
0 1 1 1 0
0 0 0 1 0
Sample Output
(0, 0)
(1, 0)
(2, 0)
(2, 1)
(2, 2)
(2, 3)
(2, 4)
(3, 4)
(4, 4)
题意:如题 |
思路(DFS+路径记录):
DFS水题,开dir数组跑一遍dfs每种路径,记录每次的路径,然后得到最短路径后模拟路线输出即可
AC代码:
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include <queue>
#include<sstream>
#include <stack>
#include <set>
#include<vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<=n;++i)
#define per(i,n,a) for(int i=n;i>=a;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define maxn 100000+500
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
const int maxm = 100000+5;
const int inf=0x3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1.0);
const int mod = 1e9+7;
inline int lowbit(int x){return x&(-x);}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
void ex_gcd(ll a,ll b,ll &d,ll &x,ll &y){if(!b){d=a,x=1,y=0;}else{ex_gcd(b,a%b,d,y,x);y-=x*(a/b);}}//x=(x%(b/d)+(b/d))%(b/d);
inline ll qpow(ll a,ll b,ll MOD=mod){ll res=1;a%=MOD;while(b>0){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res;}
inline ll inv(ll x,ll p){return qpow(x,p-2,p);}
inline ll Jos(ll n,ll k,ll s=1){ll res=0;rep(i,1,n+1) res=(res+k)%i;return (res+s)%n;}
inline ll read(){ ll x = 0;char ch = getchar();while(ch>'9'||ch<'0') ch = getchar();while(ch>='0'&&ch<='9') x = (x<<3) + (x<<1) + ch - '0', ch = getchar();return x; }
int grid[10][10];
int row,col;
int ans = 1e9;
int cur = 0;
int res[50][50];
int vis[50][50];
int dir[4][2] = { {1,0}, {-1,0},{0,1},{0,-1} };
void dfs(int x, int y)
{
if(x>row||y>col||x<1||y<1||vis[x][y]||grid[x][y]||cur>ans) return;
if(x==row&&y==col)
{
vis[x][y] = 1;
if(cur<ans)
{
ans = cur;
memcpy(res,vis,sizeof(vis));
vis[x][y] = 0;
}
return;
}
rep(i,0,3)
{
cur++;
vis[x][y] = 1;
dfs(x+dir[i][0],y+dir[i][1]);
vis[x][y] = 0;
cur--;
}
}
void solve()
{
memset(vis,0,sizeof(vis));
int x = 1, y = 1;
while(1)
{
printf("(%d, %d)\n",x-1,y-1);
if(x==5&&y==5)
{
break;
}
rep(i,0,3)
{
int tox = x+dir[i][0];
int toy = y+dir[i][1];
if(tox>row||toy>col||tox<1||toy<1||vis[tox][toy]||!res[tox][toy]) continue;
vis[x][y] = 1;
x = tox, y = toy;
break;
}
}
}
int main()
{
memset(vis,0,sizeof(vis)); memset(res,0,sizeof(res));
row = col = 5;
rep(i,1,5)
rep(j,1,5)
cin>>grid[i][j];
dfs(1,1);
solve();
return 0;
}