http://poj.org/problem?id=2488
A Knight's Journey
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 25663 | Accepted: 8758 |
Description
Background
The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey
around the world. Whenever a knight moves, it is two squares in one direction and one square perpendicular to this. The world of a knight is the chessboard he is living on. Our knight lives on a chessboard that has a smaller area than a regular 8 * 8 board, but it is still rectangular. Can you help this adventurous knight to make travel plans?
Problem
Find a path such that the knight visits every square once. The knight can start and end on any square of the board.
Input
The input begins with a positive integer n in the first line. The following lines contain n test cases. Each test case consists of a single line with two positive integers p and q, such that 1 <= p * q <= 26. This represents a p * q chessboard, where p describes how many different square numbers 1, . . . , p exist, q describes how many different square letters exist. These are the first q letters of the Latin alphabet: A, . . .
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the lexicographically first path that visits all squares of the chessboard with knight moves followed by an empty line. The path should be given on a single line by concatenating the names of the visited squares. Each square name consists of a capital letter followed by a number.
If no such path exist, you should output impossible on a single line.
Sample Input
3
1 1
2 3
4 3
Sample Output
Scenario #1:
A1
Scenario #2:
impossible
Scenario #3:
A1B3C1A2B4C2A3B1C3A4B2C4
Source
解析:从最小点开始进行dfs
Memory: 152K Time: 0MS
*/
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
const int maxn=32;
int p,q;
struct node
{
int x;
int y;
}path[maxn*maxn+1];
int d[8][2] = { /// 字典序最小的走法顺序
{-2,-1}, {-2,1}, {-1,-2},{-1,2},
{1,-2},{1,2},{2,-1},{2,1}};
int vis[maxn][maxn];
int allow(int x,int y)
{
if(x>=0&&x<q&&y>=0&&y<p)
return 1;
else
return 0;
}
int dfs(int x,int y,int cnt)
{ path[cnt].x=x;
path[cnt].y=y;
vis[x][y]=1;
// printf("cnt==%d\n",cnt);
if(cnt==p*q)
return 1;
for(int i=0;i<8;i++)
{
int tx=x+d[i][0];
int ty=y+d[i][1];
if(allow(tx,ty)&&!vis[tx][ty])
{
if(dfs(tx,ty,cnt+1))
return 1;
}
}
vis[x][y]=0;
return 0;
}
int main()
{
int T,i,j,c=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&p,&q);
memset(vis,0,sizeof(vis));
printf("Scenario #%d:\n",++c);
if(!dfs(0,0,1))
printf("impossible\n\n");
else
{
for(i=1;i<=q*p;i++)
printf("%c%d",path[i].x+'A',path[i].y+1);
printf("\n\n");
}
}
}