Submission #1990205


Source Code Expand

#include"bits/stdc++.h"
using namespace std;

int main() {
    int H, W;
    cin >> H >> W;
    vector<vector<int>> C(H, vector<int>(W));
    for (int h = 0; h < H; h++) {
        for (int w = 0; w < W; w++) {
            cin >> C[h][w];
            if ((h + w) % 2 == 1) {
                C[h][w] *= -1;
            }
        }
    }

    vector<vector<int>> sum(H + 1, vector<int>(W + 1, 0));
    for (int h = 1; h < H; h++) {
        for (int w = 1; w < W; w++) {
            sum[h][w] += sum[h - 1][w] + sum[h][w - 1] - sum[h - 1][w - 1];
        }
    }

    int ans = 0;
    for (int left = 0; left < W; left++) {
        for (int right = left + 1; right < W; right++) {
            for (int up = 0; up < H; up++) {
                for (int down = up + 1; down < H; down++) {
                    if (sum[down][right] - sum[up][right] - sum[down][left] + sum[up][left] == 0) {
                        ans = max(ans, (down - up) * (right - left));
                    }
                }
            }
        }
    }

    cout << ans << endl;
}

Submission Info

Submission Time
Task B - チョコレート
User tokumini
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1086 Byte
Status WA
Exec Time 37 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
WA × 4
AC × 1
WA × 24
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 WA 1 ms 256 KB
subtask0_sample-03.txt WA 1 ms 256 KB
subtask0_sample-04.txt WA 1 ms 256 KB
subtask0_sample-05.txt WA 1 ms 256 KB
subtask1_01.txt WA 1 ms 256 KB
subtask1_02.txt WA 1 ms 256 KB
subtask1_03.txt WA 1 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt WA 1 ms 256 KB
subtask1_06.txt WA 1 ms 256 KB
subtask1_07.txt WA 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt WA 37 ms 384 KB
subtask1_10.txt WA 6 ms 256 KB
subtask1_11.txt WA 37 ms 384 KB
subtask1_12.txt WA 37 ms 384 KB
subtask1_13.txt WA 37 ms 384 KB
subtask1_14.txt WA 37 ms 384 KB
subtask1_15.txt WA 37 ms 384 KB
subtask1_16.txt WA 35 ms 384 KB
subtask1_17.txt WA 30 ms 384 KB
subtask1_18.txt WA 1 ms 256 KB
subtask1_19.txt WA 1 ms 256 KB
subtask1_20.txt WA 36 ms 384 KB