USACO: Camelot

Camelot
IOI 98

Centuries ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to celebrate their fellowship. In remembrance of these events, we consider a board game for one player, on which one chesspiece king and several knight pieces are placed on squares, no two knights on the same square.

This example board is the standard 8x8 array of squares:

The King can move to any adjacent square from  to  as long as it does not fall off the board:

 

A Knight can jump from to , as long as it does not fall off the board:

 

During the play, the player can place more than one piece in the same square. The board squares are assumed big enough so that a piece is never an obstacle for any other piece to move freely.

The player's goal is to move the pieces so as to gather them all in the same square - in the minimal number of moves. To achieve this, he must move the pieces as prescribed above. Additionally, whenever the king and one or more knights are placed in the same square, the player may choose to move the king and one of the knights together from that point on, as a single knight, up to the final gathering point. Moving the knight together with the king counts as a single move.

Write a program to compute the minimum number of moves the player must perform to produce the gathering. The pieces can gather on any square, of course.

PROGRAM NAME: camelot

INPUT FORMAT

Line 1:	Two space-separated integers: R,C, the number of rows and columns on the board. There will be no more than 26 columns and no more than 30 rows.
Line 2..end:	The input file contains a sequence of space-separated letter/digit pairs, 1 or more per line. The first pair represents the board position of the king; subsequent pairs represent positions of knights. There might be 0 knights or the knights might fill the board. Rows are numbered starting at 1; columns are specified as upper case characters starting with `A'.

SAMPLE INPUT (file camelot.in)

8 8
D 4
A 3 A 8
H 1 H 8

The king is positioned at D4. There are four knights, positioned at A3, A8, H1, and H8.

OUTPUT FORMAT

A single line with the number of moves to aggregate the pieces.

SAMPLE OUTPUT (file camelot.out)

10

SAMPLE OUTPUT ELABORATION

They gather at B5.
Knight 1: A3 - B5 (1 move)
Knight 2: A8 - C7 - B5 (2 moves)
Knight 3: H1 - G3 - F5 - D4 (picking up king) - B5 (4 moves)
Knight 4: H8 - F7 - D6 - B5 (3 moves)
1 + 2 + 4 + 3 = 10 moves.
 

解题思路：

BFS，灰常奇怪地没经过怎么剪枝就都0.06s之内通过了，当然，26 * 30 * 26 * 30的穷举其实也不大。

这道题写得相当烦，唯一值得称道之处是我想出了一种节省空间的存储步数方法：设置一个最大数infi，一开始每个格子初始化为num * infi，然后每个骑士经过一个未经过的格子时，该格子先减去infi，再加上该骑士目前的步数：可以想象，假如不是每个骑士都经过了这个格子，那么这个格子最后的步值就会不小于infi了。

另外，关于king的步数：一开始初始化为kingStep[i][j] = max(abs(i - king.x), abs(j - king.y));这是king自己一步一步走需要的步值。每次新位置入队列的时候判断一下，在这里带上king是否可以减少步数，然后更新。

代码有点冗长，甚看，会头晕的……

/* ID: geterns1 PROG: camelot LANG: C++ */ #include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; // const int infi = 100000; const int maxRow = 50; const int maxCol = 50; struct position{ char x, y; }; // int r, c; position king, kngt[maxRow * maxCol]; int num; //a queue for BFS position queue[maxRow * maxCol]; int head, cnt, hhlp, chlp; //arrays saving result int step; int kngtStep[maxRow][maxCol]; //the minimum step's sum of the knights int kingStep[maxRow][maxCol]; //the minimum step of the king bool reach[maxRow][maxCol]; //save the state "reached" or not void inil(){ step = 0; head = cnt = 0; for (int i = 0; i < r; i ++) memset(reach[i], 0, c); } //help to check the position only once bool chk[8]; inline void check(char x, char y){ chk[0] = (x > 0); chk[1] = (x > 1); chk[2] = (x < r - 1); chk[3] = (x < r - 2); chk[4] = (y > 0); chk[5] = (y > 1); chk[6] = (y < c - 1); chk[7] = (y < c - 2); } int main(){ freopen("camelot.in", "r", stdin); freopen("camelot.out", "w", stdout); //input char x; short y; num = 0; scanf("%d %d/n", &r, &c); scanf("%c %hd/n", &x, &y); king.x = y - 1; king.y = x - 'A'; while (scanf("%c %hd", &x, &y) != EOF){ kngt[num].x = y - 1; kngt[num].y = x - 'A'; getchar(); num ++; } // for (int i = 0; i < r; i ++){ for (int j = 0; j < c; j ++){ kngtStep[i][j] = num * infi; //watch this!!! kingStep[i][j] = max(abs(i - king.x), abs(j - king.y)); //and this!!! } } for (int i = 0; i < num; i ++){ inil(); queue[cnt ++] = kngt[i]; reach[queue[0].x][queue[0].y] = true; while (cnt){ hhlp = head + cnt; chlp = 0; while (head < hhlp){ kngtStep[queue[head].x][queue[head].y] += step - infi; //!!! check(queue[head].x, queue[head].y); if (chk[0] && chk[5] && !reach[queue[head].x - 1][queue[head].y - 2]){ reach[queue[head].x - 1][queue[head].y - 2] = true; queue[hhlp + chlp].x = queue[head].x - 1; queue[hhlp + chlp].y = queue[head].y - 2; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } if (chk[0] && chk[7] && !reach[queue[head].x - 1][queue[head].y + 2]){ reach[queue[head].x - 1][queue[head].y + 2] = true; queue[hhlp + chlp].x = queue[head].x - 1; queue[hhlp + chlp].y = queue[head].y + 2; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } if (chk[2] && chk[5] && !reach[queue[head].x + 1][queue[head].y - 2]){ reach[queue[head].x + 1][queue[head].y - 2] = true; queue[hhlp + chlp].x = queue[head].x + 1; queue[hhlp + chlp].y = queue[head].y - 2; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } if (chk[2] && chk[7] && !reach[queue[head].x + 1][queue[head].y + 2]){ reach[queue[head].x + 1][queue[head].y + 2] = true; queue[hhlp + chlp].x = queue[head].x + 1; queue[hhlp + chlp].y = queue[head].y + 2; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } if (chk[4] && chk[1] && !reach[queue[head].x - 2][queue[head].y - 1]){ reach[queue[head].x - 2][queue[head].y - 1] = true; queue[hhlp + chlp].x = queue[head].x - 2; queue[hhlp + chlp].y = queue[head].y - 1; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } if (chk[6] && chk[1] && !reach[queue[head].x - 2][queue[head].y + 1]){ reach[queue[head].x - 2][queue[head].y + 1] = true; queue[hhlp + chlp].x = queue[head].x - 2; queue[hhlp + chlp].y = queue[head].y + 1; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } if (chk[4] && chk[3] && !reach[queue[head].x + 2][queue[head].y - 1]){ reach[queue[head].x + 2][queue[head].y - 1] = true; queue[hhlp + chlp].x = queue[head].x + 2; queue[hhlp + chlp].y = queue[head].y - 1; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } if (chk[6] && chk[3] && !reach[queue[head].x + 2][queue[head].y + 1]){ reach[queue[head].x + 2][queue[head].y + 1] = true; queue[hhlp + chlp].x = queue[head].x + 2; queue[hhlp + chlp].y = queue[head].y + 1; if (kingStep[queue[head].x][queue[head].y] < kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y]) kingStep[queue[hhlp + chlp].x][queue[hhlp + chlp].y] = kingStep[queue[head].x][queue[head].y]; chlp ++; } head ++; } cnt = chlp; step ++; } } // step = infi; for (int i = 0; i < r; i ++) for (int j = 0; j < c; j ++) if (kngtStep[i][j] + kingStep[i][j] < step) step = kngtStep[i][j] + kingStep[i][j]; printf("%d/n", step); fclose(stdin); fclose(stdout); return 0; }