poj 2488 A Knight's Journey

原创 2015年07月10日 21:55:30
A Knight's Journey
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 34677   Accepted: 11835

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

TUD Programming Contest 2005, Darmstadt, Germany
问是否能马跳整个图,dfs就行



                   .-' _..`.
                  /  .'_.'.'
                 | .' (.)`.
                 ;'   ,_   `.
 .--.__________.'    ;  `.;-'
|  ./               /
|  |               / 
`..'`-._  _____, ..'
     / | |     | |\ \
    / /| |     | | \ \
   / / | |     | |  \ \
  /_/  |_|     |_|   \_\
 |__\  |__\    |__\  |__\

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
int xx[9]={0,-2,-2,-1,-1,1,1,2,2};
int yy[9]={0,-1,1,-2,2,-2,2,-1,1};
int mp[50][50];
int T,m,n,flag;
struct path
{
	int x,y;
}p[233];
bool check(int x,int y)
{
	if(x>0&&y>0&&x<=n&&y<=m&&mp[x][y]==0) return true;
	return false;
}
void dfs(int x,int y,int step)
{
	p[step].x=x;
	p[step].y=y;
	//cout<<x<<" "<<y<<" "<<step<<endl;
	if(step==m*n)
	{
		flag=1;
		return ;
	}
	for(int i=1;i<=8;i++)
	{
		if(check(x+xx[i],y+yy[i]))
		{
			mp[x+xx[i]][y+yy[i]]=1;
			dfs(x+xx[i],y+yy[i],step+1);
			if(flag) return ;
			mp[x+xx[i]][y+yy[i]]=0;
		}
	}
}

int main()
{
	cin>>T;
	int _case=0;
	while(T--)
	{
		cout<<"Scenario #"<<++_case<<":"<<endl;
		cin>>m>>n;
		flag=0;
		memset(mp,0,sizeof(mp));
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				memset(mp,0,sizeof(mp));
				mp[i][j]=1;
				dfs(i,j,1);
				if(flag) break;
				mp[i][j]=0;
			}
			if(flag) break;
		}
		if(!flag) cout<<"impossible"<<endl<<endl;
		else
		{
			for(int i=1;i<=m*n;i++)
				cout<<(char)(p[i].x+'A'-1)<<p[i].y;
			cout<<endl<<endl;
		}
	}
	return 0;
}



AYITACM2016省赛第一周(深搜) E - A Knight's Journey骑士的旅行

E - A Knight's Journey Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u...
  • linyuxilu
  • linyuxilu
  • 2016年04月18日 21:43
  • 339

POJ2488 A Knight's Journey(深搜DFS,字典序,骑士游历问题)

题目: A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4298...
  • riba2534
  • riba2534
  • 2017年01月07日 17:35
  • 648

POJ 2488:A Knight's Journey 深搜入门之走马观花

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 35342   Accept...
  • u010885899
  • u010885899
  • 2015年07月31日 14:57
  • 527

A Knight's Journey(深度搜索)

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4268...
  • jinzk123
  • jinzk123
  • 2016年12月05日 21:07
  • 144

poj 1935(搜索+回溯)

 解题思路: 先我们考虑从源点出发到所有自己想要经过的点然后在回到源点sum,显然每条边都必须经过源点(这个我们可以一次dfs求出),但题目的意思是可以不用回到源点,那么我们可以再求源点到所有要...
  • hexianhao
  • hexianhao
  • 2016年02月24日 16:46
  • 385

Knight Tour 骑士走棋盘算法(附代码)

骑士的走法为国际象棋的走法,骑士可以由任何一个位置出发,要求走完所有的位置。 基本情况下是可以使用递归,但是在递归维度大的时候,时间复杂度很高,效率很低。 下面介绍一个聪明的解法:...
  • Chuck_0430
  • Chuck_0430
  • 2013年08月24日 22:04
  • 2807

POJ-2488 A Knight's Journey(需注意搜索顺序的深搜)

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2695...
  • u012628310
  • u012628310
  • 2013年12月05日 12:09
  • 537

The knight\'s tour(马周游问题)

三个策略:1、先从中心点开始走;2、往靠边走;3、对下一步进行评分,低分的先走。/*马周游问题,m*n的棋盘,放置在其上的马能否恰好访问每一个方格一次并回到起始位置深度优先搜索,若寻找到满足要求的解,...
  • zhihang1103
  • zhihang1103
  • 2013年09月26日 21:37
  • 860

POJ2488(A Knight's Journey)(DFS+按字典序输出)

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 37150   Accept...
  • hdd871532887
  • hdd871532887
  • 2016年01月08日 13:09
  • 455

深度优先搜索1-A Knight's Journey(算法基础 第6周)

问题描述: 分析 题目挺难理解的,参考:https://www.slyar.com/blog/poj-2488-c.html 源码#include #include usin...
  • NNNNNNNNNNNNY
  • NNNNNNNNNNNNY
  • 2016年06月14日 00:49
  • 339
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 2488 A Knight's Journey
举报原因:
原因补充:

(最多只允许输入30个字)