题意:
给一张带有指向性的图:
SESWE
EESNW
NWEEN
EWSEN
分别代表上下左右,指定起点0, k - 1,问按指示能否走出这张图,或者走入一个环。
解析:
按图一个一个往下走就行了,若当前步被访问过,则存在环。
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1
using namespace std;
const int maxn = 100 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);
int n, m, k;
int loop, step;
char g[maxn][maxn];
int vis[maxn][maxn];
void dfs(int x, int y)
{
if (x < 0 || n <= x || y < 0 || m <= y || loop != 0)
{
if (loop != 0)
{
printf("%d step(s) before a loop of %d step(s)\n", step - loop, loop);
}
else
{
printf("%d step(s) to exit\n", step);
}
return;
}
if (vis[x][y] == -1)
{
vis[x][y] = ++step;
}
else
{
loop = step - vis[x][y] + 1;
}
if (g[x][y] == 'N')
dfs(x - 1, y);
if (g[x][y] == 'E')
dfs(x, y + 1);
if (g[x][y] == 'S')
dfs(x + 1, y);
if (g[x][y] == 'W')
dfs(x, y - 1);
}
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
while (~scanf("%d%d%d", &n, &m, &k))
{
if (!n && !m)
break;
for (int i = 0; i < n; i++)
scanf("%s", g[i]);
memset(vis, -1, sizeof(vis));
loop = 0;
step = 0;
dfs(0, k - 1);
}
return 0;
}