Submission #183614

---

Source Code Expand

#define _CRT_SEURE_NO_WARNINGS

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define loop(i,a,b) for(ull i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)
#define iter(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define riter(i,c) for(auto i=(c).rbegin(); i!=(c).rend(); ++i)
#define clr(a,i) memset((a), (i) ,sizeof(a))
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;

template<typename T>ostream&operator<<(ostream&os, vector<T>const&v){
    iter(it, v) os << *it << (it + 1 == v.end() ? "" : " ");
    return os;
}
template<typename T>ostream&operator<<(ostream&os, set<T>const&v){
    iter(it, v) os << *it << (it + 1 == v.end() ? "" : " ");
    return os;
}
template<typename T, typename U>ostream&operator<<(ostream&os, map<T, U>const&v){
    iter(it, v) os << *it << (it + 1 == v.end() ? "" : " ");
    return os;
}
template<typename T, typename U>ostream&operator<<(ostream&os, const pair<T, U>&p){
    return os << "[" << p.dirst << "," << p.second << "]";
}

int main(){
    int h, w;
    while (cin >> h >> w){
        vvi v(h, vi(w));
        rep(i, h)rep(j, w) cin >> v[i][j];

        int ans = 0;
        rep(x1, w + 1)rep(x2, x1)rep(y1, h + 1)rep(y2, y1){
            int b = 0;
            int w = 0;
            int sum = 0;
            loop(i, x2, x1)loop(j, y2, y1){
                // cout << i << " " << j << endl;
                if ((i + j) & 1) w += v[j][i];
                else b += v[j][i];
            }
            if (w != b) continue;
            ans = max<ull>((x1 - x2)*(y1 - y2), ans);
        }
        cout << ans << endl;
    }
}

Submission Info

Judge Result