Submission #1680170


Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int main() {
    int h, w;
    int c[110][110];
    cin >> h >> w;
    imfor(i, h) {
        imfor(j, w) {
            cin >> c[i][j];
            if ((i + j) % 2 == 0) {
                c[i][j] *= -1;
            }
        }
    }
    int ans = 0;
    for (int i = 0; i <= h - 1; i++) {
        for (int j = 0; j <= w - 1; j++) {
            for (int k = 0; k <= h - 1; k++) {
                for (int l = 0; l <= w - 1; l++) {
                    if (i > k || j > l) {
                        continue;
                    }
                    int tmp = 0;
                    for (int a = i; a <= k; a++) {
                        for (int b = j; b <= l; b++) {
                            tmp += c[a][b];
                        }
                    }
                    if (tmp == 0) {
                        ans = max(ans, (k - i + 1) * (l - j + 1));
                    }
                }
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - チョコレート
User imaizumi14
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1417 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 5
AC × 16
TLE × 9
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 11 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 1515 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 2 ms 256 KB
subtask1_20.txt TLE 2103 ms 256 KB