Submission #2821479
Source Code Expand
H, W = map(int, input().split()) C = [list(map(int, input().split())) for i in range(H)] R = [[0] * W for i in range(H)] for i in range(H): for j in range(W): if (i+j) % 2 == 0: R[i][j] = C[i][j] else: R[i][j] = -C[i][j] for i in range(1, H): R[i][0] += R[i-1][0] for j in range(1, W): R[0][j] += R[0][j-1] for i in range(1, H): for j in range(1, W): R[i][j] += R[i-1][j] + R[i][j-1] - R[i-1][j-1] for i in range(H): R[i].insert(0, 0) R.insert(0, [0] * (W+1)) ans = 0 for i in range(1, H+1): for j in range(1, W+1): for k in range(i, H+1): for l in range(j, W+1): if R[k][l] - R[k][j-1] - R[i-1][l] + R[i-1][j-1] == 0: ans = max(ans, (k-i+1)*(l-j+1)) print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | AT274 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 827 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 3440 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 17 ms | 3064 KB |
subtask0_sample-02.txt | AC | 17 ms | 3064 KB |
subtask0_sample-03.txt | AC | 17 ms | 3064 KB |
subtask0_sample-04.txt | AC | 17 ms | 3064 KB |
subtask0_sample-05.txt | AC | 17 ms | 3064 KB |
subtask1_01.txt | AC | 17 ms | 3064 KB |
subtask1_02.txt | AC | 17 ms | 3064 KB |
subtask1_03.txt | AC | 18 ms | 3064 KB |
subtask1_04.txt | AC | 18 ms | 3064 KB |
subtask1_05.txt | AC | 30 ms | 3064 KB |
subtask1_06.txt | AC | 72 ms | 3064 KB |
subtask1_07.txt | AC | 18 ms | 3064 KB |
subtask1_08.txt | AC | 25 ms | 3064 KB |
subtask1_09.txt | TLE | 2104 ms | 3440 KB |
subtask1_10.txt | AC | 1776 ms | 3188 KB |
subtask1_11.txt | TLE | 2104 ms | 3436 KB |
subtask1_12.txt | TLE | 2104 ms | 3436 KB |
subtask1_13.txt | TLE | 2104 ms | 3436 KB |
subtask1_14.txt | TLE | 2104 ms | 3316 KB |
subtask1_15.txt | TLE | 2104 ms | 3316 KB |
subtask1_16.txt | TLE | 2104 ms | 3436 KB |
subtask1_17.txt | TLE | 2104 ms | 3188 KB |
subtask1_18.txt | AC | 17 ms | 3064 KB |
subtask1_19.txt | AC | 28 ms | 3064 KB |
subtask1_20.txt | TLE | 2104 ms | 3316 KB |