oj.uz

Submission #399995

# Submission time Handle Problem Language Result Execution time Memory
399995 2021-05-07T02:54:20 Z abc864197532 Bomb (IZhO17_bomb) C++17
19 / 100
 184 ms 8940 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define info() cerr << __PRETTY_FUNCTION__ << ": " << __LINE__ << endl
#define test(args...) info(), abc("[" + string(#args) + "]", args)
void abc() {cerr << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cerr << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
const int N = 1000087, logN = 20, K = 111;

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    string s[n];
    for (int i = 0; i < n; ++i) cin >> s[i];
    vector <int> cnt(m, 0), len(n + 1, 1 << 30);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cnt[j] = s[i][j] == '0' ? 0 : cnt[j] + 1;
        }
        vector <int> l(m), r(m);
        stack <int> stk;
        for (int j = 0; j < m; ++j) {
            if (!stk.empty() && cnt[stk.top()] >= cnt[j]) stk.pop();
            l[j] = stk.empty() ? j + 1 : j - stk.top();
            stk.push(j);
        }
        while (!stk.empty()) stk.pop();
        for (int j = m - 1; ~j; --j) {
            if (!stk.empty() && cnt[stk.top()] >= cnt[j]) stk.pop();
            r[j] = stk.empty() ? m - j : stk.top() - j;
            stk.push(j);
        }
        vector <int> now(n + 1, 1 << 30);
        for (int j = 0; j < m; ++j) if (cnt[j] > 0) {
            now[cnt[j]] = min(now[cnt[j]], l[j] + r[j] - 1);
        }
        int curmn = 1 << 30;
        for (int j = n; ~j; --j) {
            if (now[j] == 1 << 30) now[j] = curmn;
            curmn = min(curmn, now[j]);
        }
        for (int j = 0; j <= n; ++j) len[j] = min(len[j], now[j]);
    }
    int mn = n + 1;
    for (int j = 0; j < m; ++j) {
        int now = 0;
        for (int i = 0; i < n; ++i) {
            if (s[i][j] == '0') {
                if (now > 0) mn = min(mn, now);
                now = 0;
            }
            else now++;
        }
        if (now > 0) mn = min(mn, now);
    }
    if (mn == n + 1) mn = 0;
    int ans = 0;
    for (int i = 1; i <= mn; ++i) ans = max(ans, len[i] * i);
    cout << ans << endl;
}
/*
5 6
001000
111110
111110
111110
000100
 */

Subtask #1
19.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 17 ms 396 KB Output is correct
4 Correct 17 ms 416 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 208 KB Output isn't correct
9 Incorrect 1 ms 204 KB Output isn't correct
10 Incorrect 1 ms 204 KB Output isn't correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Correct 1 ms 204 KB Output is correct
13 Incorrect 1 ms 204 KB Output isn't correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Correct 1 ms 204 KB Output is correct
17 Incorrect 1 ms 204 KB Output isn't correct
18 Incorrect 1 ms 320 KB Output isn't correct
19 Incorrect 1 ms 332 KB Output isn't correct
20 Incorrect 1 ms 324 KB Output isn't correct
21 Incorrect 1 ms 204 KB Output isn't correct
22 Incorrect 1 ms 332 KB Output isn't correct
23 Incorrect 1 ms 332 KB Output isn't correct
24 Incorrect 1 ms 204 KB Output isn't correct
25 Incorrect 1 ms 328 KB Output isn't correct
26 Incorrect 1 ms 320 KB Output isn't correct
27 Incorrect 3 ms 400 KB Output isn't correct
28 Incorrect 3 ms 452 KB Output isn't correct
29 Incorrect 4 ms 588 KB Output isn't correct
30 Incorrect 5 ms 716 KB Output isn't correct
31 Incorrect 4 ms 588 KB Output isn't correct
32 Incorrect 5 ms 588 KB Output isn't correct
33 Incorrect 6 ms 716 KB Output isn't correct
34 Incorrect 3 ms 460 KB Output isn't correct
35 Incorrect 6 ms 716 KB Output isn't correct
36 Incorrect 6 ms 716 KB Output isn't correct
37 Incorrect 1 ms 320 KB Output isn't correct
38 Correct 173 ms 8812 KB Output is correct
39 Incorrect 1 ms 204 KB Output isn't correct
40 Incorrect 20 ms 1860 KB Output isn't correct
41 Incorrect 1 ms 204 KB Output isn't correct
42 Incorrect 1 ms 332 KB Output isn't correct
43 Correct 170 ms 8768 KB Output is correct
44 Incorrect 6 ms 716 KB Output isn't correct
45 Incorrect 172 ms 8832 KB Output isn't correct
46 Correct 157 ms 8748 KB Output is correct
47 Incorrect 175 ms 8780 KB Output isn't correct
48 Incorrect 151 ms 8812 KB Output isn't correct
49 Incorrect 181 ms 8900 KB Output isn't correct
50 Incorrect 167 ms 8824 KB Output isn't correct
51 Incorrect 163 ms 8828 KB Output isn't correct
52 Incorrect 168 ms 8772 KB Output isn't correct
53 Incorrect 165 ms 8728 KB Output isn't correct
54 Incorrect 157 ms 8772 KB Output isn't correct
55 Incorrect 159 ms 8864 KB Output isn't correct
56 Correct 167 ms 8828 KB Output is correct
57 Incorrect 159 ms 8832 KB Output isn't correct
58 Incorrect 161 ms 8908 KB Output isn't correct
59 Incorrect 159 ms 8840 KB Output isn't correct
60 Correct 162 ms 8772 KB Output is correct
61 Correct 179 ms 8736 KB Output is correct
62 Correct 170 ms 8776 KB Output is correct
63 Correct 170 ms 8832 KB Output is correct
64 Correct 156 ms 8772 KB Output is correct
65 Incorrect 164 ms 8720 KB Output isn't correct
66 Incorrect 163 ms 8772 KB Output isn't correct
67 Incorrect 157 ms 8788 KB Output isn't correct
68 Incorrect 168 ms 8900 KB Output isn't correct
69 Incorrect 159 ms 8708 KB Output isn't correct
70 Incorrect 94 ms 6340 KB Output isn't correct
71 Incorrect 152 ms 8772 KB Output isn't correct
72 Incorrect 162 ms 8876 KB Output isn't correct
73 Incorrect 161 ms 8760 KB Output isn't correct
74 Incorrect 167 ms 8724 KB Output isn't correct
75 Incorrect 147 ms 8768 KB Output isn't correct
76 Incorrect 160 ms 8780 KB Output isn't correct
77 Incorrect 158 ms 8772 KB Output isn't correct
78 Incorrect 160 ms 8752 KB Output isn't correct
79 Incorrect 159 ms 8940 KB Output isn't correct
80 Incorrect 154 ms 8832 KB Output isn't correct
81 Incorrect 156 ms 8780 KB Output isn't correct
82 Incorrect 160 ms 8828 KB Output isn't correct
83 Incorrect 162 ms 8728 KB Output isn't correct
84 Incorrect 155 ms 8708 KB Output isn't correct
85 Incorrect 160 ms 8768 KB Output isn't correct
86 Incorrect 173 ms 8736 KB Output isn't correct
87 Incorrect 166 ms 8780 KB Output isn't correct
88 Incorrect 174 ms 8776 KB Output isn't correct
89 Incorrect 171 ms 8772 KB Output isn't correct
90 Incorrect 95 ms 6352 KB Output isn't correct
91 Incorrect 172 ms 8772 KB Output isn't correct
92 Incorrect 166 ms 8836 KB Output isn't correct
93 Incorrect 183 ms 8900 KB Output isn't correct
94 Incorrect 169 ms 8832 KB Output isn't correct
95 Incorrect 173 ms 8768 KB Output isn't correct
96 Incorrect 174 ms 8924 KB Output isn't correct
97 Incorrect 184 ms 8780 KB Output isn't correct
98 Incorrect 177 ms 8760 KB Output isn't correct
99 Incorrect 175 ms 8772 KB Output isn't correct
100 Incorrect 175 ms 8624 KB Output isn't correct