제출 #1130955

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1130955		RockyB	Bomb (IZhO17_bomb)	C++20	76 / 100	191 ms	31044 KiB

bomb

#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;

typedef long long ll;
                    
short up[2502][2502];

short dw[2502][2502];

char s[2502][2502];

int f[2502];

int n, m, ans;

void solve() {
    scanf("%d %d", &n, &m);

    for (int i = 0; i < n; ++i) {
        scanf("%s", s[i]);
    }

    int limh = n, limw = m;


    for (int j = 0; j < m; ++j) {
        int cur = 0;

        for (int i = 0; i < n; ++i) {
            if (s[i][j] == '1') {
                up[i][j] = ++cur;
            }
            else {
                cur = 0;
            }
        }
    }

    for (int j = 0; j < m; ++j) {
        int cur = 0;

        for (int i = n - 1; i >= 0; --i) {
            if (s[i][j] == '1') {
                dw[i][j] = ++cur;
            }
            else {
                cur = 0;
            }
        }
    }

    for (int i = 1; i <= limw; ++i) {
        f[i] = limh;
    }

    for (int i = 0; i < n; ++i) {
        int cur = 0;
        short l = 10000, r = 10000;

        for (int j = 0; j < m; ++j) {
            if (s[i][j] == '1') {
                ++cur;

                l = min(l, up[i][j]);
                r = min(r, dw[i][j]);

                f[cur] = min(f[cur], l + r - 1);
            }
            else {
              f[cur] = 0;
                cur = 0;
                l = r = 10000;
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        int cur = 0;
        short l = 10000, r = 10000;

        for (int j = m - 1; j >= 0; --j) {
            if (s[i][j] == '1') {
                ++cur;

                l = min(l, up[i][j]);
                r = min(r, dw[i][j]);

                f[cur] = min(f[cur], l + r - 1);
            }
            else {
                f[cur] = 0;
                cur = 0;
                l = r = 10000;
            }
        }
    }

    ans = f[1];                    

    for (int i = 2; i <= limw; ++i) {
        f[i] = min(f[i], f[i - 1]);
        ans = max(ans, i * f[i]);
    }

    printf("%d\n", ans);
}

int main() {
    //freopen("bomb.in", "r", stdin);
    //freopen("bomb.out", "w", stdout);
          
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bomb.cpp: In function 'void solve()':
bomb.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
bomb.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         scanf("%s", s[i]);
      |         ~~~~~^~~~~~~~~~~~

• Subtask 1: 76 / 100