Submission #1839902
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define FOR(i,a,b) for(int (i)=(a);i<(int)(b);i++) #define rep(i,n) FOR(i,0,n) int sw[111][111], sb[111][111]; int a[100][100]; int h, w; int main() { cin >> h >> w; rep(y, h) rep(x, w) { cin >> a[y][x]; if ((x + y) & 1) sw[y][x] = a[y][x]; else sb[y][x] = a[y][x]; } rep(y, h) rep(x, w - 1) { sw[y][x + 1] += sw[y][x]; sb[y][x + 1] += sb[y][x]; } rep(x, w) rep(y, h - 1) { sw[y + 1][x] += sw[y][x]; sb[y + 1][x] += sb[y][x]; } int ans = 0; rep(y, h) rep(x, w) { FOR(i, y, h) FOR(j, x, w) { int black = sb[i][j], white = sw[i][j]; if (x != 0) { black -= sb[i][x - 1]; white -= sw[i][x - 1]; } if (y != 0) { black -= sb[y - 1][j]; white -= sw[y - 1][j]; } if (y != 0 && x != 0) { black += sb[y - 1][x - 1]; white += sw[y - 1][x - 1]; } if (black == white) ans = max(ans, (i - y + 1) * (j - x + 1)); } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | fushime2 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1287 Byte |
Status | AC |
Exec Time | 79 ms |
Memory | 384 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 | 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 | 1 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 77 ms | 384 KB |
subtask1_10.txt | AC | 12 ms | 384 KB |
subtask1_11.txt | AC | 66 ms | 384 KB |
subtask1_12.txt | AC | 66 ms | 384 KB |
subtask1_13.txt | AC | 66 ms | 384 KB |
subtask1_14.txt | AC | 78 ms | 384 KB |
subtask1_15.txt | AC | 79 ms | 384 KB |
subtask1_16.txt | AC | 63 ms | 384 KB |
subtask1_17.txt | AC | 62 ms | 384 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 384 KB |
subtask1_20.txt | AC | 72 ms | 384 KB |