WA了一个
查看原帖
WA了一个
847471
SPRINT_NOIP楼主2023/2/25 14:03
#include <bits/stdc++.h>
using namespace std;
int main(){
	int a[101][101] = {}, n, m, k, count = 0, x, y;
	cin >> n >> m >> k;
	for(int i = 0; i < m; ++i){
		cin >> x >> y;
		x--; y--;
		a[x][y] = 1;
		a[x - 1][y] = 1;
		a[x - 2][y] = 1;
		a[x + 1][y] = 1;
		a[x + 2][y] = 1;
		a[x - 1][y + 1] = 1;
		a[x - 1][y - 1] = 1;
		a[x + 1][y + 1] = 1;
		a[x + 1][y - 1] = 1;
		a[x][y - 1] = 1;
		a[x][y + 1] = 1;
		a[x][y - 2] = 1;
		a[x][y + 2] = 1;
	}
	for(int i = 0; i < k; ++i){
		cin >> x >> y;
		x--; y--;
		for(int t = y - 2; t <= y + 2; ++t){
			for(int f = x - 2; f <= x + 2; ++f){
				a[t][f] = 1;
			}
		}
	}
	for(int i = 0; i < n; ++i){
		for(int j = 0; j < n; ++j){
			//cout << a[i][j] << " ";
			if(a[i][j] == 0) count++;
		}
		//cout << endl;
	}
	cout << count;
	return 0;
}
2023/2/25 14:03
加载中...