#include <iostream>
#include <cstring>
using namespace std;
int height, width;
int board[1001][1001];//0=safe, 1=queen, 2=king, 3=pawn, 4=queen_can_reach, 5=king_can_reach
struct chess{
int locx;
int locy;
};
bool init() {
cin >> height >> width;
memset(board, 0, sizeof(board));
return height && width;
}
void print() {
for(int i = 1; i <= height; i++) {
for(int j = 1; j <= width; j++) {
cout << board[i][j] << ' ';
}
cout << endl;
}
}
void processQ(chess qu[], int nq) {
for(int count = 0; count < nq; count++) {
int ox = qu[count].locx, oy = qu[count].locy;
for(int i = ox - 1; i >= 1; i--) {
if(board[i][oy] == 1 || board[i][oy] == 2 || board[i][oy] == 3) {
break;
}
board[i][oy] = 4;
}
for(int i = ox + 1; i <= height; i++) {
if(board[i][oy] == 1 || board[i][oy] == 2 || board[i][oy] == 3) {
break;
}
board[i][oy] = 4;
}
for(int i = oy - 1; i >= 1; i--) {
if(board[ox][i] == 1 || board[ox][i] == 2 || board[ox][i] == 3) {
break;
}
board[ox][i] = 4;
}
for(int i = oy + 1; i <= width; i++) {
if(board[ox][i] == 1 || board[ox][i] == 2 || board[ox][i] == 3) {
break;
}
board[ox][i] = 4;
}
for(int i = ox - 1, j = oy - 1; i >= 1 && j >= 1; i--, j--) {
if(board[i][j] == 1 || board[i][j] == 2 || board[i][j] == 3) {
break;
}
board[i][j] = 4;
}
for(int i = ox + 1, j = oy - 1; i <= height && j >= 1; i++, j--) {
if(board[i][j] == 1 || board[i][j] == 2 || board[i][j] == 3) {
break;
}
board[i][j] = 4;
}
for(int i = ox - 1, j = oy + 1; i >= 1 && j <=width; i--, j++) {
if(board[i][j] == 1 || board[i][j] == 2 || board[i][j] == 3) {
break;
}
board[i][j] = 4;
}
for(int i = ox + 1, j = oy + 1; i <= height && j <= width; i++, j++) {
if(board[i][j] == 1 || board[i][j] == 2 || board[i][j] == 3) {
break;
}
board[i][j] = 4;
}
}
}
bool isValid(int x, int y) {
return x >= 1 && x <= height && y >= 1 && y <= width;
}
void processK(chess ki[], int nk) {
int xadd[8] = {-2, -2, -1, -1, 1, 1, 2, 2};
int yadd[8] = {-1, 1, -2, 2, -2, 2, -1, 1};
for(int count = 0; count < nk; count++) {
for(int i = 0; i < 8; i++) {
int x = ki[count].locx + xadd[i];
int y = ki[count].locy + yadd[i];
if(isValid(x, y) && board[x][y] == 0) {
board[x][y] = 5;
}
}
}
}
void process(chess qu[], chess ki[], int nq, int nk) {
if(nq) {
processQ(qu, nq);
}
if(nk) {
processK(ki, nk);
}
}
void findSafePlace(int& safeN) {
for(int i = 1; i <= height; i++) {
for(int j = 1; j <= width; j++) {
if(board[i][j] == 0) {
safeN++;
}
}
}
//print();
}
int main() {
int cases = 1;
while(init()) {
int numOfQueen, numOfKing, numOfPawn;
cin >> numOfQueen;
chess q[numOfQueen];
for(int i = 0; i < numOfQueen; i++) {
cin >> q[i].locx >> q[i].locy;
board[q[i].locx][q[i].locy] = 1;
}
cin >> numOfKing;
chess k[numOfKing];
for(int i = 0; i < numOfKing; i++) {
cin >> k[i].locx >> k[i].locy;
board[k[i].locx][k[i].locy] = 2;
}
cin >> numOfPawn;
chess p[numOfPawn];
for(int i = 0; i < numOfPawn; i++) {
cin >> p[i].locx >> p[i].locy;
board[p[i].locx][p[i].locy] = 3;
}
process(q, k, numOfQueen, numOfKing);
int safePosNum = 0;
findSafePlace(safePosNum);
cout << "Board " << cases << " has " << safePosNum
<< " safe squares." << endl;
cases++;
}
return 0;
}
1172. Queens, Knights and Pawns
最新推荐文章于 2024-09-18 18:23:55 发布