zoukankan      html  css  js  c++  java
  • HDU1372搜索

    Knight Moves

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 9320    Accepted Submission(s): 5495


    Problem Description
    A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight moves between two given squares and that, once you have accomplished this, finding the tour would be easy.
    Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part. 

    Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b. 
     

    Input
    The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard. 
     

    Output
    For each test case, print one line saying "To get from xx to yy takes n knight moves.". 
     

    Sample Input
    e2 e4 a1 b2 b2 c3 a1 h8 a1 h7 h8 a1 b1 c3 f6 f6
     

    Sample Output
    To get from e2 to e4 takes 2 knight moves. To get from a1 to b2 takes 4 knight moves. To get from b2 to c3 takes 2 knight moves. To get from a1 to h8 takes 6 knight moves. To get from a1 to h7 takes 5 knight moves. To get from h8 to a1 takes 6 knight moves. To get from b1 to c3 takes 1 knight moves.

    To get from f6 to f6 takes 0 knight moves.

    题意:象棋中悍马从起点到终点所需要走的最少步数

    #include <iostream>
    #include <cstdio>
    #include <string>
    #include <cstring>
    #include <queue>
    
    using namespace std;
    
    char c1, c2;
    int n1, n2, n3, n4;
    int map[10][10];
    int b[8][2] = {2,1,1,2,2,-1,1,-2,-1,-2,-2,-1,-2,1,-1,2};
    int ans = 0;
    struct node {
    	int x;
    	int y;
    	int step;
    };
    
    int judge(int x, int y) {
    	if ((x<1 || x>8) || (y<1 || y>8))	return 0;
    	if (map[x][y])	return 0;
    	return 1;
    }
    
    int bfs() {
    	node cur, next;
    	cur.x = n1;
    	cur.y = n3;
    	cur.step = 0;
    	map[n1][n3] = 1;
    	queue <node> q;
    	q.push(cur);
    	while (!q.empty()) {
    		cur = q.front();
    		q.pop();
    		if (cur.x == n2 && cur.y == n4)	return cur.step;
    		for (int i = 0; i<8; i++) {
    			next.x = cur.x + b[i][0];
    			next.y = cur.y + b[i][1];
    			if (next.x == n2 && next.y == n4)	return cur.step+1;
    			if (judge(next.x, next.y)) {
    				
    				next.step = cur.step + 1;
    				map[next.x][next.y] = 1;
    				q.push(next);
    			}
    			//cout << i<< endl;
    			
    		}
    		
    	}
    	return -1;
    }
    
    int main() {
    	while (cin >> c1>> n1 >> c2>> n2) {
    		n3 = (int)c1-96;
    		n4 = (int)c2-96;
    		//cout << n3 << endl << n4 << endl;
    		
    		memset(map, 0, sizeof(map));
    		ans = bfs();
    		cout << "To get from "<<c1<< n1<<" to "<<c2<< n2<<" takes " << ans << " knight moves." << endl;
    	}
    	return 0;
    }


  • 相关阅读:
    poj 1837 Balance
    poj 3009 Curling 2.0
    vagrant up 无法加载映像目录
    liunx 查看php 安装的扩展
    树莓派 添加超级管理员身份
    Sublime text追踪函数插件:ctags[转载]
    手动安装m4, autoconf, automake, libtool
    nginx: [error] invalid PID number "" in "/usr/local/nginx/logs/nginx.pid"
    如何将编码转为自己想要的编码 -- gbk utf-8
    laravel 增删修改
  • 原文地址:https://www.cnblogs.com/Tovi/p/6194811.html
Copyright © 2011-2022 走看看