Submission #4026387


Source Code Expand

#include <bits/stdc++.h>

#define rep(i,m,n) for(int i = (m); i < (n); i++)
#define rrep(i,m,n) for(int i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]); if(i!=n-1) cout << " ";} cout << endl;
#define printp(x,n) for(int i = 0; i < n; i++){ cout << "(" << x[i].first << ", " << x[i].second << ") "; } cout << endl;
#define INF (1e18)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
typedef pair<ll, ll> lpair;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll H,W;
    ll C[110][110];
    cin >> H >> W;
    rep(i,0,H){
        rep(j,0,W){
            cin >> C[i][j];
        }
    }
    ll sum[110][110] = {};
    rep(i,0,H){
        rep(j,0,W){
            if((i+j) % 2 == 0){
                sum[i+1][j+1] = C[i][j];
            }else{
                sum[i+1][j+1] = -C[i][j];
            }
        }
    }
    rep(i,0,H+1){
        rep(j,0,W+1){
            sum[i][j+1] += sum[i][j];
        }
    }
    rep(j,0,W+1){
        rep(i,0,H+1){
            sum[i+1][j] += sum[i][j];
        }
    }
    ll ans = 0;
    // rep(i,0,H+2){
    //     rep(j,0,W+2){
    //         cout << sum[i][j] << " ";
    //     }
    //     cout << endl;
    // }
    rep(i,0,H){
        rep(j,0,W){
            rep(k,0,H){
                rep(l,0,W){
                    if(i < k || j < l) continue;
                    ll val = sum[i+1][j+1] + sum[k][l] - sum[i+1][l] - sum[k][j+1];
                    ll tt = (i-k+1) * (j-l+1);
                    if(val == 0){
                        ans = max(ans, tt);
                    }
                }
            }
        }
    }
    print(ans);
}

Submission Info

Submission Time
Task B - チョコレート
User yuji9511
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1820 Byte
Status AC
Exec Time 122 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 25
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 384 KB
subtask0_sample-02.txt AC 1 ms 384 KB
subtask0_sample-03.txt AC 1 ms 384 KB
subtask0_sample-04.txt AC 1 ms 384 KB
subtask0_sample-05.txt AC 1 ms 384 KB
subtask1_01.txt AC 1 ms 384 KB
subtask1_02.txt AC 1 ms 384 KB
subtask1_03.txt AC 1 ms 384 KB
subtask1_04.txt AC 1 ms 384 KB
subtask1_05.txt AC 2 ms 384 KB
subtask1_06.txt AC 2 ms 384 KB
subtask1_07.txt AC 1 ms 384 KB
subtask1_08.txt AC 1 ms 384 KB
subtask1_09.txt AC 120 ms 384 KB
subtask1_10.txt AC 19 ms 384 KB
subtask1_11.txt AC 109 ms 512 KB
subtask1_12.txt AC 109 ms 384 KB
subtask1_13.txt AC 109 ms 384 KB
subtask1_14.txt AC 121 ms 512 KB
subtask1_15.txt AC 122 ms 512 KB
subtask1_16.txt AC 105 ms 512 KB
subtask1_17.txt AC 97 ms 384 KB
subtask1_18.txt AC 1 ms 384 KB
subtask1_19.txt AC 1 ms 384 KB
subtask1_20.txt AC 117 ms 512 KB