【练习记录】202104-2 邻域均值

202104-2 邻域均值

70分代码（纯暴力）

#include<iostream>
using namespace std;
const int N = 1000;
int a[N][N];
int n, L, r, t;
bool isB(int x,int y) {
	x += 200, y += 200;
	int count = 0, sum = 0;
	for (int i = x - r; i <= x + r; i++) {
		for (int j = y - r; j <= y + r; j++) {
			if (a[i][j] != -1) {
				sum += a[i][j];
				count++;
			}
		}
	}
	return (count * t >= sum);
}
int main()
{
	int res = 0;
	cin >> n >> L >> r >> t;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			a[i][j] = -1;
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin>>a[i+200][j+200];
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (isB(i, j)) res++;
		}
	}
	cout << res;
	return 0;
}

100分代码：略做优化，写得稀烂

#include<iostream>
#include<vector>
using namespace std;
const int N = 1000;
int a[N][N];
int n, L, r, t;
vector<int> res[N][N];
vector<int> countP(int x, int y) {
	x += 200, y += 200;
	int count = 0, sum = 0;
	for (int i = x - r; i <= x + r; i++) {
		for (int j = y - r; j <= y + r; j++) {
			if (a[i][j] != -1) {
				sum += a[i][j];
				count += 1;
			}
		}
	}
	vector<int> t;
	t.push_back(sum);
	t.push_back(count);
	return t;
}

vector<int> countP2(int x, int y, vector<int> piror) {
	x += 200, y += 200;
	int count1 = 0, count2 = 0, sum1 = 0, sum2 = 0;
	for (int i = y - r; i <= y + r; i++) {
		if (a[x-r-1][i] != -1) {
			count1 += 1;
			sum1 += a[x - r - 1][i];
		}
	}

	for (int i = y - r; i <= y + r; i++) {
		if (a[x+r][i] != -1) {
			count2 += 1;
			sum2 += a[x + r][i];
		}
	}

	vector<int> t;
	t.push_back(piror[0] - sum1 + sum2);
	t.push_back(piror[1] - count1 +count2);

	return t;
}
int main()
{

	cin >> n >> L >> r >> t;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			a[i][j] = -1;
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> a[i + 200][j + 200];
		}
	}

	for (int i = 0; i < n; i++) {
		res[0][i] = countP(0, i);
	}

	for (int i = 1; i < n; i++) {
		for (int j = 0; j < n; j++) {
			res[i][j] = countP2(i, j, res[i - 1][j]);
		}
	}
	int mycount = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (res[i][j][0] <= t * res[i][j][1]) {
				mycount++;
			}
		}
	}
	cout<< mycount;
	return 0;
}