Submission #183501
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(false); int h, w; cin >> h >> w; vector< vector<int> > input(h, vector<int>(w)); for(int i = 0; i < h; ++i){ for(int j = 0; j < w; ++j){ cin >> input[i][j]; if((i + j) & 1){ input[i][j] *= -1; } } } vector< vector<int> > integral(h + 1, vector<int>(w + 1)); for(int i = 0; i < h; ++i){ int sum = 0; for(int j = 0; j < w; ++j){ sum += input[i][j]; integral[i + 1][j + 1] = integral[i][j + 1] + sum; } } int answer = 0; for(int y0 = 0; y0 < h; ++y0){ for(int x0 = 0; x0 < w; ++x0){ for(int y1 = y0 + 1; y1 <= h; ++y1){ for(int x1 = x0 + 1; x1 <= w; ++x1){ const int sum = integral[y1][x1] + integral[y0][x0] - integral[y1][x0] - integral[y0][x1]; if(sum == 0){ answer = max(answer, (y1 - y0) * (x1 - x0)); } } } } } cout << answer << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | logicmachine |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1035 Byte |
Status | AC |
Exec Time | 91 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 | 804 KB |
subtask0_sample-02.txt | AC | 21 ms | 920 KB |
subtask0_sample-03.txt | AC | 22 ms | 924 KB |
subtask0_sample-04.txt | AC | 20 ms | 840 KB |
subtask0_sample-05.txt | AC | 21 ms | 932 KB |
subtask1_01.txt | AC | 21 ms | 928 KB |
subtask1_02.txt | AC | 21 ms | 792 KB |
subtask1_03.txt | AC | 20 ms | 928 KB |
subtask1_04.txt | AC | 22 ms | 732 KB |
subtask1_05.txt | AC | 20 ms | 924 KB |
subtask1_06.txt | AC | 22 ms | 916 KB |
subtask1_07.txt | AC | 21 ms | 800 KB |
subtask1_08.txt | AC | 21 ms | 796 KB |
subtask1_09.txt | AC | 86 ms | 856 KB |
subtask1_10.txt | AC | 31 ms | 924 KB |
subtask1_11.txt | AC | 63 ms | 932 KB |
subtask1_12.txt | AC | 63 ms | 800 KB |
subtask1_13.txt | AC | 64 ms | 928 KB |
subtask1_14.txt | AC | 87 ms | 804 KB |
subtask1_15.txt | AC | 91 ms | 928 KB |
subtask1_16.txt | AC | 61 ms | 928 KB |
subtask1_17.txt | AC | 73 ms | 928 KB |
subtask1_18.txt | AC | 21 ms | 800 KB |
subtask1_19.txt | AC | 21 ms | 800 KB |
subtask1_20.txt | AC | 75 ms | 928 KB |