P1789 【Mc生存】插火把

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<deque>
#include<map>

using namespace std;

int main() {
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);
    int arr[n][n];
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            arr[i][j] = 0;
    while (m--) {
        int row, col;
        scanf("%d%d", &row, &col);
        row--, col--;
        if (row + 1 <= n - 1 && col + 1 <= n - 1)
            arr[row + 1][col + 1] = 1;
        if (row + 1 <= n - 1 && col - 1 >= 0)
            arr[row + 1][col - 1] = 1;
        if (row - 1 >= 0 && col - 1 >= 0)
            arr[row - 1][col - 1] = 1;
        if (row - 1 >= 0 && col + 1 <= n - 1)
            arr[row - 1][col + 1] = 1;
        for (int i = col - 2; i <= col + 2; i++)
            if (i >= 0 && i <= n - 1)
                arr[row][i] = 1;
        for (int i = row - 2; i <= row + 2; i++)
            if (i >= 0 && i <= n - 1)
                arr[i][col] = 1;


    }

    while (k--) {
        int row, col;
        scanf("%d%d", &row, &col);
        row--, col--;
        for (int i = row - 2; i <= row + 2; i++)
            for (int j = col - 2; j <= col + 2; j++)
                arr[i][j] = 1;
    }

    int count = 0;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (arr[i][j] == 0)
                count++;
    printf("%d\n", count);
    return 0;
}