Submission #185440
Source Code Expand
#include <cstdio> #include <algorithm> using namespace std; int sum[101][101]; int main() { int h, w, ans = 0, i, j, k, l; scanf("%d %d", &h, &w); for (i = 0; i < h; i++) { for (j = 0; j < w; j++) { int x; scanf("%d", &x); if ((i + j) % 2 == 0) { sum[i + 1][j + 1] += x; } else { sum[i + 1][j + 1] -= x; } sum[i + 1][j + 1] += sum[i + 1][j] + sum[i][j + 1] - sum[i][j]; } } for (i = 0; i < h; i++) { for (j = 0; j < w; j++) { for (k = i; k < h; k++) { for (l = j; l < w; l++) { if (sum[k + 1][l + 1] - sum[k + 1][j] - sum[i][l + 1] + sum[i][j] == 0) ans = max(ans, (k - i + 1) * (l - j + 1)); } } } } printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | kawatea |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 988 Byte |
Status | AC |
Exec Time | 102 ms |
Memory | 796 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ./Main.cpp:18:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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 | 792 KB |
subtask0_sample-02.txt | AC | 22 ms | 772 KB |
subtask0_sample-03.txt | AC | 19 ms | 792 KB |
subtask0_sample-04.txt | AC | 22 ms | 672 KB |
subtask0_sample-05.txt | AC | 21 ms | 784 KB |
subtask1_01.txt | AC | 21 ms | 796 KB |
subtask1_02.txt | AC | 19 ms | 784 KB |
subtask1_03.txt | AC | 20 ms | 796 KB |
subtask1_04.txt | AC | 21 ms | 792 KB |
subtask1_05.txt | AC | 21 ms | 788 KB |
subtask1_06.txt | AC | 21 ms | 792 KB |
subtask1_07.txt | AC | 19 ms | 792 KB |
subtask1_08.txt | AC | 19 ms | 788 KB |
subtask1_09.txt | AC | 97 ms | 708 KB |
subtask1_10.txt | AC | 32 ms | 796 KB |
subtask1_11.txt | AC | 80 ms | 792 KB |
subtask1_12.txt | AC | 81 ms | 796 KB |
subtask1_13.txt | AC | 82 ms | 792 KB |
subtask1_14.txt | AC | 99 ms | 788 KB |
subtask1_15.txt | AC | 102 ms | 796 KB |
subtask1_16.txt | AC | 77 ms | 792 KB |
subtask1_17.txt | AC | 80 ms | 792 KB |
subtask1_18.txt | AC | 19 ms | 784 KB |
subtask1_19.txt | AC | 19 ms | 796 KB |
subtask1_20.txt | AC | 89 ms | 792 KB |