Poj 2488 A Knight's Journey

A Knight's Journey

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

深搜求字典序最小的 遍历完 整个矩形的序列。

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<stdlib.h>
using namespace std;
int p,q;
bool map[30][30];
char path[30][2];
int dir[8][2] = {-2,-1,-2,1,-1,-2,-1,2,1,-2,1,2,2,-1,2,1};
bool flag = false;
bool dfs(int x,int y,int step){
	if(step >= p*q){
		return flag = true;
	}
	int nx,ny;
	for (int i = 0; i < 8; i++)
	{
		nx = x+dir[i][0];
		ny = y+dir[i][1];
		if(nx < 1 || nx > q)continue;
		if(ny < 1 || ny > p)continue;
		if(map[nx][ny] == false){
			path[step][0] = nx;
			path[step][1] = ny;
			map[nx][ny] = true;
			dfs(nx,ny,step+1);
			if(flag)
				return true;
			map[nx][ny] = false;
		}
	}
	return false;
}
int main(){
	int t;
	scanf("%d",&t);
	int cas = 1;
	while(t--){
		memset(map,false,sizeof(map));
		scanf("%d%d",&p,&q);
		flag = false;
		printf("Scenario #%d:\n",cas++);
		path[0][0] = 1;
		path[0][1] = 1;
		map[1][1] = true;
		if(dfs(1,1,1)){
			for (int i = 0; i < p*q; i++)
			{
				printf("%c%c",path[i][0]-1+'A',path[i][1]+'0');
			}
		}else printf("impossible");
		printf("\n\n");
	}
	return 0;
}