数据结构大作业——在一个字符矩阵中找到某个单词是否出现过

#include <bits/stdc++.h>
#define change_read() freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin)
using namespace std;
struct p
{
    const static int maxm = 1e3+10;
    char mat[maxm][maxm];///store the matrix
};
int changex[8]= {
  0,0,1,-1,1,1,-1,-1}; ///the direction of the x-axis change
int changey[8]= {
  1,-1,0,0,1,-1,1,-1}; ///the direction of the y-axis change
const static int maxm = 1e5+10;///the max number of the nodes
int son[maxm][26];///dictionary tree
int num[maxm];///which word in