oj.uz

Submission #38880

# Submission time Handle Problem Language Result Execution time Memory
38880 2018-01-07T13:56:23 Z cheater2k Orchard (NOI14_orchard) C++14
25 / 25
 433 ms 17808 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 155;

int n, m;
int *a[N], *sum[N];
int ans = 1e9;

void init() {
	for (int i = 0; i <= n; ++i) {
		a[i] = new int [m + 2];
		sum[i] = new int [m + 2];
	}
}

int get1(int x0, int y0, int x1, int y1) {
	return sum[x1][y1] - sum[x0 - 1][y1] - sum[x1][y0 - 1] + sum[x0 - 1][y0 - 1];
}

int get0(int x0, int y0, int x1, int y1) {
	return (x1 - x0 + 1) * (y1 - y0 + 1) - get1(x0, y0, x1, y1);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	init();

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

	for (int ru = 1; ru <= n; ++ru) { // up
		for (int rd = ru; rd <= n; ++rd) { // down
			int more = get1(1, 1, ru - 1, m) + get1(rd + 1, 1, n, m);
			int mn = 1e9;
			int max_pref = 0;
			for (int c = 1; c <= m; ++c) {
				int cur = get0(ru, 1, rd, c);
				mn = min(mn, cur - max_pref + get1(ru, c + 1, rd, m));
				max_pref = max(max_pref, cur - get1(ru, 1, rd, c));
				//printf("ru = %d rd = %d c = %d\n cur = %d\n -> mn = %d\n", ru, rd, c, cur, mn);
			}
			ans = min(ans, mn + more);
		}
	}

	cout << ans << endl;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2176 KB Output is correct
2 Correct 0 ms 2176 KB Output is correct
3 Correct 0 ms 2176 KB Output is correct
4 Correct 0 ms 2176 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2324 KB Output is correct
2 Correct 0 ms 2324 KB Output is correct
3 Correct 0 ms 2324 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 17808 KB Output is correct
2 Correct 96 ms 17808 KB Output is correct
3 Correct 106 ms 17808 KB Output is correct

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4528 KB Output is correct
2 Correct 19 ms 4528 KB Output is correct
3 Correct 19 ms 4528 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2176 KB Output is correct
2 Correct 13 ms 2308 KB Output is correct
3 Correct 13 ms 2308 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 396 ms 8072 KB Output is correct
2 Correct 433 ms 8072 KB Output is correct
3 Correct 416 ms 8072 KB Output is correct