Submission #706344

# Submission time Handle Problem Language Result Execution time Memory
706344 2023-03-06T09:48:32 Z KiriLL1ca Bomb (IZhO17_bomb) C++17
100 / 100
649 ms 56424 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define endl '\n'
#define sz(x) (int)((x).size())
#define vec vector
#define pw(x) (1ll << x)

using namespace std;
using namespace __gnu_pbds;

template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int inf = 1e9 + 17;

inline void solve () {
    int n, m; cin >> n >> m;
    vec <string> a (n);
    for (auto &i : a) cin >> i;

    vec <int> mx (m + 2, inf);

    for (int iter = 0; iter < 2; ++iter) {
        vec <vec <int>> p (n, vec <int> (m)), s (n, vec <int> (m));
        for (int j = 0; j < m; ++j) {
            p[0][j] = (a[0][j] == '1');
            for (int i = 1; i < n; ++i) {
                if (a[i][j] == '1') p[i][j] = p[i - 1][j] + 1;
            }

            s[n - 1][j] = (a[n - 1][j] == '1');
            for (int i = n - 2; ~i; --i) {
                if (a[i][j] == '1') s[i][j] = s[i + 1][j] + 1;
            }

            for (int i = 0; i < n; ++i) if (a[i][j] == '1') umin(mx[1], p[i][j] + s[i][j] - 1);
        }

        for (int i = 0; i < n; ++i) {
            for (int l = 0, r = 0; r < m; ) {
                while (r < m && a[i][r] == '1') ++r;
                if (l == r) {
                    ++l, ++r;
                    continue;
                }

                int mn_down = inf, mn_up = inf;
                for (int q = l; q < r; ++q) {
                    umin(mn_up, p[i][q]);
                    umin(mn_down, s[i][q]);
                    umin(mx[q - l + 1], mn_down + mn_up - 1);
                }
                umin(mx[r - l + 1], 0);

                l = r;
            }
        }

        for (auto &i : a) reverse(all(i));
    }

    int ans = 0;
    for (int i = 1; i <= m; ++i) {
        umin(mx[i], mx[i - 1]);
//        cout << mx[i] << " " << i << endl;
        umax(ans, mx[i] * i);
    }
    cout << ans << endl;
}

signed main () {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif// LOCAL
    int t = 1; //cin >> t;
    while (t--) solve();
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 3 ms 980 KB Output is correct
28 Correct 2 ms 1240 KB Output is correct
29 Correct 4 ms 1380 KB Output is correct
30 Correct 4 ms 2004 KB Output is correct
31 Correct 3 ms 1620 KB Output is correct
32 Correct 3 ms 1748 KB Output is correct
33 Correct 5 ms 2132 KB Output is correct
34 Correct 2 ms 1084 KB Output is correct
35 Correct 5 ms 2132 KB Output is correct
36 Correct 7 ms 2132 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 610 ms 56156 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 54 ms 7252 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 496 ms 56168 KB Output is correct
44 Correct 5 ms 2132 KB Output is correct
45 Correct 462 ms 56288 KB Output is correct
46 Correct 459 ms 56196 KB Output is correct
47 Correct 469 ms 56308 KB Output is correct
48 Correct 442 ms 56268 KB Output is correct
49 Correct 622 ms 56160 KB Output is correct
50 Correct 452 ms 56212 KB Output is correct
51 Correct 445 ms 56264 KB Output is correct
52 Correct 454 ms 56160 KB Output is correct
53 Correct 449 ms 56424 KB Output is correct
54 Correct 338 ms 56192 KB Output is correct
55 Correct 336 ms 56192 KB Output is correct
56 Correct 645 ms 56196 KB Output is correct
57 Correct 312 ms 56164 KB Output is correct
58 Correct 330 ms 56184 KB Output is correct
59 Correct 327 ms 56172 KB Output is correct
60 Correct 419 ms 56148 KB Output is correct
61 Correct 631 ms 56160 KB Output is correct
62 Correct 649 ms 56164 KB Output is correct
63 Correct 628 ms 56196 KB Output is correct
64 Correct 327 ms 56204 KB Output is correct
65 Correct 422 ms 56148 KB Output is correct
66 Correct 440 ms 56288 KB Output is correct
67 Correct 467 ms 56292 KB Output is correct
68 Correct 519 ms 56292 KB Output is correct
69 Correct 314 ms 56188 KB Output is correct
70 Correct 116 ms 36028 KB Output is correct
71 Correct 252 ms 56168 KB Output is correct
72 Correct 307 ms 56184 KB Output is correct
73 Correct 326 ms 56176 KB Output is correct
74 Correct 326 ms 56232 KB Output is correct
75 Correct 343 ms 56204 KB Output is correct
76 Correct 330 ms 56168 KB Output is correct
77 Correct 341 ms 56104 KB Output is correct
78 Correct 343 ms 56172 KB Output is correct
79 Correct 175 ms 56168 KB Output is correct
80 Correct 178 ms 56164 KB Output is correct
81 Correct 208 ms 56260 KB Output is correct
82 Correct 380 ms 56312 KB Output is correct
83 Correct 339 ms 56192 KB Output is correct
84 Correct 184 ms 56316 KB Output is correct
85 Correct 329 ms 56220 KB Output is correct
86 Correct 575 ms 56240 KB Output is correct
87 Correct 336 ms 56148 KB Output is correct
88 Correct 352 ms 56064 KB Output is correct
89 Correct 379 ms 56168 KB Output is correct
90 Correct 167 ms 36080 KB Output is correct
91 Correct 371 ms 56304 KB Output is correct
92 Correct 428 ms 56160 KB Output is correct
93 Correct 609 ms 56148 KB Output is correct
94 Correct 409 ms 56168 KB Output is correct
95 Correct 347 ms 56216 KB Output is correct
96 Correct 361 ms 56220 KB Output is correct
97 Correct 603 ms 56164 KB Output is correct
98 Correct 351 ms 56264 KB Output is correct
99 Correct 413 ms 56292 KB Output is correct
100 Correct 560 ms 56260 KB Output is correct