제출 #833197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833197		vjudge1	Bomb (IZhO17_bomb)	C++17	24 / 100	307 ms	49408 KiB

bomb

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

int n, m;
const int maxn = 2504;
int chainw[maxn][maxn];
int chainh[maxn][maxn];

int getParentW(int i, int j) {
    if (chainw[i][j+1] != 0) return getParentW(i, j+1);
    return j;
}

int getParentH(int i, int j) {
    if (chainh[i+1][j] != 0) return getParentH(i+1, j);
    return i;
}

int main() {
    cin >> n >> m;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            char x;
            cin >> x;
            if (x == '1') {
                chainw[i][j] = chainw[i][j-1]+1;
                chainh[i][j] = chainh[i-1][j]+1;
            }
        }
    }

    int maxpossiblew = maxn;
    int maxpossibleh = maxn;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            j = getParentW(i, j);
            if (chainw[i][j] == 0) continue;
            maxpossiblew = min(maxpossiblew, chainw[i][j]);
        }
        // if (maxw[i] == 0) continue;
        // maxpossiblew = min(maxpossiblew, chainw[i][maxw[i]]);
    }

    for (int j = 1; j <= m; j++) {
        for (int i = 1; i <= n; i++) {
            i = getParentH(i, j);
            if (chainh[i][j] == 0) continue;
            maxpossibleh = min(maxpossibleh, chainh[i][j]);
        }
        // if (maxw[i] == 0) continue;
        // maxpossiblew = min(maxpossiblew, chainw[i][maxw[i]]);
    }

    cout << maxpossibleh * maxpossiblew << endl;

    return 0;
}

• Subtask 1: 24 / 100