oj.uz

Submission #897576

# Submission time Handle Problem Language Result Execution time Memory
897576 2024-01-03T12:36:47 Z hentai_lover Bomb (IZhO17_bomb) C++14
23 / 100
 1000 ms 62036 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);

            for(int x = j; x <= r; x += 1){

                int u = -1;
                int d = n;
                for (int id = x, 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);
                }
            }

            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
23.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 724 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 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 0 ms 348 KB Output isn't correct
10 Correct 0 ms 460 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Correct 0 ms 456 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 0 ms 456 KB Output isn't correct
16 Correct 1 ms 348 KB Output is correct
17 Incorrect 1 ms 604 KB Output isn't correct
18 Correct 1 ms 348 KB Output is correct
19 Incorrect 0 ms 348 KB Output isn't correct
20 Incorrect 1 ms 348 KB Output isn't correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 1 ms 496 KB Output isn't correct
24 Incorrect 1 ms 348 KB Output isn't correct
25 Incorrect 1 ms 348 KB Output isn't correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 12 ms 1116 KB Output is correct
28 Correct 3 ms 1456 KB Output is correct
29 Correct 19 ms 1628 KB Output is correct
30 Incorrect 7 ms 2140 KB Output isn't correct
31 Incorrect 5 ms 1792 KB Output isn't correct
32 Incorrect 4 ms 1884 KB Output isn't correct
33 Incorrect 9 ms 2396 KB Output isn't correct
34 Correct 2 ms 1116 KB Output is correct
35 Incorrect 5 ms 2396 KB Output isn't correct
36 Incorrect 61 ms 2408 KB Output isn't correct
37 Incorrect 0 ms 344 KB Output isn't correct
38 Execution timed out 1036 ms 61792 KB Time limit exceeded
39 Incorrect 1 ms 344 KB Output isn't correct
40 Incorrect 299 ms 8088 KB Output isn't correct
41 Incorrect 0 ms 348 KB Output isn't correct
42 Incorrect 1 ms 600 KB Output isn't correct
43 Execution timed out 1062 ms 61780 KB Time limit exceeded
44 Incorrect 27 ms 2396 KB Output isn't correct
45 Execution timed out 1077 ms 61792 KB Time limit exceeded
46 Correct 154 ms 61900 KB Output is correct
47 Execution timed out 1039 ms 61776 KB Time limit exceeded
48 Execution timed out 1031 ms 61776 KB Time limit exceeded
49 Execution timed out 1104 ms 61660 KB Time limit exceeded
50 Execution timed out 1030 ms 61804 KB Time limit exceeded
51 Execution timed out 1056 ms 61784 KB Time limit exceeded
52 Execution timed out 1047 ms 61748 KB Time limit exceeded
53 Execution timed out 1012 ms 61932 KB Time limit exceeded
54 Execution timed out 1057 ms 62036 KB Time limit exceeded
55 Execution timed out 1022 ms 61800 KB Time limit exceeded
56 Correct 314 ms 61900 KB Output is correct
57 Execution timed out 1071 ms 61780 KB Time limit exceeded
58 Execution timed out 1054 ms 61888 KB Time limit exceeded
59 Execution timed out 1018 ms 61668 KB Time limit exceeded
60 Execution timed out 1010 ms 61776 KB Time limit exceeded
61 Execution timed out 1051 ms 61668 KB Time limit exceeded
62 Execution timed out 1040 ms 61792 KB Time limit exceeded
63 Execution timed out 1089 ms 61776 KB Time limit exceeded
64 Execution timed out 1062 ms 61792 KB Time limit exceeded
65 Execution timed out 1012 ms 61900 KB Time limit exceeded
66 Execution timed out 1043 ms 61780 KB Time limit exceeded
67 Execution timed out 1045 ms 61664 KB Time limit exceeded
68 Execution timed out 1084 ms 61804 KB Time limit exceeded
69 Execution timed out 1028 ms 61776 KB Time limit exceeded
70 Incorrect 214 ms 39628 KB Output isn't correct
71 Incorrect 485 ms 62036 KB Output isn't correct
72 Incorrect 986 ms 61920 KB Output isn't correct
73 Execution timed out 1044 ms 61884 KB Time limit exceeded
74 Incorrect 949 ms 61900 KB Output isn't correct
75 Execution timed out 1027 ms 62036 KB Time limit exceeded
76 Execution timed out 1036 ms 61896 KB Time limit exceeded
77 Execution timed out 1040 ms 61776 KB Time limit exceeded
78 Execution timed out 1064 ms 61780 KB Time limit exceeded
79 Incorrect 96 ms 61776 KB Output isn't correct
80 Incorrect 94 ms 61780 KB Output isn't correct
81 Incorrect 139 ms 61788 KB Output isn't correct
82 Execution timed out 1024 ms 61828 KB Time limit exceeded
83 Execution timed out 1012 ms 61776 KB Time limit exceeded
84 Incorrect 98 ms 61776 KB Output isn't correct
85 Execution timed out 1027 ms 61776 KB Time limit exceeded
86 Execution timed out 1018 ms 61776 KB Time limit exceeded
87 Correct 854 ms 62036 KB Output is correct
88 Execution timed out 1025 ms 61884 KB Time limit exceeded
89 Execution timed out 1024 ms 61780 KB Time limit exceeded
90 Incorrect 423 ms 40016 KB Output isn't correct
91 Execution timed out 1016 ms 61888 KB Time limit exceeded
92 Execution timed out 1098 ms 61776 KB Time limit exceeded
93 Execution timed out 1066 ms 61780 KB Time limit exceeded
94 Execution timed out 1020 ms 61776 KB Time limit exceeded
95 Execution timed out 1055 ms 61792 KB Time limit exceeded
96 Execution timed out 1055 ms 61780 KB Time limit exceeded
97 Execution timed out 1067 ms 61776 KB Time limit exceeded
98 Execution timed out 1101 ms 61792 KB Time limit exceeded
99 Execution timed out 1055 ms 61776 KB Time limit exceeded
100 Execution timed out 1100 ms 61776 KB Time limit exceeded