제출 #477865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
477865		BThero	Orchard (NOI14_orchard)	C++17	25 / 25	341 ms	17916 KiB

orchard

#include <bits/stdc++.h>

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using namespace std;

typedef long long ll;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<vector<int>> a(n, vector<int>(m, 0));
	vector<vector<int>> p(n + 1, vector<int>(m + 1, 0));

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

	int ans = (int)1e9;
	int cnt = 0;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cnt += a[i][j];

			if (a[i][j] == 1) {
				a[i][j] = -1;
			}
			else {
				a[i][j] = 1;
			}
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			p[i + 1][j + 1] = a[i][j]
			+ p[i][j + 1]
			+ p[i + 1][j]
			- p[i][j];
		}
	}

	for (int x1 = 0; x1 < n; x1++) {
		for (int x2 = x1 + 1; x2 <= n; x2++) {
			vector<int> T(m + 1, 0);
			T[m] = p[x2][m] - p[x1][m];

			for (int y = m - 1; y >= 0; y--) {
				T[y] = min(T[y + 1], p[x2][y] - p[x1][y]);
			}
		
			for (int y = 0; y < m; y++) {
				int cur = p[x1][y] - p[x2][y] + T[y + 1];
				ans = min(ans, cnt + cur);
			}
		}
	}

	cout << ans << '\n';
	return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 5 / 5
• Subtask 4: 3 / 3
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5