Submission #4067475


Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define INF INT_MAX
#define eps LDBL_EPSILON
#define moder 100000
#define pie 3.141592653589793238462643383279
#define P std::pair<int,int>
#define prique priority_queue
using namespace std;
int h,w,c[110][110],d[110][110];
signed main(){
	cin>>h>>w;
	rep(i,h){
		rep(j,w){
			if((i+j)%2==0)cin>>c[i][j];
			else cin>>d[i][j];
		}
	}
	rep(i,h){
		for(int j=1;j<w;j++){
			c[i][j]+=c[i][j-1];
			d[i][j]+=d[i][j-1];
		}
	}
	for(int i=1;i<h;i++){
		rep(j,w){
			c[i][j]+=c[i-1][j];
			d[i][j]+=d[i-1][j];
		}
	}
	int ans=0;
	rep(i,h){
		rep(j,w){
			rep(k,h){
				rep(l,w){
					int cnt1=0,cnt2=0;
					cnt1+=c[k][l];
					cnt2+=d[k][l];
					if(j){
						cnt1-=c[k][j-1];
						cnt2-=d[k][j-1];
					}
					if(i){
						cnt1-=c[i-1][l];
						cnt2-=d[i-1][l];
					}
					if(i&&j){
						cnt1+=c[i-1][j-1];
						cnt2+=d[i-1][j-1];
					}
					if(cnt1==cnt2){
						ans=max(ans,(k-i+1)*(l-j+1));
					}
				}
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - チョコレート
User kaage
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1117 Byte
Status AC
Exec Time 303 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 256 KB
subtask0_sample-02.txt AC 1 ms 256 KB
subtask0_sample-03.txt AC 1 ms 256 KB
subtask0_sample-04.txt AC 1 ms 256 KB
subtask0_sample-05.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 2 ms 256 KB
subtask1_06.txt AC 3 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 295 ms 384 KB
subtask1_10.txt AC 41 ms 384 KB
subtask1_11.txt AC 252 ms 384 KB
subtask1_12.txt AC 252 ms 384 KB
subtask1_13.txt AC 252 ms 384 KB
subtask1_14.txt AC 299 ms 384 KB
subtask1_15.txt AC 303 ms 384 KB
subtask1_16.txt AC 243 ms 384 KB
subtask1_17.txt AC 236 ms 384 KB
subtask1_18.txt AC 1 ms 256 KB
subtask1_19.txt AC 2 ms 384 KB
subtask1_20.txt AC 277 ms 384 KB