Submission #185402
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int,int> P;
typedef std::pair<int,P> State;
const int INF = 1001001001;
// S N E W(南北東西)
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int main(){
int H, W;
std::cin >> H >> W;
int white[101][101], black[101][101];
std::fill(white[0], white[0]+101*101, 0);
std::fill(black[0], black[0]+101*101, 0);
FOR(y, 1, H+1){
FOR(x, 1, W+1){
if((x + y) % 2 == 0){
std::cin >> black[y][x];
}else{
std::cin >> white[y][x];
}
}
}
FOR(y, 1, H+1){
FOR(x, 2, W+1){
white[y][x] += white[y][x-1];
black[y][x] += black[y][x-1];
}
}
FOR(x, 1, W+1){
FOR(y, 2, H+1){
white[y][x] += white[y-1][x];
black[y][x] += black[y-1][x];
}
}
int res = 0;
FOR(y1, 1, H+1){
FOR(x1, 1, W+1){
FOR(y2, y1, H+1){
FOR(x2, x1, W+1){
int b = black[y2][x2] - black[y1-1][x2] - black[y2][x1-1] + black[y1-1][x1-1],
w = white[y2][x2] - white[y1-1][x2] - white[y2][x1-1] + white[y1-1][x1-1];
if(b == w){res = std::max(res, (y2-y1+1) * (x2-x1+1));}
}
}
}
}
std::cout << res << std::endl;
}
Submission Info
Submission Time |
|
Task |
B - チョコレート |
User |
iwashisnake |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1760 Byte |
Status |
AC |
Exec Time |
132 ms |
Memory |
932 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
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 |
21 ms |
920 KB |
subtask0_sample-02.txt |
AC |
21 ms |
800 KB |
subtask0_sample-03.txt |
AC |
20 ms |
928 KB |
subtask0_sample-04.txt |
AC |
21 ms |
932 KB |
subtask0_sample-05.txt |
AC |
21 ms |
788 KB |
subtask1_01.txt |
AC |
20 ms |
920 KB |
subtask1_02.txt |
AC |
22 ms |
928 KB |
subtask1_03.txt |
AC |
21 ms |
932 KB |
subtask1_04.txt |
AC |
21 ms |
928 KB |
subtask1_05.txt |
AC |
21 ms |
788 KB |
subtask1_06.txt |
AC |
22 ms |
808 KB |
subtask1_07.txt |
AC |
21 ms |
808 KB |
subtask1_08.txt |
AC |
21 ms |
928 KB |
subtask1_09.txt |
AC |
128 ms |
928 KB |
subtask1_10.txt |
AC |
36 ms |
800 KB |
subtask1_11.txt |
AC |
107 ms |
804 KB |
subtask1_12.txt |
AC |
107 ms |
796 KB |
subtask1_13.txt |
AC |
107 ms |
856 KB |
subtask1_14.txt |
AC |
129 ms |
932 KB |
subtask1_15.txt |
AC |
132 ms |
920 KB |
subtask1_16.txt |
AC |
103 ms |
804 KB |
subtask1_17.txt |
AC |
107 ms |
928 KB |
subtask1_18.txt |
AC |
21 ms |
804 KB |
subtask1_19.txt |
AC |
21 ms |
928 KB |
subtask1_20.txt |
AC |
119 ms |
804 KB |