Submission #183455


Source Code Expand

#include <stdio.h>
#include <algorithm>
using namespace std;

int n,m;
int dat[128][128];
int sum[128][128];

int main(){
	scanf("%d%d",&n,&m);
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m;j ++) {
			scanf("%d",&dat[i][j]);
			if ((i+j)%2) {
				dat[i][j] = -dat[i][j];
			}
			sum[i+1][j+1] = sum[i+1][j] + sum[i][j+1] - sum[i][j] + dat[i][j];
		}
	}
	int ans = 0;
	for(int i = 0; i < n; i++) {
		for(int j = i;j<n;j++){
			for(int k = 0;k<m;k++){
				for(int l = k;l < m;l++){
					if (sum[j+1][l+1] - sum[j+1][k] - sum[i][l+1] + sum[i][k] == 0) {
						ans = max(ans, (j-i+1) * (l-k+1));
					}
				}
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task B - チョコレート
User kcm1700
Language C++ (G++ 4.6.4)
Score 100
Code Size 690 Byte
Status AC
Exec Time 108 ms
Memory 924 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:13:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 25
Set Name Test Cases
Sample subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.txt
All subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt
Case Name Status Exec Time Memory
subtask0_sample-01.txt AC 20 ms 796 KB
subtask0_sample-02.txt AC 20 ms 796 KB
subtask0_sample-03.txt AC 20 ms 796 KB
subtask0_sample-04.txt AC 20 ms 668 KB
subtask0_sample-05.txt AC 19 ms 788 KB
subtask1_01.txt AC 21 ms 684 KB
subtask1_02.txt AC 20 ms 716 KB
subtask1_03.txt AC 20 ms 796 KB
subtask1_04.txt AC 19 ms 784 KB
subtask1_05.txt AC 19 ms 796 KB
subtask1_06.txt AC 20 ms 672 KB
subtask1_07.txt AC 19 ms 712 KB
subtask1_08.txt AC 21 ms 792 KB
subtask1_09.txt AC 105 ms 920 KB
subtask1_10.txt AC 32 ms 788 KB
subtask1_11.txt AC 90 ms 920 KB
subtask1_12.txt AC 94 ms 920 KB
subtask1_13.txt AC 92 ms 916 KB
subtask1_14.txt AC 107 ms 924 KB
subtask1_15.txt AC 108 ms 916 KB
subtask1_16.txt AC 87 ms 916 KB
subtask1_17.txt AC 89 ms 916 KB
subtask1_18.txt AC 19 ms 788 KB
subtask1_19.txt AC 19 ms 924 KB
subtask1_20.txt AC 88 ms 920 KB