《算法问题实战策略》 BOGGLE

oj地址是韩国网站 连接比较慢 https://algospot.com/judge/problem/read/BOGGLE
大意如下

输入输出

输入

URLPM
XPRET
GIAET
XTNZY
XOQRS

PRETTY
GIRL
REPEAT
KARA
PANDORA
GIAZAPX

输出
PRETTY YES
GIRL YES
REPEAT YES
KARA NO
PANDORA NO
GIAZAPX YES

估摸着很简单 就蹭蹭8个方向DFS 代码写完
测试用例过了
代码如下

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int n, m;
int record = ;
const int dx[] = { -,-,-,,,,, };
const int dy[] = { -,,,-,,,-, };

bool isrange(int x, int y) {
    if (x <  || x >=  || y <  || y >= )
        return false;

    return true;
}

bool hasword(int x, int y, const string& word ,int idx,const vector<vector<char>>& table)
{
    if (!isrange(x, y)) return false;

    if (table[x][y] != word[idx]) return false;

    if (idx == word.size()-) return true;

    for (int i = ; i < ; i++) {
        int nextx = x + dx[i];
        int nexty = y + dy[i];
        if (hasword(nextx, nexty, word,idx+, table))
            return true;
    }

    return false;
}

int main()
{
    int t = ;
    cin >> t;
    while (t--) {
        vector<vector<char>> table(, vector<char>(, ));
        for (int i = ; i < ; i++) {
            for (int j = ; j < ; j++) {
                cin >> table[i][j];
            }
        }

        int check = ;
        cin >> check;
        vector<string> checkWord;

        while (check--) {
            string s;
            cin >> s;
            int find = ;
            record = ;
            for (int i = ; i < ; i++) {
                for (int j = ; j < ; j++) {
                    if (hasword(i, j, s, ,table)) {
                        cout << s << " YES" << endl;
                        find = ;
                        goto LABEL;
                    }
                }
            }

        LABEL:
            if ( == find) {
                cout << s << " NO" << endl;
            }
        }
    }

    return ;
}

但是居然一个特殊用例过不了 代码被判为TLE

输入

AAAAA
AAAAA
AAAAA
AACCC
AACCB

AAAAAAAAAB

左思右想不得其门 只得针对该例子进行了特殊处理 翻转字符串！
添加代码不多 仅仅多了 reverse(s.begin(), s.end()); 一行

 #include <iostream>

 #include <iostream>
 #include <string>
 #include <vector>
 #include <algorithm>

 using namespace std;

 int n, m;

 const int dx[] = { -,-,-,,,,, };
 const int dy[] = { -,,,-,,,-, };

 vector<vector<int>> mem(, vector<int>(, ));

 bool isrange(int x, int y) {
     if (x <  || x >=  || y <  || y >= )
         return false;

     return true;
 }

 bool hasword(int x, int y, const string& word, int idx, const vector<vector<char>>& table)
 {
     if (!isrange(x, y)) {
         return false;
     }

     if (table[x][y] != word[idx]) {

         return false;
     }

     if (idx >= word.size() - ) return true;

     for (int i = ; i < ; i++) {
         int nextx = x + dx[i];
         int nexty = y + dy[i];
         if (hasword(nextx, nexty, word, idx + , table))
             return true;
     }

     return false;
 }

 int main()
 {
     int t = ;
     cin >> t;
     while (t--) {
         vector<vector<char>> table(, vector<char>(, ));
         for (int i = ; i < ; i++) {
             for (int j = ; j < ; j++) {
                 cin >> table[i][j];
             }
         }

         int check = ;
         cin >> check;
         vector<string> checkWord;

         while (check--) {
             string s;
             cin >> s;
             string copys = s;
             reverse(s.begin(), s.end());
             int find = ;
             for (int i = ; i < ; i++) {
                 for (int j = ; j < ; j++) {
                     mem[i][j] = ;
                 }
             }
             for (int i = ; i < ; i++) {
                 for (int j = ; j < ; j++) {
                     if (hasword(i, j, s, , table)) {
                         cout << copys << " YES" << endl;
                         find = ;
                         goto LABEL;
                     }
                 }
             }

         LABEL:
             if ( == find) {
                 cout << copys << " NO" << endl;
             }
         }
     }

     return ;
 }

但是实际上 当测试字符串为AAAAAAAAABAAAAAAAA 也一样会TLE
所以 实际上我们需要使用数组缓存从当前格子出发不能解决的字符串记录 避免多次重复尝试失败的路径
代码添加了一个变量数组
int d[x][y][l]; 记录x y格子出发的尝试匹配长度为l的字符串 能否成功，如果失败则置0。
下次DFS 发现该标记为 0 则直接返回 不进行尝试

 #include <bits/stdc++.h>
 using namespace std;
 int T,n,c[][],cw[],len[];
 char a[][],w[][];
 int nx[] = {,,-,-,-,,,},ny[] = {,,,,-,-,-,};
 int dx,dy,is;
 int d[][][];

 int dfs(int x,int y,int now,int l)
 {
     if(d[x][y][l]) return ;
     if(l == len[now]) return ;
     d[x][y][l] = ;
     is = ;
     for(int i = ;i < ;i++)
     {
         dx = x+nx[i];
         dy = y+ny[i];
         if(a[dx][dy] == w[now][l])
         {
             if(dfs(dx,dy,now,l+))
             {
                 //c[x][y] = 0;
                 return ;
             }
         }
     }
     //d[x][y][l] = 0;
     return ;
 }

 int main()
 {
     scanf("%d",&T);
     while(T--)
     {
         memset(cw,,sizeof(cw));
         for(int i = ;i <= ;i++)
         {
             for(int j = ;j <= ;j++)
             {
                 scanf(" %c",&a[i][j]);
             }
         }
         scanf("%d",&n);
         for(int i = ;i <= n;i++)
         {
             scanf("%s",w[i]);
             len[i] = strlen(w[i]);
             for(int j = ;j <= ;j++)
             {
                 for(int k = ;k <= ;k++)
                 {
                     if(a[j][k] == w[i][])
                     {
                         if(dfs(j,k,i,))
                         {
                             cw[i] = ;
                             break;
                         }
                     }
                 }
                 if(cw[i]) break;
             }
             memset(d,,sizeof(d));
         }
         for(int i = ;i <= n;i++)
         {
             printf("%s %s\n",w[i],((cw[i] == ) ? "YES" : "NO"));
         }
     }
 }