poj2488A Knight's Journey

原创 2016年08月30日 12:24:51


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 <cstdio>

#include <iostream>
using namespace std;
int p, q, path[88][88], vis[88][88];//p,q输入的横轴竖轴,path代表路径,vis代表点否访问
bool flag;//判断最后是不是所有的点都经过一遍


int dx[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };
int dy[8] = { -2, -1, 1, 2, 2, 1, -1, -2 };


bool judge(int x, int y)
{
if (x >= 1 && x <= p&&y >= 1 && y <= q&&vis[x][y] == 0 && flag == false)
return true;
return false;
}


void DFS(int r, int c, int step)
{
path[step][0] = r;
path[step][1] = c;
if (step == p*q)
{
flag = true;
return;
}
for (int i = 0; i < 8; i++)
{
int nx = r + dx[i];
int ny = c + dy[i];
if (judge(nx, ny))
{
vis[nx][ny] = 1;
DFS(nx, ny, step + 1);
vis[nx][ny] = 0;
}
}
}
int main()
{
int n, cas = 0;
while (cin >> n)
{


while (n--)
{
flag = 0;
cin >> p >> q;
vis[1][1] = 1;
DFS(1, 1, 1);
cout << "Scenario #" << ++cas <<":"<<endl;
if (flag)
{
for (int i = 1; i <= p*q; i++)
{
cout << (char)('A' + path[i][1] - 1) << path[i][0];
}
}
else
cout << "impossible";
cout << endl;
if (n != 0)
cout << endl;



}

}
system("pause");
return 0;

}


第一次写,感觉好难,看着别人的代码写的。

首先定义dx,dy。用于选择x,y轴走的方向,path里面记录的是走过的 路径,path[step][0]记录的是横轴,path[step][1]记录的是竖轴,step记录走的步数,


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 <cstdio>

#include <iostream>
using namespace std;
int p, q, path[88][88], vis[88][88];//p,q输入的横轴竖轴,path代表路径,vis代表点否访问
bool flag;//判断最后是不是所有的点都经过一遍


int dx[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };
int dy[8] = { -2, -1, 1, 2, 2, 1, -1, -2 };


bool judge(int x, int y)
{
if (x >= 1 && x <= p&&y >= 1 && y <= q&&vis[x][y] == 0 && flag == false)
return true;
return false;
}


void DFS(int r, int c, int step)
{
path[step][0] = r;
path[step][1] = c;
if (step == p*q)
{
flag = true;
return;
}
for (int i = 0; i < 8; i++)
{
int nx = r + dx[i];
int ny = c + dy[i];
if (judge(nx, ny))
{
vis[nx][ny] = 1;
DFS(nx, ny, step + 1);
vis[nx][ny] = 0;
}
}
}
int main()
{
int n, cas = 0;
while (cin >> n)
{


while (n--)
{
flag = 0;
cin >> p >> q;
vis[1][1] = 1;
DFS(1, 1, 1);
cout << "Scenario #" << ++cas <<":"<<endl;
if (flag)
{
for (int i = 1; i <= p*q; i++)
{
cout << (char)('A' + path[i][1] - 1) << path[i][0];
}
}
else
cout << "impossible";
cout << endl;
if (n != 0)
cout << endl;



}

}
system("pause");
return 0;

}


第一次写,感觉好难,看着别人的代码写的。

首先定义dx,dy。用于选择x,y轴走的方向,path里面记录的是走过的 路径,path[step][0]记录的是横轴,path[step][1]记录的是竖轴,step记录走的步数,


版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ2488 A Knight's Journey(DFS)

题意: 输入一些棋盘对应的行和列,看骑士(日字)能不能走完整个棋盘,可以从任何地方开始,注意要字典序输出 要点: 虽然说骑士可以从棋盘上任意一点出发,但因为要按字典序(lexicographic...

POJ2488--A Knight's Journey

Description Background The knight is getting bored of seeing the same black and white squares ag...
  • a305657
  • a305657
  • 2013年02月27日 14:08
  • 280

A Knight's Journey (poj 2488 DFS)

给你一个p*q的国际象棋棋盘,问马从任意一点出发能否每个点只经过一次把所有的点都遍历完。其实只需要从最左上角开始走就行了,因为如果每个点都能走到起点在哪就无所谓了。另外要按字典序输出,则dir数组是一...

poj 2488A Knight's Journey(DFS+回溯)

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4646...

POJ 2488 A Knight's Journey (DFS + 记录路径)

A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 32388 Accept...

POJ 2488 A Knight's Journey(基础题)

 A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: ...

poj 2488 A Knight's Journey(深度优先搜索)

     刚开始练习搜索,今天做这个破题,做了一天到晚上9点才给AC,做到最后我差点崩溃了,在过程中我遇到了N多问题,最主要的原因无非就是方向问题。以前没有怎么用过方向数组,做那种简单的深度搜索题也就...

poj 2488 A Knight's Journey 骑士周游

这个题意还是能理解就是不会各种搜索遍历 这些日子写写DFS BFS 基础题 这个先是看别人的思路,  自己写, 再看别人代码, 然后各种改才A掉的 基本照抄了。 #include #incl...

poj2488 A Knight's Journey 简单DFS 注意搜索步骤

这一题是比较简单的搜索题,但是题目要求走法是按照字典序的,这样要求搜索时注意顺序。///2014.3.10 ///poj2488 //16MS /** *简单的DFS,但是题目有个坑人的地方,就...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj2488A Knight's Journey
举报原因:
原因补充:

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