最后一个点RE了。

#include<iostream>
#include<deque>
#include<map>
using namespace std;
long long n;
string s[120];
long long vis[120][120];
int nx[10]={-1,-1,0,1,-1,0,1,1};
int ny[10]={-1,0,-1,-1,1,1,1,0};
string word="yizhong";
deque<pair<int,int> > q;
void dfs(int x,int y,int k,int cnt){
	if(q.size()>6){
		for(int i=1;i<=7;i++){
			vis[q.front().first][q.front().second]=1;
			q.pop_front();
			
		}
		return;
	}
	int xx=x+nx[k];
	int yy=y+ny[k];
	if(xx>=0&&xx<n&&yy>=0&&yy<n&&s[xx][yy]==word[cnt]){
		q.push_back(make_pair(xx,yy));
		dfs(xx,yy,k,cnt+1);
		q.pop_back();
	}
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>s[i]; 
	}for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(s[i][j]=='y'){
				q.push_back(make_pair(i,j));dfs(i,j,0,1);q.clear();
				q.push_back(make_pair(i,j));dfs(i,j,1,1);q.clear();
				q.push_back(make_pair(i,j));dfs(i,j,2,1);q.clear();
				q.push_back(make_pair(i,j));dfs(i,j,3,1);q.clear();
				q.push_back(make_pair(i,j));dfs(i,j,4,1);q.clear();
				q.push_back(make_pair(i,j));dfs(i,j,5,1);q.clear();
				q.push_back(make_pair(i,j));dfs(i,j,6,1);q.clear();
				q.push_back(make_pair(i,j));dfs(i,j,7,1);q.clear();
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(vis[i][j]){
				cout<<s[i][j];
			}else{
				cout<<"*";
			}
		}cout<<endl;
	}
	return 0;
}