-
Notifications
You must be signed in to change notification settings - Fork 0
/
1100.cpp
69 lines (51 loc) · 1.15 KB
/
1100.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
//moves
#include <bits/stdc++.h>
using namespace std;
#define Y first
#define X second
typedef pair<int, int> ii;
int board[8][8] = {{},{}};
int moves[8][8] = {{},{}};
int floodfill(int y, int x)
{
if(board[y][x] == 2) return 0;
int row = 8, col = 8;
int mx[] = {-2, -2, -1, 1, 2, 2, -1, 1};
int my[] = {-1, 1, -2, -2, -1, 1, 2, 2};
queue<ii> next;
moves[y][x] = 0;
next.push(ii(y, x));
while(!next.empty())
{
ii u = next.front();
next.pop();
for(int a = 0; a < 8; a++)
{
int i = u.Y + my[a];
int j = u.X + mx[a];
if(i>=0 && j>=0 && i<row && j<col && board[i][j] != 1)
{
moves[i][j] = moves[u.Y][u.X] + 1;
if(board[i][j] == 2) return moves[i][j];
board[i][j] = 1;
next.push(ii(i, j));
}
}
}
return INT_MAX;
}
int main()
{
char x1, y1, x2, y2;
while(scanf("%c%c %c%c", &x1, &y1, &x2, &y2) != EOF)
{
getchar();
memset(board, 0, sizeof board);
memset(moves, 0, sizeof board);
board[y1 - '1'][x1 - 'a'] = 3;
board[y2 - '1'][x2 - 'a'] = 2;
int m = floodfill(y1 - '1', x1 - 'a');
printf("To get from %c%c to %c%c takes %d knight moves.\n",
x1, y1, x2, y2, m);
}
}