cf1581C 二维前缀和+思维优化

题意：https://www.luogu.com.cn/problem/CF1580A

思路：首先枚举起点和矩形长和高，然后考虑优化，优化的思路则为最小的矩形最多修改16次，而起点不变，矩形变大时中间部分修改只会越来越多，上边界和左边界同样。所以只要这三部分加起来大于16了就可以break了。

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
typedef pair<int, int> pii;
#define int long long
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
string s[405];
int sum[405][405];
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while (t--) {
		int n, m;
		cin >> n >> m;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				sum[i][j] = 0;
			}
		}
		for (int i = 1; i <= n; i++) {
			cin >> s[i];
			s[i] = '!' + s[i];
		}
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (s[i][j] == '1') {
					sum[i][j] = 1;
				}
			}
		}
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + sum[i][j];
			}
		}
		int mx = 1e9;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				for (int k = 5; k + i - 1 <= n; k++) {
					for (int r = 4; r + j - 1 <= m; r++) {
						int i1 = i + k - 1;
						int j1 = r + j - 1;
						int ans = sum[i1 - 1][j1 - 1] - sum[i][j1 - 1] - sum[i1 - 1][j] + sum[i][j];
						int x1 = sum[i][j1 - 1] - sum[i][j] - sum[i - 1][j1 - 1] + sum[i - 1][j];
						int x2 = sum[i1 - 1][j] - sum[i][j] - sum[i1 - 1][j - 1] + sum[i][j - 1];
						int y1 = sum[i1][j1 - 1] - sum[i1 - 1][j1 - 1] - sum[i1][j] + sum[i1 - 1][j];
						int y2 = sum[i1 - 1][j1] - sum[i1 - 1][j1 - 1] - sum[i][j1] + sum[i][j1 - 1];
						x1 = r - 2 - x1;
						x2 = k - 2 - x2;
						y1 = r - 2 - y1;
						y2 = k - 2 - y2;
						mx = min(mx, ans + x1 + x2 + y1 + y2);
						if (ans + x1 + x2 >= 16) {
							break;
						}
					}
				}
			}
		}

		cout << mx << endl;
	}
	return 0;
}