oj.uz

Submission #706683

# Submission time Handle Problem Language Result Execution time Memory
706683 2023-03-07T11:06:56 Z Trisanu_Das Orchard (NOI14_orchard) C++17
25 / 25
 214 ms 13920 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n, m, o = 0;
	cin >> n >> m;
	int a[n + 1][m + 1], pref[m + 1];
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			if(a[i][j]) o++;
			else a[i][j] = -1;
		}
	}
    int ans = INT_MIN;
	for(int i = 1; i < n + 1; i++){
		memset(pref, 0, sizeof(pref));
		for(int j = i; j < n + 1; j++){
			int s = 0;
			for(int k = 1; k <= m; k++){
				pref[k] += a[j][k];
				s = max(pref[k], s + pref[k]);
				ans = max(s, ans);
			}
		}
	}
	cout << o - ans << '\n'; 
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 13920 KB Output is correct
2 Correct 164 ms 13920 KB Output is correct
3 Correct 156 ms 13920 KB Output is correct

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2356 KB Output is correct
2 Correct 30 ms 2224 KB Output is correct
3 Correct 30 ms 2228 KB Output is correct

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 4692 KB Output is correct
2 Correct 190 ms 4636 KB Output is correct
3 Correct 199 ms 4712 KB Output is correct