sicily 1172 Queens, Knights and Pawns

直接模拟就好了，好像没有什么巧办法~

#include <bits/stdc++.h>

using namespace std;

struct point {
    int x;
    int y;
}q[105], k[105];

int ans;
char board[1005][1005];

void judge_queen(int num, int n, int m)
{
    int move_x[]={-1,-1,-1,0,0,1,1,1};
    int move_y[]={1,0,-1,1,-1,1,0,-1};
    for(int i=0; i<num; i++)
    {    
        for(int j=0; j<8; j++)
        {
            int tempx = q[i].x;
            int tempy = q[i].y;
            tempx += move_x[j];
            tempy += move_y[j];
            while(tempx >= 1 && tempx <= n && tempy >= 1 && tempy <= m)
            {    
                if(board[tempx][tempy] != 'K' && board[tempx][tempy] != 'P' && board[tempx][tempy] != 'Q')
                {
                    if(board[tempx][tempy] != '1')
                    {
                        board[tempx][tempy] = '1';
                        ans++;
                    }    
                }
                else
                    break;
                tempx += move_x[j];
                tempy += move_y[j];
            }    
        }
    }
}

void judge_knight(int num, int n, int m)
{
    int move_x[]={-2,-2,-1,-1,1,1,2,2};
    int move_y[]={1,-1,2,-2,2,-2,1,-1};
    for(int i=0; i<num; i++)
    {
        for(int j=0; j<8; j++)
        {
            int tempx = k[i].x + move_x[j];
            int tempy = k[i].y + move_y[j];
            //cout << tempx << " " << tempy << endl;
            if(tempx >= 1 && tempx <= n && tempy >= 1 && tempy <= m)
            {
                if(board[tempx][tempy] != 'P' && board[tempx][tempy] != 'K' && board[tempx][tempy] != 'Q' && board[tempx][tempy] != '1')
                {
                    board[tempx][tempy] = '1';
                    ans++;
                }                
            }    
        }
    }
}

void print(int n, int m)
{
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
            cout << board[i][j] << " ";
        cout << endl;
    }    
}

int main()
{
    int n, m;
    int count=1;
    while(scanf("%d%d", &n, &m) != EOF, n, m)
    {
        memset(board, 0, sizeof(board));
        ans=0;
        int tot=0;
        int qnum, knum, pnum, xx, yy;
        scanf("%d", &qnum);
        for(int i=0; i<qnum; i++)
        {
            scanf("%d%d", &q[i].x, &q[i].y);
            board[q[i].x][q[i].y] = 'Q';
        }
        scanf("%d", &knum);
        for(int i=0; i<knum; i++)
        {
            scanf("%d%d", &k[i].x, &k[i].y);
            board[k[i].x][k[i].y] = 'K';
        }
        scanf("%d", &pnum);
        for(int i=0; i<pnum; i++)
        {
            scanf("%d%d", &xx, &yy);
            board[xx][yy] = 'P';
        }
        tot = tot + qnum + knum + pnum;
        //print(n, m);
        judge_queen(qnum, n, m);
        judge_knight(knum, n, m);
        printf("Board %d has %d safe squares.
", count++, n*m-ans-tot);
    }
    
    return 0;
}