马走日
直接记录当前走了几个格子,如果已经遍历完所有的格子,就将答案加一.
#include<bits/stdc++.h>
using namespace std;
int n, m, x, y;
int res;
const int N = 10;
bool st[N][N];
int dx[8] = { -2, -1, 1, 2, 2, 1, -1, -2 };
int dy[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };
void dfs(int x, int y, int cnt)
{
if (cnt == n * m)
{
res++;
return;
}
st[x][y] = true;//不可以和上面换位置
for (int i = 0;i < 8;i++)
{
int a = x + dx[i];
int b = y + dy[i];
if (a < 0 || a >= n || b < 0 || b >= m || st[a][b])
continue;
dfs(a, b, cnt + 1);
}
st[x][y] = false;
}
int main()
{
int T;cin >> T;
while (T--)
{
cin >> n >> m >> x >> y;
memset(st, 0, sizeof st);//加不加都行,因为回溯后都是false了
int res = 0;
dfs(x, y, 1);
cout << res << endl;
}
}
还有一种回溯方式👇,这种在for里面回溯(其实只要是在哪里标记就在哪里回溯,保证这个即可),需要每次把st数组清空,而且得把起点先标记了。
bool vis[N][N];
void dfs (int x,int y,int t) {
if (t == n * m)
{
ans++;
return ;
}
for (int i = 0;i < 8;i++)
{
int a = x + dx[i],b = y + dy[i];
if (a < 1 || a > n || b < 1 || b > m || vis[a][b])
continue;
vis[a][b] = true;
dfs (a,b,t + 1);
vis[a][b] = false;
}
}
int main ()
{
cin >> t;
while (t--) {
ans = 0;
memset (vis,false,sizeof (vis));
cin >> n >> m >> sx >> sy;
sx++,sy++;
vis[sx][sy] = true;
dfs (sx,sy,1);
cout << ans << endl;
}
}
单词接龙
#include<bits/stdc++.h>
using namespace std;
int n;
const int N = 22;
string word[N];
int g[N][N];
int cnt[N];//统计字符出现的次数
int ans;
void dfs(string dragon, int last)
{
ans = max((int)dragon.size(), ans);//max的参数类型得一致
cnt[last]++;
for (int i = 1;i <= n;i++)
if (g[last][i] && cnt[i] < 2)
dfs(dragon + word[i].substr(g[last][i]), i);
cnt[last]--;
}
int main()
{
cin >> n;
for (int i = 1;i <= n;i++)
cin >> word[i];
string s;cin >> s;
for(int i=1;i<=n;i++)
for (int j = 1;j <= n;j++)
for (int k = 1;k <= min(word[i].size(),word[j].size());k++)
if (word[i].substr(word[i].size() - k, k) == word[j].substr(0, k))
{
g[i][j] = k;
break;
}
for (int i = 1;i <= n;i++)
{
if (word[i][0] == s[0])
dfs(word[i], i);//目前是word下标是i
}
cout<<ans;
}