60分求助!!!
查看原帖
60分求助!!!
696035
goldKing楼主2024/7/14 21:42
#include<bits/stdc++.h> 
using namespace std;
int a[1010][1010];
int main()
{
	int n,m,k,x,y,o,p,ans = 0;
	cin >> n >> m >> k;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= n;j++)
			a[i][j] = 0;
	}
	for(int i = 1;i <= m;i++)
	{
		cin >> x >> y;
		a[x-2][y] = 1;
		a[x-1][y-1] = 1;
		a[x-1][y] = 1;
		a[x-1][y+1] = 1;
		a[x][y-2] = 1;
		a[x][y-1] = 1;
		a[x][y] = 1;
		a[x][y+1] = 1;
		a[x][y+2] = 1;
		a[x+1][y-1] = 1;
		a[x+1][y] = 1;
		a[x+1][y+1] = 1;
		a[x+2][y] = 1;
	}
	for(int i = 1;i <= k;i++)
	{
		cin >> o >> p;
		a[o-2][p-2] = 1;
		a[o-2][p-1] = 1;
		a[o-2][p] = 1;
		a[o-2][p+1] = 1;
		a[o-2][p+2] = 1;
		a[o-1][p-2] = 1;
		a[o-1][p-1] = 1;
		a[o-1][p] = 1;
		a[o-1][p+1] = 1;
		a[o-1][p+2] = 1;
		a[o][p-2] = 1;
		a[o][p-1] = 1;
		a[o][p] = 1;
		a[o][p+1] = 1;
		a[o][p+2] = 1;
		a[o+1][p-2] = 1;
		a[o+1][p-1] = 1;
		a[o+1][p] = 1;
		a[o+1][p+1] = 1;
		a[o+1][p+2] = 1;
		a[o+2][p-2] = 1;
		a[o+2][p-1] = 1;
		a[o+2][p] = 1;
		a[o+2][p+1] = 1;
		a[o+2][p+2] = 1;
	}
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= n;j++)
		{
			if(a[i][j] == 0)
				ans++;
		}
	}
	cout << ans;
	return 0;
}
2024/7/14 21:42
加载中...