Submission #72497906

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#define INF (100LL * 1000 * 1000 * 10)
int m, n;
int a, b;
int c[1024][1024];
long long sum[1024][1024];
int main(void) {
  int i, j;
  long long ans = INF;
  if (scanf("%d%d", &m, &n) != 2) return 1;
  if (scanf("%d%d", &a, &b) != 2) return 1;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (scanf("%d", &c[i][j]) != 1) return 1;
      sum[i][j] = sum[i][j - 1] + (c[i][j] < 0 ? INF : c[i][j]);
    }
    for (j = 1; j <= m; j++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

#define INF (100LL * 1000 * 1000 * 10)

int m, n;
int a, b;
int c[1024][1024];

long long sum[1024][1024];

int main(void) {
	int i, j;
	long long ans = INF;
	if (scanf("%d%d", &m, &n) != 2) return 1;
	if (scanf("%d%d", &a, &b) != 2) return 1;
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= m; j++) {
			if (scanf("%d", &c[i][j]) != 1) return 1;
			sum[i][j] = sum[i][j - 1] + (c[i][j] < 0 ? INF : c[i][j]);
		}
		for (j = 1; j <= m; j++) {
			sum[i][j] += sum[i - 1][j];
		}
	}
	for (i = b; i <= n; i++) {
		for (j = a; j <= m; j++) {
			long long candidate = sum[i][j] - sum[i][j - a] - sum[i - b][j] + sum[i - b][j - a];
			if (candidate < ans) ans = candidate;
		}
	}
	printf("%d\n", (int)ans);
	return 0;
}

Submission Info

Judge Result