oj.uz

Submission #883719

# Submission time Handle Problem Language Result Execution time Memory
883719 2023-12-05T19:41:27 Z Sokol080808 Bomb (IZhO17_bomb) C++17
100 / 100
 123 ms 55804 KB 
#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif

#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#include <malloc.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& p) {in >> p.first >> p.second; return in;}
template<typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2>& p) {out << p.first << ' ' << p.second; return out;}
template<typename T> istream& operator>>(istream& in, vector<T>& v) {for (auto& x : v) in >> x; return in;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& v) {for (auto& x : v) out << x << ' '; return out;}
template<typename T> ostream& operator<<(ostream& out, set<T>& v) {for (auto& x : v) out << x << ' '; return out;}
template<typename T> ostream& operator<<(ostream& out, multiset<T>& v) {for (auto& x : v) out << x << ' '; return out;}

const int MAX_INT = 2147483647;
const double pi = acos(-1.0);
const int mod = 1e9 + 7;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector<vector<char>> f(n, vector<char>(m));
    for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> f[i][j];


    vector<vector<int>> up(n, vector<int>(m)), down(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (f[i][j] == '0') {
                up[i][j] = i;
            } else {
                up[i][j] = (i - 1 >= 0 ? up[i - 1][j] : i - 1);
            }
        }
    }
    for (int i = n - 1; i >= 0; i--) {
        for (int j = 0; j < m; j++) {
            if (f[i][j] == '0') {
                down[i][j] = i;
            } else {
                down[i][j] = (i + 1 < n ? down[i + 1][j] : i + 1);
            }
        }
    }

    int mx_y = 1e9;
    for (int j = 0; j < m; j++) {
        for (int i = 0; i < n; i++) {
            int mn = 1e9;
            if (f[i][j] == '0') continue;

            int r = i;
            while (r + 1 < n && f[r + 1][j] == '1') r++;

            mn = min(mn, r - i + 1);

            i = r;
            mx_y = min(mx_y, mn);
        }
    }

    vector<ll> best(m + 1, mx_y);
    int mx_x = 1e9;
    for (int i = 0; i < n; i++) {
        int mn = 1e9;
        for (int j = 0; j < m; j++) {
            if (f[i][j] == '0') continue;

            int r = j;
            while (r + 1 < m && f[i][r + 1] == '1') r++;

            mn = min(mn, r - j + 1);

            int u = -1;
            int d = n;
            for (int id = j, len = 1; id <= r; id++, len++) {
                u = max(u, up[i][id]);
                d = min(d, down[i][id]);
                best[len] = min<ll>(best[len], d - u - 1);
            }

            u = -1;
            d = n;
            for (int id = r, len = 1; id >= j; id--, len++) {
                u = max(u, up[i][id]);
                d = min(d, down[i][id]);
                best[len] = min<ll>(best[len], d - u - 1);
            }

            j = r;
        }
        mx_x = min(mx_x, mn);
    }

    ll ans = 0;
    for (int i = 1; i <= mx_x; i++) ans = max(ans, i * best[i]);
    cout << ans << '\n';

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 388 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 2 ms 1372 KB Output is correct
29 Correct 2 ms 1372 KB Output is correct
30 Correct 4 ms 2140 KB Output is correct
31 Correct 3 ms 1628 KB Output is correct
32 Correct 3 ms 1884 KB Output is correct
33 Correct 3 ms 2140 KB Output is correct
34 Correct 2 ms 1116 KB Output is correct
35 Correct 3 ms 2108 KB Output is correct
36 Correct 4 ms 2140 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 113 ms 55792 KB Output is correct
39 Correct 0 ms 600 KB Output is correct
40 Correct 13 ms 7256 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 109 ms 55788 KB Output is correct
44 Correct 4 ms 2140 KB Output is correct
45 Correct 107 ms 55552 KB Output is correct
46 Correct 108 ms 55776 KB Output is correct
47 Correct 112 ms 55632 KB Output is correct
48 Correct 103 ms 55788 KB Output is correct
49 Correct 105 ms 55792 KB Output is correct
50 Correct 105 ms 55552 KB Output is correct
51 Correct 109 ms 55616 KB Output is correct
52 Correct 104 ms 55792 KB Output is correct
53 Correct 103 ms 55636 KB Output is correct
54 Correct 121 ms 55632 KB Output is correct
55 Correct 104 ms 55804 KB Output is correct
56 Correct 108 ms 55772 KB Output is correct
57 Correct 101 ms 55636 KB Output is correct
58 Correct 104 ms 55792 KB Output is correct
59 Correct 104 ms 55788 KB Output is correct
60 Correct 105 ms 55636 KB Output is correct
61 Correct 105 ms 55548 KB Output is correct
62 Correct 109 ms 55796 KB Output is correct
63 Correct 105 ms 55644 KB Output is correct
64 Correct 101 ms 55632 KB Output is correct
65 Correct 108 ms 55636 KB Output is correct
66 Correct 104 ms 55636 KB Output is correct
67 Correct 104 ms 55548 KB Output is correct
68 Correct 114 ms 55792 KB Output is correct
69 Correct 102 ms 55552 KB Output is correct
70 Correct 64 ms 35916 KB Output is correct
71 Correct 100 ms 55772 KB Output is correct
72 Correct 101 ms 55552 KB Output is correct
73 Correct 118 ms 55800 KB Output is correct
74 Correct 102 ms 55632 KB Output is correct
75 Correct 101 ms 55716 KB Output is correct
76 Correct 101 ms 55552 KB Output is correct
77 Correct 104 ms 55768 KB Output is correct
78 Correct 101 ms 55552 KB Output is correct
79 Correct 102 ms 55548 KB Output is correct
80 Correct 99 ms 55624 KB Output is correct
81 Correct 110 ms 55552 KB Output is correct
82 Correct 109 ms 55604 KB Output is correct
83 Correct 105 ms 55552 KB Output is correct
84 Correct 99 ms 55632 KB Output is correct
85 Correct 111 ms 55804 KB Output is correct
86 Correct 105 ms 55632 KB Output is correct
87 Correct 113 ms 55636 KB Output is correct
88 Correct 102 ms 55548 KB Output is correct
89 Correct 104 ms 55552 KB Output is correct
90 Correct 65 ms 35680 KB Output is correct
91 Correct 102 ms 55788 KB Output is correct
92 Correct 102 ms 55588 KB Output is correct
93 Correct 105 ms 55640 KB Output is correct
94 Correct 108 ms 55684 KB Output is correct
95 Correct 104 ms 55792 KB Output is correct
96 Correct 101 ms 55796 KB Output is correct
97 Correct 105 ms 55552 KB Output is correct
98 Correct 101 ms 55636 KB Output is correct
99 Correct 107 ms 55632 KB Output is correct
100 Correct 123 ms 55632 KB Output is correct