单词方阵【DFS】

#include <bits/stdc++.h>
using namespace std;
constexpr size_t maxn = 105;
int dx[9]={1,0,1,-1,0,-1,1,-1};//八个方位 
int dy[9]={0,1,1,0,-1,-1,-1,1};
char mp[maxn][maxn];
bool vis[maxn][maxn];
int pos[9][2], n;
string standard = "yizhong";
bool judge(int x, int y){
	return x >= 0 && x < n && y >= 0 && y < n;
}
void dfs(int x, int y, int p, int k, int cnt){
	//cout << x << " " << y << endl;
	pos[cnt][0]= x;
	pos[cnt][1] = y;
	if(standard[p] == 'g')
	{
		//cout << 1 << endl; 
		for(int i = 0; i < 7; ++ i){
			vis[pos[i][0]][pos[i][1]] = true;
		}
		return;
	}
	int nx = x + dx[k];
	int ny = y + dy[k];

	if(judge(x, y) && mp[nx][ny] == standard[p + 1]){
		dfs(nx, ny, p + 1, k, cnt + 1);
	}

}


int main(){
	//freopen("input.txt","r",stdin);


	cin >> n;
	for(int i = 0; i < n; ++ i){
		for(int j = 0; j < n; ++ j){
			cin >> mp[i][j];
		}
	}
	for(int i = 0; i < n; ++ i){
		for(int j = 0; j < n; ++ j){

			if(mp[i][j] == 'y'){
				for(int k = 0; k < 8; ++ k)
				{
					int x = i + dx[k];
					int y = j + dy[k];
					if(mp[x][y] == 'i'){
						if(judge(x, y)){
							pos[0][0] = i;
							pos[0][1] = j;
							//cout << endl;
							//cout << i << " " << j << endl;

							dfs(x, y, 1, k, 1);
						}
					}
				}
			}
		}
	}

	for(int i = 0; i < n; ++ i){
		for(int j = 0; j < n; ++ j){
			if(vis[i][j])
			cout << mp[i][j];
			else
			cout << '*';
		}
		cout << endl;
	}

}