搜索 || DFS || POJ 2488 A Knight's Journey

给一个矩形棋盘,每次走日字,问能否不重复的走完棋盘的每个点,并将路径按字典序输出

*解法:按字典序输出路径,因此方向向量的数组按字典序写顺序,dfs+回溯,注意flag退出递归的判断,并且用pre记录路径

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char a[30][30];
int dx[] = {-2, -2, -1, -1, 1, 1, 2, 2};
int dy[] = {-1, 1, -2, 2, -2, 2, -1, 1};
int vis[30][30];
int P, Q, flag = 0;
struct node
{
    int x, y;
}pre[30][30];
void dfs(int x, int y, int step)
{
    if(step == P * Q)
    {
        flag = 1;
        return;
    }
    if(flag) return;//全走完了之后就不用再走了
    for(int i = 0; i < 8; i++)
    {
        int xx = x + dx[i], yy = y + dy[i];
        if(xx >= 0 && xx < P && yy >= 0 && yy < Q && !vis[xx][yy])
        {
            vis[xx][yy] = 1;
            step++;
            pre[x][y] = (node){xx, yy};//用pre输出路径
            dfs(xx, yy, step);
            if(flag) return;//===全走完了之后就不用再走了===
            vis[xx][yy] = 0;
            step--;
        }
    }
    return;
}
int main()
{
    int T, cc = 0;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d %d", &Q, &P);
        memset(vis, 0, sizeof(vis));
        flag = 0;
        vis[0][0] = 1;
        dfs(0,0,1);
        printf("Scenario #%d:\n", ++cc);
        if(!flag) printf("impossible\n");
        else
        {
            int ux = 0, uy = 0, vx, vy;
            for(int i = 0; i < P * Q; i++)
            {
                char c = ux + ‘A‘;
                int z = uy + 1;
                printf("%c%d", c, z);
                vx = pre[ux][uy].x, vy = pre[ux][uy].y;
                ux = vx, uy = vy;
            }
            printf("\n");
        }
        printf("\n");
    }
    return 0;
}

  

搜索 || DFS || POJ 2488 A Knight's Journey

原文地址:https://www.cnblogs.com/pinkglightning/p/8410395.html

时间: 2024-10-05 13:54:48

搜索 || DFS || POJ 2488 A Knight's Journey的相关文章

dfs/poj 2488 A Knight&#39;s Journey

1 #include<cstdio> 2 using namespace std; 3 const int b[8][2]={{-2,-1},{-2,1},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1}}; 4 int a[30][30],p,q; 5 struct 6 { 7 int x,y; 8 }step[910]; 9 10 bool dfs(int x,int y,int now) 11 { 12 if (now==p*q) return true;

POJ 2488 A Knight&#39;s Journey (DFS)

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 30656   Accepted: 10498 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 ar

poj 2488 A Knight&#39;s Journey(dfs+字典序路径输出)

转载请注明出处:http://blog.csdn.net/u012860063?viewmode=contents 题目链接:http://poj.org/problem?id=2488 ---------------------------------------------------------------------------------------------------------------------------------------------------------- 欢

poj 2488 A Knight&#39;s Journey (DFS)

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 34660   Accepted: 11827 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 ar

POJ 2488 A Knight&#39;s Journey

A Knight's Journey Time Limit: 1000ms Memory Limit: 65536KB This problem will be judged on PKU. Original ID: 248864-bit integer IO format: %lld      Java class name: Main Background  The knight is getting bored of seeing the same black and white squa

POJ 2488 A Knight&#39;s Journey _BFS

1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <algorithm> 5 #define CL(x, y) memset(x, y, sizeof(x)) 6 using namespace std; 7 const int MAX = 28; 8 int N, a, b, flag; 9 int chessboard[MAX*MAX], used[MAX]

POJ 2488 -- A Knight&#39;s Journey(骑士游历)

POJ 2488 -- A Knight's Journey(骑士游历) 题意: 给出一个国际棋盘的大小,判断马能否不重复的走过所有格,并记录下其中按字典序排列的第一种路径. 经典的"骑士游历"问题 输入:第一行,整数n,接下来是n行,每一行为p和q,p为行数,q为列数,p用1...p编号,q用A...Q编号 马的走法:每步棋先横走或直走一格,然后再往外斜走一格;或者先斜走一格,最后再往外横走或竖走一格(即走"日"字).可以越子,没有中国象棋中的"蹩马腿&

POJ 2488 A Knight&#39;s Journey 递归回溯题解

简单的递归回溯法,锻炼基本的编程能力. 这类题是对代码能力的要求比对思想的要求高点. 而且要审题,题目要求安lexicographically 顺序输出,不小心递归的顺序就会输出错误了. 棋盘是由数字列或者行,和字母列或者行组成的,故此输出结果要注意. 个人觉得我的递归回溯写法是非常清晰, 工整的,O(∩_∩)O哈哈~ #include <stdio.h> #include <string.h> const int MAX_N = 27; bool board[MAX_N][MAX

POJ 2488:A Knight&amp;#39;s Journey

A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 29241   Accepted: 10027 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 ar