oj.uz

Submission #831319

# Submission time Handle Problem Language Result Execution time Memory
831319 2023-08-20T04:36:41 Z vjudge1 Bomb (IZhO17_bomb) C++17
100 / 100
 123 ms 55884 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//turn on extra precision
//#pragma GCC target("fpmath=387")

using namespace std;
using namespace __gnu_pbds;

using str   = string;
using ll    = long long;
using pii   = pair <int,int>;
using pll   = pair <ll,ll>;
using vi    = vector <int>;
using vll   = vector <ll>;
using vpii  = vector <pii>;
using vpll  = vector <pll>;

template<class A, class B>
ostream& operator<<(ostream& os, const pair<A, B> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T> &v) {
    bool van = 1; os << '{';
    for(auto &i : v) { if(!van) os << ", "; os << i; van = 0; }
    os << '}'; return os;
}

template<class T, size_t sz>
ostream& operator<<(ostream&os, const array<T,sz> &arr) {
    bool fs = 1; os << '{';
    for(auto &i : arr) { if(!fs) os << ", "; os << i; fs = 0; }
    os << '}'; return os;
}

#define mp make_pair
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
#define all(x) x.begin(), x.end()
#define watch(x) cerr << (#x) << " is : " << (x) << newl

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

template <class T>
ll quickpow(ll num1, ll num2, const T MOD) {
    assert(num2 >= 0); ll ans = 1;
    for(; num2; num2>>=1, num1 = num1 * num1 % MOD) if(num2 & 1) ans = ans * num1 % MOD;
    return ans;
}
// end of Template

int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m;
    cin >> n >> m;

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

    vector<vector<int>> up(n, vector<int>(m)), dw(n, vector<int>(m));
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            if(grid[i][j] == '0') continue;
            up[i][j] = (i && grid[i-1][j] == '1' ? up[i-1][j] : i-1);
        }
    }

    for(int i = n - 1; i >= 0; --i) {
        for(int j = 0; j < m; ++j) {
            if(grid[i][j] == '0') continue;
            dw[i][j] = (i + 1 < n && grid[i+1][j] == '1' ? dw[i+1][j] : i+1);
        }
    }


    const int INF = 1e9;

    int maxv = INF;
    for(int j = 0; j < m; ++j) {
        int L = INF;

        int len = 0;
        for(int i = 0; i < n; ++i) {
            if(grid[i][j] == '0') {
                if(len) L = min(L, len);
                len = 0;
            }
            else ++len;
        }
        if(len) L = min(L, len);


        maxv = min(maxv, L);
    }

    vector<int> ver(m+1, maxv);
    int maxh = m;
    for(int i = 0; i < n; ++i) {
        int L = INF;
        for(int j = 0; j < m; ++j) {
            if(grid[i][j] == '0') continue;

            int u = -1, d = INF, le = j - 1;
            int lenmax = 0;
            for(; j < m && grid[i][j] == '1'; ++j) {
                int len = j - le;
                u = max(u, up[i][j]);
                d = min(d, dw[i][j]);
                ver[len] = min(ver[len], d - u - 1);
                lenmax = max(lenmax, len);
            }
            L = min(L, lenmax);
        }
        maxh = min(maxh, L);

        for(int j = m - 1; j >= 0; --j) {
            if(grid[i][j] == '0') continue;

            int u = -1, d = INF, ri = j + 1;
            for(; j >= 0 && grid[i][j] == '1'; --j) {
                int len = ri - j;
                u = max(u, up[i][j]);
                d = min(d, dw[i][j]);
                ver[len] = min(ver[len], d - u - 1);
            }
        }
    }

    int ans = 0;
    for(int i = 1; i <= maxh; ++i) {
        if(ver[i] == INF) continue;
        ans = max(ans, i * ver[i]);
    }
    cout << ans << newl;

    return 0;
}

Compilation message

bomb.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
bomb.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      | 
bomb.cpp:8: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    8 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 332 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 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 3 ms 1480 KB Output is correct
30 Correct 4 ms 2132 KB Output is correct
31 Correct 3 ms 1732 KB Output is correct
32 Correct 3 ms 1864 KB Output is correct
33 Correct 4 ms 2260 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 4 ms 2260 KB Output is correct
36 Correct 4 ms 2208 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 111 ms 55660 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 14 ms 7244 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 120 ms 55764 KB Output is correct
44 Correct 4 ms 2184 KB Output is correct
45 Correct 107 ms 55664 KB Output is correct
46 Correct 107 ms 55664 KB Output is correct
47 Correct 109 ms 55672 KB Output is correct
48 Correct 106 ms 55660 KB Output is correct
49 Correct 112 ms 55660 KB Output is correct
50 Correct 107 ms 55672 KB Output is correct
51 Correct 106 ms 55660 KB Output is correct
52 Correct 106 ms 55756 KB Output is correct
53 Correct 106 ms 55672 KB Output is correct
54 Correct 101 ms 55656 KB Output is correct
55 Correct 101 ms 55660 KB Output is correct
56 Correct 113 ms 55784 KB Output is correct
57 Correct 98 ms 55768 KB Output is correct
58 Correct 100 ms 55656 KB Output is correct
59 Correct 100 ms 55660 KB Output is correct
60 Correct 106 ms 55656 KB Output is correct
61 Correct 121 ms 55768 KB Output is correct
62 Correct 112 ms 55768 KB Output is correct
63 Correct 114 ms 55656 KB Output is correct
64 Correct 123 ms 55656 KB Output is correct
65 Correct 106 ms 55768 KB Output is correct
66 Correct 105 ms 55656 KB Output is correct
67 Correct 107 ms 55756 KB Output is correct
68 Correct 108 ms 55772 KB Output is correct
69 Correct 104 ms 55656 KB Output is correct
70 Correct 64 ms 35788 KB Output is correct
71 Correct 98 ms 55668 KB Output is correct
72 Correct 100 ms 55672 KB Output is correct
73 Correct 98 ms 55756 KB Output is correct
74 Correct 100 ms 55756 KB Output is correct
75 Correct 101 ms 55768 KB Output is correct
76 Correct 103 ms 55756 KB Output is correct
77 Correct 100 ms 55780 KB Output is correct
78 Correct 100 ms 55680 KB Output is correct
79 Correct 93 ms 55756 KB Output is correct
80 Correct 93 ms 55672 KB Output is correct
81 Correct 101 ms 55796 KB Output is correct
82 Correct 101 ms 55756 KB Output is correct
83 Correct 102 ms 55672 KB Output is correct
84 Correct 97 ms 55760 KB Output is correct
85 Correct 103 ms 55660 KB Output is correct
86 Correct 119 ms 55756 KB Output is correct
87 Correct 100 ms 55756 KB Output is correct
88 Correct 105 ms 55744 KB Output is correct
89 Correct 104 ms 55664 KB Output is correct
90 Correct 64 ms 35784 KB Output is correct
91 Correct 103 ms 55764 KB Output is correct
92 Correct 105 ms 55732 KB Output is correct
93 Correct 112 ms 55680 KB Output is correct
94 Correct 111 ms 55660 KB Output is correct
95 Correct 102 ms 55736 KB Output is correct
96 Correct 104 ms 55884 KB Output is correct
97 Correct 112 ms 55756 KB Output is correct
98 Correct 100 ms 55656 KB Output is correct
99 Correct 104 ms 55768 KB Output is correct
100 Correct 111 ms 55756 KB Output is correct