# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727918 | rainboy | Orchard (NOI14_orchard) | C11 | 173 ms | 6108 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#define NM 1000000
int min(int a, int b) { return a < b ? a : b; }
int main() {
static int aa[NM];
int n, m, i, i1, i2, j, k, sum, ans;
scanf("%d%d", &n, &m);
k = 0;
for (i = 0; i < n; i++)
for (j = 0; j < m; j++) {
int a;
scanf("%d", &a);
if (a == 1)
aa[i * m + j] = -1, k++;
else
aa[i * m + j] = 1;
}
for (j = 0; j < m; j++)
for (i = 1; i < n; i++)
aa[i * m + j] += aa[(i - 1) * m + j];
ans = n * m;
for (i1 = 0; i1 < n; i1++)
for (i2 = i1; i2 < n; i2++) {
sum = 0;
for (j = 0; j < m; j++) {
sum = min(sum + aa[i2 * m + j] - (i1 == 0 ? 0 : aa[(i1 - 1) * m + j]), 0);
ans = min(ans, k + sum);
}
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |