Submission #2786684


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<double, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define EPS (1e-10)

void add_mod(ll &a, ll b){
	a += b;
	a %= MOD;
}

void mul_mod(ll &a, ll b){
	a *= b;
	a %= MOD;
}

int main(void){
	int i,j,p,q,h,w,c,d[2][123][123],ans=0;
	fill(d[0][0],d[2][0],0);
	cin >> h >> w;
	for(i=1; i<=h; ++i){
		for(j=1; j<=w; ++j){
			cin >> c;
			d[(i+j)%2][i][j] = c;
		}
	}
	for(i=0; i<=h; ++i){
		for(j=1; j<=w; ++j){
			d[0][i][j] += d[0][i][j-1];
			d[1][i][j] += d[1][i][j-1];
		}
	}
	for(i=1; i<=h; ++i){
		for(j=0; j<=w; ++j){
			d[0][i][j] += d[0][i-1][j];
			d[1][i][j] += d[1][i-1][j];
		}
	}
	for(i=0; i<h; ++i){
		for(j=(i+1); j<=h; ++j){
			for(p=0; p<w; ++p){
				for(q=(p+1); q<=w; ++q){
					if(d[0][j][q] - d[0][j][p] - d[0][i][q] + d[0][i][p] == d[1][j][q] - d[1][j][p] - d[1][i][q] + d[1][i][p]){
						ans = max(ans,(j-i)*(q-p));
					}
				}
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task B - チョコレート
User ransewhale
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1115 Byte
Status AC
Exec Time 67 ms
Memory 384 KB

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 1 ms 384 KB
subtask0_sample-02.txt AC 1 ms 384 KB
subtask0_sample-03.txt AC 1 ms 384 KB
subtask0_sample-04.txt AC 1 ms 384 KB
subtask0_sample-05.txt AC 1 ms 384 KB
subtask1_01.txt AC 1 ms 384 KB
subtask1_02.txt AC 1 ms 384 KB
subtask1_03.txt AC 1 ms 384 KB
subtask1_04.txt AC 1 ms 384 KB
subtask1_05.txt AC 1 ms 384 KB
subtask1_06.txt AC 2 ms 384 KB
subtask1_07.txt AC 1 ms 384 KB
subtask1_08.txt AC 1 ms 384 KB
subtask1_09.txt AC 65 ms 384 KB
subtask1_10.txt AC 11 ms 384 KB
subtask1_11.txt AC 54 ms 384 KB
subtask1_12.txt AC 54 ms 384 KB
subtask1_13.txt AC 54 ms 384 KB
subtask1_14.txt AC 66 ms 384 KB
subtask1_15.txt AC 67 ms 384 KB
subtask1_16.txt AC 51 ms 384 KB
subtask1_17.txt AC 52 ms 384 KB
subtask1_18.txt AC 1 ms 384 KB
subtask1_19.txt AC 1 ms 384 KB
subtask1_20.txt AC 63 ms 384 KB