백준 1986번 체스 C++

https://www.acmicpc.net/problem/1986

1986번: 체스

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int dRow_Q[8] = { -1,1,1,-1,-1,0,1,0 };
int dCol_Q[8] = { 1,1,-1,-1,0,1,0,-1 };

int dRow_K[8] = { -2,-1,1,2,2,1,-1,-2 };
int dCol_K[8] = { 1,2,2,1,-1,-2,-2,-1 };

int n, m, q, k, p;
vector<vector<int>> board;
vector<pair<int, int>> queens;
vector<pair<int, int>> knights;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m;
    board = vector<vector<int>>(n + 1, vector<int>(m + 1, 0));
    cin >> q;
    for (int i = 0; i < q; i++) {
        int r, c;
        cin >> r >> c;
        board[r][c] = 1;
        queens.push_back({ r,c });
    }
    cin >> k;
    for (int i = 0; i < k; i++) {
        int r, c;
        cin >> r >> c;
        board[r][c] = 2;
        knights.push_back({ r,c });
    }
    cin >> p;
    for (int i = 0; i < p; i++) {
        int r, c;
        cin >> r >> c;
        board[r][c] = 3;
    }
    for (auto a : queens) {
        int row = a.first;
        int col = a.second;

        for (int i = 0; i < 8; i++) {
            int nextRow = row;
            int nextCol = col;
            while (true) {
                nextRow += dRow_Q[i];
                nextCol += dCol_Q[i];
                if (nextRow <= 0 || nextRow > n) break;
                if (nextCol <= 0 || nextCol > m) break;
                if (board[nextRow][nextCol] > 0) break;
                board[nextRow][nextCol] = -1;
            }
        }
    }
    for (auto a : knights) {
        int row = a.first;
        int col = a.second;

        for (int i = 0; i < 8; i++) {
            int nextRow = row + dRow_K[i];
            int nextCol = col + dCol_K[i];
            if (nextRow <= 0 || nextRow > n) continue;
            if (nextCol <= 0 || nextCol > m) continue;
            if (board[nextRow][nextCol] > 0) continue;
            board[nextRow][nextCol] = -1;
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (board[i][j] == 0) ans++;
        }
    }
    cout << ans;
}