Submission #1839668
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 a[100][100]; int h, w; int main() { cin >> h >> w; rep(y, h) rep(x, w) cin >> a[y][x]; int ans = 0; rep(y, h) rep(x, w) { FOR(i, y, h) FOR(j, x, w) { int cw = 0, cb = 0; FOR(sy, y, i + 1) FOR(sx, x, j + 1) { if ((sx + sy) & 1) cw += a[sy][sx]; else cb += a[sy][sx]; } //cout << cw << " " << cb << endl; if (cw == cb) 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 | 0 |
Code Size | 698 Byte |
Status | TLE |
Exec Time | 2107 ms |
Memory | 256 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 | 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 | 3 ms | 256 KB |
subtask1_06.txt | AC | 12 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 2 ms | 256 KB |
subtask1_09.txt | TLE | 2103 ms | 256 KB |
subtask1_10.txt | AC | 1777 ms | 256 KB |
subtask1_11.txt | TLE | 2103 ms | 256 KB |
subtask1_12.txt | TLE | 2103 ms | 256 KB |
subtask1_13.txt | TLE | 2103 ms | 256 KB |
subtask1_14.txt | TLE | 2103 ms | 256 KB |
subtask1_15.txt | TLE | 2103 ms | 256 KB |
subtask1_16.txt | TLE | 2103 ms | 256 KB |
subtask1_17.txt | TLE | 2103 ms | 256 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 3 ms | 256 KB |
subtask1_20.txt | TLE | 2107 ms | 256 KB |