제출 #477861

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
477861		BThero	Orchard (NOI14_orchard)	C++17	4 / 25	1096 ms	8136 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));

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

	int ans = (int)1e9;

	for (int x1 = 0; x1 < n; x1++) {
		for (int y1 = 0; y1 < m; y1++) {
			for (int x2 = x1; x2 < n; x2++) {
				for (int y2 = y1; y2 < m; y2++) {
					int cnt = 0;

					for (int x = 0; x < n; x++) {
						for (int y = 0; y < m; y++) {
							if (x1 <= x && x <= x2 && y1 <= y && y <= y2) {
								cnt += (a[x][y] == 0);
							}
							else {
								cnt += (a[x][y] == 1);
							}
						}
					}

					ans = min(ans, cnt);
				}
			}
		}
	}

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

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