Submission #1589369
Source Code Expand
#include <iostream> using namespace std; int f[101][101]; int main() { int r, c, a; cin >> r >> c; for(int y=1; y<=r; y++) for(int x=1; x<=c; x++) { cin >> a; if((x+y)&1) { f[y][x] = -a + f[y][x-1] + f[y-1][x] - f[y-1][x-1]; } else { f[y][x] = a + f[y][x-1] + f[y-1][x] - f[y-1][x-1]; } } int res = 0; for(int s=1; s<=r; s++) for(int n=0; n<s; n++) for(int e=1; e<=c; e++) for(int w=0; w<e; w++) { if (f[s][e]-f[n][e]+f[n][w]-f[s][w]==0) res = max(res, (s-n)*(e-w)); } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | refle |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 579 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 256 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 | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 40 ms | 256 KB |
subtask1_10.txt | AC | 7 ms | 256 KB |
subtask1_11.txt | AC | 29 ms | 256 KB |
subtask1_12.txt | AC | 29 ms | 256 KB |
subtask1_13.txt | AC | 29 ms | 256 KB |
subtask1_14.txt | AC | 40 ms | 256 KB |
subtask1_15.txt | AC | 41 ms | 256 KB |
subtask1_16.txt | AC | 28 ms | 256 KB |
subtask1_17.txt | AC | 32 ms | 256 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 256 KB |
subtask1_20.txt | AC | 35 ms | 256 KB |