搜索-B
来源:互联网 发布:java中注解有几种 编辑:程序博客网 时间:2024/05/16 02:21
- 原题
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:
A1Scenario #2:
impossibleScenario #3:
A1B3C1A2B4C2A3B1C3A4B2C4
思路解析
给定一个棋盘,让骑士走遍棋盘每一个格子。并将路径按字典序输出,既然能走遍棋盘每一个格子,肯定能经过A1,那不妨以A1为出发点。AC代码
#include<bits/stdc++.h> using namespace std; int path[88][88], vis[88][88], p, q, cnt; bool flag; int dx[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; int dy[8] = {-2, -2, -1, -1, 1, 1, 2, 2}; bool judge(int x, int y) { if(x >= 1 && x <= p && y >= 1 && y <= q && !vis[x][y] && !flag) 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 i, j, n, cas = 0; scanf("%d",&n); while(n--) { flag = 0; scanf("%d%d",&p,&q); memset(vis,0,sizeof(vis)); vis[1][1] = 1; DFS(1,1,1); printf("Scenario #%d:\n",++cas); if(flag) { for(i = 1; i <= p * q; i++) printf("%c%d",path[i][1] - 1 + 'A',path[i][0]); } else printf("impossible"); printf("\n"); if(n != 0) printf("\n"); } return 0; }
- 搜索-B
- 搜索 B
- 搜索-B
- 搜索 B
- 搜索 B
- 搜索--B
- 搜索-B
- 搜索比赛B题
- 搜索专题 B
- 搜索 B题
- 搜索练习题B-02
- 搜索-day2-B题
- kuangbin 简单搜索 B
- B+树 插入删除搜索
- 搜索(B - Oil Deposits)
- Codeforces 782B 二分搜索
- 搜索结构之B-Tree
- GG 。B的搜索技巧?
- bzoj 2683 简单题
- 设计一个网络图片浏览器
- 如何通过Tenable SCCV快速查找受到”永恒之蓝”感染的主机
- Discovery
- codeforces C. Naming Company 贪心+博弈
- 搜索-B
- Apache_tomcat配置域名-绑定项目
- 【python】使用urllib,requests调google translate API
- shadowssdt 地址 数量 遍历
- 使用ffmpeg步骤
- LeetCode--easy
- Pb菜单工具栏图标顺序的设置
- leetcode 529. Minesweeper
- 使用IDEA搭建Maven