思路
数组的下表要从0开始存,取膜的时候可以采用: ((x%p)+p)%p 的形式进行,处理负数。开vis数组记录访问,如果一个下标不同的点被访问了两次,那就有解了,否则就无解。
代码
#include <cstdio>
#include <iostream>
using namespace std;
const int inf = 1e9;
char ch[1510][1510];
int vis[1510][1510][2], x1, y1, n, m;
int b1[]={0,1,-1,0,0};
int b2[]={0,0,0,1,-1};
bool dfs(int x, int y){
int xx = ((x%n)+n)%n;
int yy = ((y%m)+m)%m;
if(ch[xx][yy] == '#') return false;
if(vis[xx][yy][0] != inf)
return vis[xx][yy][0] != x || vis[xx][yy][1] != y;
vis[xx][yy][0] = x, vis[xx][yy][1] = y;
for(int i = 1; i <= 4; i ++)
if(dfs(x+b1[i], y+b2[i])) return true;
return false;
}
int main(){
while(scanf("%d%d", &n, &m) == 2){
for(int i = 0; i <= n; i ++)
for(int j = 0; j <= m; j ++)
vis[i][j][0] = vis[i][j][1] = inf;
for(int i = 0; i < n; i ++) scanf("%s", ch[i]);
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
if(ch[i][j] == 'S') x1 = i, y1 = j;
if(dfs(x1,y1))printf("Yes\n");
else printf("No\n");
}
return 0;
}