oj.uz

Submission #898941

# Submission time Handle Problem Language Result Execution time Memory
898941 2024-01-05T09:30:04 Z hentai_lover Bomb (IZhO17_bomb) C++14
21 / 100
 123 ms 62296 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]);
            }
            for(int id = j, len = 1; id <= r; id ++, len ++){
                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
21.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Incorrect 1 ms 348 KB Output isn't correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 1 ms 344 KB Output isn't correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Incorrect 1 ms 460 KB Output isn't correct
20 Incorrect 1 ms 348 KB Output isn't correct
21 Incorrect 0 ms 464 KB Output isn't correct
22 Incorrect 0 ms 464 KB Output isn't correct
23 Incorrect 1 ms 344 KB Output isn't correct
24 Incorrect 1 ms 604 KB Output isn't correct
25 Incorrect 1 ms 348 KB Output isn't correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Correct 2 ms 1116 KB Output is correct
28 Incorrect 3 ms 1464 KB Output isn't correct
29 Incorrect 3 ms 1628 KB Output isn't correct
30 Incorrect 4 ms 2268 KB Output isn't correct
31 Incorrect 3 ms 1884 KB Output isn't correct
32 Incorrect 4 ms 1884 KB Output isn't correct
33 Incorrect 4 ms 2396 KB Output isn't correct
34 Incorrect 2 ms 1260 KB Output isn't correct
35 Incorrect 3 ms 2396 KB Output isn't correct
36 Incorrect 4 ms 2396 KB Output isn't correct
37 Incorrect 1 ms 460 KB Output isn't correct
38 Correct 112 ms 61900 KB Output is correct
39 Incorrect 1 ms 348 KB Output isn't correct
40 Incorrect 13 ms 7892 KB Output isn't correct
41 Incorrect 0 ms 348 KB Output isn't correct
42 Incorrect 1 ms 348 KB Output isn't correct
43 Correct 116 ms 61884 KB Output is correct
44 Incorrect 4 ms 2396 KB Output isn't correct
45 Incorrect 123 ms 61792 KB Output isn't correct
46 Correct 112 ms 61880 KB Output is correct
47 Incorrect 114 ms 61720 KB Output isn't correct
48 Incorrect 120 ms 61904 KB Output isn't correct
49 Incorrect 112 ms 61716 KB Output isn't correct
50 Incorrect 115 ms 62040 KB Output isn't correct
51 Incorrect 106 ms 61792 KB Output isn't correct
52 Incorrect 108 ms 61776 KB Output isn't correct
53 Incorrect 103 ms 61680 KB Output isn't correct
54 Incorrect 105 ms 61680 KB Output isn't correct
55 Incorrect 105 ms 61776 KB Output isn't correct
56 Correct 102 ms 61884 KB Output is correct
57 Incorrect 118 ms 61920 KB Output isn't correct
58 Incorrect 103 ms 61780 KB Output isn't correct
59 Incorrect 103 ms 61788 KB Output isn't correct
60 Correct 102 ms 61796 KB Output is correct
61 Correct 111 ms 62296 KB Output is correct
62 Correct 108 ms 61796 KB Output is correct
63 Correct 101 ms 61672 KB Output is correct
64 Correct 100 ms 61776 KB Output is correct
65 Incorrect 107 ms 61768 KB Output isn't correct
66 Incorrect 119 ms 61880 KB Output isn't correct
67 Incorrect 101 ms 61780 KB Output isn't correct
68 Incorrect 102 ms 61776 KB Output isn't correct
69 Incorrect 104 ms 61784 KB Output isn't correct
70 Incorrect 67 ms 39824 KB Output isn't correct
71 Incorrect 102 ms 61780 KB Output isn't correct
72 Incorrect 102 ms 61660 KB Output isn't correct
73 Incorrect 108 ms 61792 KB Output isn't correct
74 Incorrect 107 ms 61796 KB Output isn't correct
75 Incorrect 115 ms 61792 KB Output isn't correct
76 Incorrect 103 ms 61880 KB Output isn't correct
77 Incorrect 122 ms 61808 KB Output isn't correct
78 Incorrect 106 ms 61688 KB Output isn't correct
79 Incorrect 104 ms 61776 KB Output isn't correct
80 Incorrect 112 ms 61924 KB Output isn't correct
81 Incorrect 100 ms 61780 KB Output isn't correct
82 Incorrect 102 ms 61780 KB Output isn't correct
83 Incorrect 102 ms 61776 KB Output isn't correct
84 Incorrect 101 ms 61712 KB Output isn't correct
85 Incorrect 100 ms 61660 KB Output isn't correct
86 Incorrect 99 ms 61812 KB Output isn't correct
87 Correct 99 ms 62064 KB Output is correct
88 Incorrect 101 ms 61684 KB Output isn't correct
89 Incorrect 105 ms 61776 KB Output isn't correct
90 Incorrect 64 ms 39812 KB Output isn't correct
91 Incorrect 100 ms 61656 KB Output isn't correct
92 Incorrect 106 ms 62052 KB Output isn't correct
93 Incorrect 100 ms 61792 KB Output isn't correct
94 Incorrect 100 ms 61796 KB Output isn't correct
95 Incorrect 100 ms 61776 KB Output isn't correct
96 Incorrect 106 ms 61792 KB Output isn't correct
97 Incorrect 103 ms 61808 KB Output isn't correct
98 Incorrect 99 ms 61808 KB Output isn't correct
99 Incorrect 100 ms 61660 KB Output isn't correct
100 Incorrect 106 ms 61796 KB Output isn't correct