Submission #170234

# Submission time Handle Problem Language Result Execution time Memory
170234 2019-12-24T10:01:05 Z theboatman Bomb (IZhO17_bomb) C++17
24 / 100
47 ms 7392 KB
#include <bits/stdc++.h>

#define y1 theboatman
#define make_struct(args...) {args}

using namespace std;
typedef long long ll;

const long long INF = ll(1e18) + 10;
const int inf = int(1e9) + 10;
const int N = int(1e6) + 10;

bool can(int first, int c, int n, int m, vector <string> &a) {
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if (a[i][j] == '1') {
                int sz = 0;
                while(j < m && a[i][j] == '1') {
                    j++;
                    sz++;
                }
                j--;

                if (sz < c) {
                    return false;
                }
            }
        }
    }

    for(int j = 0; j < m; j++) {
        for(int i = 0; i < n; i++) {
            if (a[i][j] == '1') {
                int sz = 0;
                while(i < n && a[i][j] == '1') {
                    i++;
                    sz++;
                }
                i--;

                if (sz < first) {
                    return false;
                }
            }
        }
    }

    return true;
}

void brute(int n, int m) {
    vector <string> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    ll ans = 0;
    for(int first = 1; first <= n; first++) {
        for(int second = 1; second <= m; second++) {
            if (can(first, second, n, m, a)) {
                ans = max(ans, 1LL * first * second);
            }
            else {
                break;
            }
        }
    }

    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

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

    if (1LL * n * m * n * m <= int(5e7)) {
        brute(n, m);
        return 0;
    }

    vector <string> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    int second = m;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if (a[i][j] == '1') {
                int sz = 0;
                while(j < m && a[i][j] == '1') {
                    j++;
                    sz++;
                }
                j--;

                second = min(second, sz);
            }
        }
    }

    int first = n;
    for(int j = 0; j < m; j++) {
        for(int i = 0; i < n; i++) {
            if (a[i][j] == '1') {
                int sz = 0;
                while(i < n && a[i][j] == '1') {
                    i++;
                    sz++;
                }
                i--;

                first = min(first, sz);
            }
        }
    }

    cout << 1LL * first * second << "\n";
    return 0;
}
/*
*/
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 21 ms 504 KB Output is correct
4 Correct 20 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 0 ms 376 KB Output isn't correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Incorrect 2 ms 376 KB Output isn't correct
12 Incorrect 2 ms 376 KB Output isn't correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 376 KB Output isn't correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Incorrect 2 ms 376 KB Output isn't correct
19 Incorrect 2 ms 376 KB Output isn't correct
20 Incorrect 2 ms 376 KB Output isn't correct
21 Incorrect 2 ms 376 KB Output isn't correct
22 Incorrect 3 ms 380 KB Output isn't correct
23 Incorrect 2 ms 376 KB Output isn't correct
24 Incorrect 7 ms 376 KB Output isn't correct
25 Incorrect 2 ms 376 KB Output isn't correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Incorrect 3 ms 632 KB Output isn't correct
29 Incorrect 3 ms 504 KB Output isn't correct
30 Incorrect 3 ms 632 KB Output isn't correct
31 Incorrect 3 ms 632 KB Output isn't correct
32 Incorrect 3 ms 632 KB Output isn't correct
33 Incorrect 3 ms 636 KB Output isn't correct
34 Incorrect 2 ms 504 KB Output isn't correct
35 Incorrect 3 ms 632 KB Output isn't correct
36 Correct 3 ms 632 KB Output is correct
37 Incorrect 2 ms 380 KB Output isn't correct
38 Correct 42 ms 7256 KB Output is correct
39 Incorrect 2 ms 376 KB Output isn't correct
40 Incorrect 6 ms 1272 KB Output isn't correct
41 Incorrect 2 ms 376 KB Output isn't correct
42 Incorrect 2 ms 376 KB Output isn't correct
43 Correct 44 ms 7392 KB Output is correct
44 Incorrect 3 ms 632 KB Output isn't correct
45 Incorrect 43 ms 7160 KB Output isn't correct
46 Correct 45 ms 7160 KB Output is correct
47 Incorrect 45 ms 7288 KB Output isn't correct
48 Incorrect 42 ms 7280 KB Output isn't correct
49 Correct 41 ms 7160 KB Output is correct
50 Incorrect 42 ms 7288 KB Output isn't correct
51 Incorrect 43 ms 7160 KB Output isn't correct
52 Incorrect 44 ms 7160 KB Output isn't correct
53 Incorrect 43 ms 7288 KB Output isn't correct
54 Incorrect 47 ms 7160 KB Output isn't correct
55 Incorrect 42 ms 7280 KB Output isn't correct
56 Correct 44 ms 7160 KB Output is correct
57 Incorrect 42 ms 7288 KB Output isn't correct
58 Incorrect 44 ms 7288 KB Output isn't correct
59 Incorrect 44 ms 7160 KB Output isn't correct
60 Correct 43 ms 7160 KB Output is correct
61 Correct 44 ms 7288 KB Output is correct
62 Correct 43 ms 7160 KB Output is correct
63 Correct 43 ms 7160 KB Output is correct
64 Correct 44 ms 7160 KB Output is correct
65 Incorrect 44 ms 7160 KB Output isn't correct
66 Incorrect 42 ms 7160 KB Output isn't correct
67 Incorrect 44 ms 7336 KB Output isn't correct
68 Incorrect 42 ms 7160 KB Output isn't correct
69 Incorrect 44 ms 7284 KB Output isn't correct
70 Incorrect 24 ms 4728 KB Output isn't correct
71 Incorrect 43 ms 7160 KB Output isn't correct
72 Incorrect 41 ms 7032 KB Output isn't correct
73 Incorrect 43 ms 6968 KB Output isn't correct
74 Incorrect 44 ms 7032 KB Output isn't correct
75 Incorrect 42 ms 7032 KB Output isn't correct
76 Incorrect 42 ms 7032 KB Output isn't correct
77 Incorrect 43 ms 7032 KB Output isn't correct
78 Incorrect 44 ms 7032 KB Output isn't correct
79 Incorrect 43 ms 7032 KB Output isn't correct
80 Incorrect 42 ms 7032 KB Output isn't correct
81 Incorrect 44 ms 7032 KB Output isn't correct
82 Incorrect 42 ms 7032 KB Output isn't correct
83 Incorrect 44 ms 7032 KB Output isn't correct
84 Incorrect 47 ms 7032 KB Output isn't correct
85 Incorrect 44 ms 7032 KB Output isn't correct
86 Incorrect 43 ms 7112 KB Output isn't correct
87 Incorrect 43 ms 7032 KB Output isn't correct
88 Incorrect 43 ms 7160 KB Output isn't correct
89 Incorrect 42 ms 7032 KB Output isn't correct
90 Incorrect 25 ms 4600 KB Output isn't correct
91 Incorrect 44 ms 7032 KB Output isn't correct
92 Incorrect 42 ms 7004 KB Output isn't correct
93 Incorrect 41 ms 7032 KB Output isn't correct
94 Incorrect 43 ms 7032 KB Output isn't correct
95 Incorrect 43 ms 7032 KB Output isn't correct
96 Incorrect 43 ms 7032 KB Output isn't correct
97 Incorrect 43 ms 7160 KB Output isn't correct
98 Incorrect 43 ms 7092 KB Output isn't correct
99 Incorrect 43 ms 7032 KB Output isn't correct
100 Incorrect 41 ms 7032 KB Output isn't correct