题面传送门http://poj.org/problem?id=2488
要点:1.如果有路径可以不重复遍历,那么遍历从原点开始必然可以遍历。(并不是说有路径可以不重复遍历,则从每个点开始都可以遍历)
详情见https://pipakacha.com/2019/07/poj2488knights-journeydfs%E9%A9%AC%E8%B8%8F%E6%A3%8B%E7%9B%98/
2.输出字典序,则搜索的方向上原则是:列越小,行越小(先列后行)
#include <iostream>
#include <stdio.h>
using namespace std;
int dir[8][2] = {-2,-1,-2,1,-1,-2,-1,2,1,-2,1,2,2,-1,2,1}; //最小字典序移动顺序
const int maxn = 26;
int vis[maxn][maxn]; //遍历标志位
int path[maxn][2]; //路径记录x, y
int p, q, tar;
void DSP(int i, int j, int k)
{
if(k == p * q)
{
for (int i = 0; i < k;i ++)
printf("%c%d",path[i][0] + 65,path[i][1] + 1);
printf("\n");
tar = 1;
}
else
{
for (int x = 0; x < 8; x++)
{
int m = i + dir[x][1];
int n = j + dir[x][0];
if(m >= 0 && m < p && n >= 0 && n < q && !vis[m][n] && !tar)
{
path[k][0] = n;
path[k][1] = m;
vis[m][n] = 1;
DSP(m , n , k + 1);
vis[m][n] = 0;
}
}
}
}
int main()
{
int n;
scanf("%d",&n);
for(int m = 0; m < n; m++)
{
scanf("%d %d", &p, &q);
tar = 0;
printf("Scenario #%d:\n", m + 1);
for (int i = 0; i < p; i ++)
for (int j = 0; j < q; j++)
vis[i][j] = 0;
vis[0][0] = 1;
path[0][0] = 0;
path[0][1] = 0;
DSP(0, 0, 1);
if(!tar) printf("impossible\n");
printf("\n");
}
}