제출 #124538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124538		NMAC427	과수원 (NOI14_orchard)	C++14	25 / 25	148 ms	23928 KiB

orchard

// https://oj.uz/problem/view/NOI14_orchard

#include <bits/stdc++.h>

#define int int64_t
#define coutV(x) for (const auto& e: x) {cerr << e << " ";} cerr << "\n"

using namespace std;

int N, M;
int totalApples = 0;

vector<vector<int>> orc;

inline int query(int i1, int j1, int i2, int j2) {
	return orc[i2][j2] + orc[i1][j1] - orc[i1][j2] - orc[i2][j1];
}

signed main() {
	
	#ifndef __APPLE__
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	#endif

	cin >> N >> M;

	orc = vector<vector<int>>(N + 1, vector<int>(M + 1, 0));

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			int16_t v; 
			cin >> v;

			totalApples += v;

			orc[i + 1][j + 1] = 2 * v - 1;
			orc[i + 1][j + 1] += orc[i + 1][j] + orc[i][j + 1] - orc[i][j];
		}
	}


	#ifdef __APPLE__
	for (int i = 0; i <= N; i++) {
		for (int j = 0; j <= M; j++) {
			cerr << orc[i][j] << " ";
		} cerr << "\n";
	} cerr << "\n";
	#endif

	int maxSavings = 0;
	for (int i1 = 0; i1 < N; i1++) {
		for (int i2 = i1 + 1; i2 <= N; i2++) {
			// Maximum Subsetsum
			int currentSum = 0;

			for (int j = 0; j < M; j++) {
				currentSum += query(i1, j, i2, j + 1);;
				currentSum = max(currentSum, (int) 0);
				maxSavings = max(maxSavings, currentSum);
			}
		}
	}

	// for (int i1 = 0; i1 < N; i1++) {
	// 	for (int j1 = 0; j1 < M; j1++) {
	// 		for (int i2 = i1 + 1; i2 <= N; i2++) {
	// 			for (int j2 = j1 + 1; j2 <= M; j2++) {
	// 				int q = query(i1, j1, i2, j2);
	// 				maxSavings = max(maxSavings, q);
	// 			}
	// 		}
	// 	}
	// }

	cout << totalApples - maxSavings << "\n";
}

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