제출 #1257931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1257931		proofy	Bomb (IZhO17_bomb)	C++20	12 / 100	41 ms	4676 KiB

bomb

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

const int N = 453;
int L[N][N], R[N][N], U[N][N], D[N][N], J[N], a[N][N], T[N], p;

int Q[N], l, r;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            char c;
            cin >> c;
            a[i][j] = c - '0';
        }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) 
            L[i][j] = (a[i][j] ? L[i][j - 1] + 1 : 0);
        for (int j = m; j >= 1; --j)
            R[i][j] = (a[i][j] ? R[i][j + 1] + 1 : 0);
    }

    int X = 1e9;
    for (int j = 1; j <= m; j++) {
        for (int i = 1; i <= n; i++)
            U[i][j] = (a[i][j] ? U[i - 1][j] + 1 : 0);
        for (int i = n; i >= 1; --i)
            D[i][j] = (a[i][j] ? D[i + 1][j] + 1 : 0);
        
        for (int i = 1; i <= n; i++) if (a[i][j])
            X = min(X, U[i][j] + D[i][j] - 1);
    }

    int Y = 1e9;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) if (a[i][j])
            Y = min(Y, L[i][j] + R[i][j] - 1);

    cout << X * Y << "\n";
}

• Subtask 1: 12 / 100