oj.uz

답안 #883712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
883712 2023-12-05T19:21:15 Z Sokol080808 Bomb (IZhO17_bomb) C++17
46 / 100
 127 ms 55888 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 < n; 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++;

            int mx_l = r - i + 1;
            mn = min(mn, mx_l);

            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++;

            int mx_l = r - j + 1;
            mn = min(mn, mx_l);

            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]);
                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
46.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Incorrect 14 ms 868 KB Output isn't correct
4 Incorrect 13 ms 860 KB Output isn't 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 0 ms 348 KB Output isn't correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 0 ms 344 KB Output isn't correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Incorrect 0 ms 348 KB Output isn't correct
20 Incorrect 1 ms 344 KB Output isn't correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Incorrect 1 ms 348 KB Output isn't correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Incorrect 3 ms 1372 KB Output isn't correct
29 Incorrect 2 ms 1372 KB Output isn't correct
30 Incorrect 3 ms 2140 KB Output isn't correct
31 Correct 4 ms 1628 KB Output is correct
32 Incorrect 3 ms 1884 KB Output isn't correct
33 Incorrect 3 ms 2140 KB Output isn't correct
34 Incorrect 2 ms 1116 KB Output isn't correct
35 Incorrect 3 ms 2140 KB Output isn't correct
36 Correct 4 ms 2124 KB Output is correct
37 Incorrect 0 ms 348 KB Output isn't correct
38 Correct 100 ms 55548 KB Output is correct
39 Incorrect 0 ms 348 KB Output isn't correct
40 Correct 13 ms 7176 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 101 ms 55552 KB Output is correct
44 Correct 4 ms 2140 KB Output is correct
45 Incorrect 100 ms 55552 KB Output isn't correct
46 Correct 99 ms 55788 KB Output is correct
47 Incorrect 100 ms 55632 KB Output isn't correct
48 Correct 100 ms 55792 KB Output is correct
49 Correct 104 ms 55792 KB Output is correct
50 Correct 99 ms 55792 KB Output is correct
51 Correct 98 ms 55636 KB Output is correct
52 Correct 100 ms 55636 KB Output is correct
53 Correct 102 ms 55548 KB Output is correct
54 Correct 109 ms 55636 KB Output is correct
55 Incorrect 121 ms 55792 KB Output isn't correct
56 Correct 100 ms 55632 KB Output is correct
57 Incorrect 96 ms 55636 KB Output isn't correct
58 Correct 102 ms 55792 KB Output is correct
59 Correct 97 ms 55548 KB Output is correct
60 Correct 99 ms 55636 KB Output is correct
61 Correct 109 ms 55796 KB Output is correct
62 Correct 106 ms 55796 KB Output is correct
63 Correct 100 ms 55668 KB Output is correct
64 Correct 104 ms 55552 KB Output is correct
65 Correct 127 ms 55544 KB Output is correct
66 Correct 108 ms 55888 KB Output is correct
67 Correct 102 ms 55788 KB Output is correct
68 Correct 100 ms 55552 KB Output is correct
69 Correct 111 ms 55636 KB Output is correct
70 Incorrect 62 ms 35756 KB Output isn't correct
71 Incorrect 99 ms 55632 KB Output isn't correct
72 Incorrect 96 ms 55792 KB Output isn't correct
73 Correct 100 ms 55556 KB Output is correct
74 Incorrect 100 ms 55636 KB Output isn't correct
75 Incorrect 104 ms 55772 KB Output isn't correct
76 Incorrect 100 ms 55636 KB Output isn't correct
77 Incorrect 109 ms 55772 KB Output isn't correct
78 Incorrect 98 ms 55636 KB Output isn't correct
79 Incorrect 96 ms 55772 KB Output isn't correct
80 Incorrect 94 ms 55556 KB Output isn't correct
81 Incorrect 96 ms 55636 KB Output isn't correct
82 Incorrect 98 ms 55792 KB Output isn't correct
83 Incorrect 98 ms 55544 KB Output isn't correct
84 Incorrect 101 ms 55792 KB Output isn't correct
85 Incorrect 97 ms 55792 KB Output isn't correct
86 Incorrect 99 ms 55796 KB Output isn't correct
87 Incorrect 97 ms 55788 KB Output isn't correct
88 Correct 96 ms 55796 KB Output is correct
89 Correct 113 ms 55792 KB Output is correct
90 Incorrect 61 ms 35668 KB Output isn't correct
91 Incorrect 98 ms 55772 KB Output isn't correct
92 Incorrect 98 ms 55636 KB Output isn't correct
93 Incorrect 112 ms 55552 KB Output isn't correct
94 Correct 99 ms 55636 KB Output is correct
95 Incorrect 97 ms 55636 KB Output isn't correct
96 Correct 98 ms 55768 KB Output is correct
97 Incorrect 100 ms 55548 KB Output isn't correct
98 Incorrect 102 ms 55768 KB Output isn't correct
99 Incorrect 100 ms 55636 KB Output isn't correct
100 Incorrect 99 ms 55776 KB Output isn't correct