Submission #3563440

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

ll solve(){
    ll res = 0;
    int H,W; cin >> H >> W;
    vector<vector<ll>> C1(H+1,vector<ll>(W+1));
    vector<vector<ll>> C2(H+1,vector<ll>(W+1));

    for(int i = 0; i < H;i++){
        for(int j = 0; j < W;j++){
            int C; cin >> C;
            if((i+j)&1) C1[i+1][j+1] = C;
            else C2[i+1][j+1] = C;
        }
    }
    
    for(int i = 1; i <= H;i++){
        for(int j = 1; j <= W;j++){
            C1[i][j] = C1[i][j] + C1[i-1][j] + C1[i][j-1] - C1[i-1][j-1];
            C2[i][j] = C2[i][j] + C2[i-1][j] + C2[i][j-1] - C2[i-1][j-1];
        }
    }
    
//    cout << "===" << endl;
//    cout << C1 << endl;
//    cout << "---" << endl;
//    cout << C2 << endl;
//    cout << "===" << endl;
    
    
    for(int i = 1; i <= H;i++){
        for(int j = 1; j <= W;j++){
            for(int ii = i; ii <= H; ii++){
                for(int jj = j; jj <= W; jj++){
                    ll sum1 = C1[ii][jj] - C1[i-1][jj] - C1[ii][j-1] + C1[i-1][j-1];
                    ll sum2 = C2[ii][jj] - C2[i-1][jj] - C2[ii][j-1] + C2[i-1][j-1];
                    if(sum1 == sum2){
                        res = max(res,(ll)(ii-i+1)*(jj-j+1));
                    }
                }
            }
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}

Submission Info

Judge Result