答案都一样，可是只有60分

#include<iostream>
using namespace std;
int a[105][105] = {};
int main() {
	int n, m, k;
	cin >> n >> m >> k;
	int mx = 0, my = 0;//火把
	int ox = 0, oy = 0;//萤石
	for (int i = 1; i <= m; i++) {
		cin >> mx >> my;
		for (int xx = mx - 1; xx <= mx + 1; xx++) {
			for (int yy = my - 1; yy <= my + 1; yy++) {
				a[xx][yy] = 1;
			}
		}
		a[mx][my - 2] = 1;
		a[mx][my + 2] = 1;
		a[mx-2][my] = 1;
		a[mx+2][my] = 1;
	}
	for (int i = 1; i <= k; i++) {
		cin >> ox >> oy;
			for (int xx = ox - 2; xx <= ox + 2; xx++) {
				for (int yy = oy - 2; yy <= oy + 2; yy++) {
					a[xx][yy] = 1;
					}
				}
	}
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (a[i][j] == 0)sum++;
			//cout << a[i][j]<<" ";
		}
		//cout << endl;
	}
	cout << sum;
}