oj.uz

Submission #942741

# Submission time Handle Problem Language Result Execution time Memory
942741 2024-03-11T03:46:52 Z atom Bomb (IZhO17_bomb) C++17
17 / 100
 476 ms 25336 KB 
#include "bits/stdc++.h"
// @JASPER'S BOILERPLATE
using namespace std;
using ll = long long;

#ifdef JASPER
#include "debug.h"
#else
#define debug(...) 166
#endif

signed main() {
    cin.tie(0) -> sync_with_stdio(0);

    int n, m;
    cin >> n >> m;
    vector <vector <int>> a(n + 5, vector <int> (m + 5, 0));
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            char x; cin >> x;
            a[i][j] = x - '0';
        }
    }

    // for (int i = 1; i <= n; ++i) 
    //     for (int j = 1; j <= m; ++j)
    //         cout << a[i][j] << " \n"[j == m]; 

    //sub1: shortest consecutive 1ss
    if (n == 1 || m == 1) {
        if (n == 1) {
            int ans = 1e9;
            for (int i = 1; i <= m; ++i) {
                if (a[1][i] == 0) continue;
                int cur = 0;
                while (i <= m && a[1][i]) { 
                    ++cur;
                    ++i;
                }
                ans = min(ans, cur);
            }
            cout << ans << "\n";
            return 0;
        }
        if (m == 1) {
            int ans = 1e9;
            for (int i = 1; i <= n; ++i) {
                if (a[i][1] == 0) continue;
                int cur = 0;
                while (i <= n && a[i][1]) { 
                    ++cur;
                    ++i;
                }
                ans = min(ans, cur);
            }
            cout << ans << "\n";
            return 0;
        }
    }

    // sub4: fixed width
    if (n <= 450 && m <= 450) {
        vector <vector <int>> prf(n + 5, vector <int> (m + 5, 0));
        int earth = 0;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                earth += (a[i][j] == 0);
                prf[i][j] = prf[i][j - 1] + prf[i - 1][j] - prf[i - 1][j - 1] + a[i][j];
            }
        }

        int y = 1e9;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                if (a[i][j] == 0) continue;
                int cur = 0;
                while (j <= m && a[i][j]) { 
                    ++cur;
                    ++j;
                }
                y = min(y, cur);
            }
        }

        debug(y);
        int ans = 0;
        for (int x = 1; x <= n; ++x) {
            if (x * y <= ans) continue;
            // prf(l)++, prf(r + 1)--;
            vector <vector <int>> dmg(n + 2, vector <int> (m + 2, 0));

            for (int i = 1; i + x - 1 <= n; ++i) {
                for (int j = 1; j + y - 1 <= m; ++j) {
                    int I = i + x - 1, J = j + y - 1;
                    if (prf[I][J] + prf[i - 1][j - 1] - prf[I][j - 1] - prf[i - 1][J] == x * y) {
                        dmg[i][j] += 1;
                        dmg[I + 1][j] -= 1;
                        dmg[i][J + 1] -= 1;
                        dmg[I + 1][J + 1] += 1;
                    }
                }
            } 

            for (int i = 1; i <= n; ++i)
                for (int j = 1; j <= m; ++j)
                    dmg[i][j] += dmg[i - 1][j] + dmg[i][j - 1] - dmg[i - 1][j - 1];

            bool valid = 1;
            for (int i = 1; i <= n; ++i) {
                for (int j = 1; j <= m; ++j) {
                    if (a[i][j] && !dmg[i][j])
                        valid = 0;
                }
            }
            if (valid) ans = max(ans, x * y);
        }

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

}

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:9:20: warning: statement has no effect [-Wunused-value]
    9 | #define debug(...) 166
      |                    ^~~
bomb.cpp:85:9: note: in expansion of macro 'debug'
   85 |         debug(y);
      |         ^~~~~

Subtask #1
17.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output isn't correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 2 ms 520 KB Output is correct
18 Incorrect 2 ms 344 KB Output isn't correct
19 Incorrect 3 ms 348 KB Output isn't correct
20 Incorrect 4 ms 348 KB Output isn't correct
21 Incorrect 1 ms 348 KB Output isn't correct
22 Incorrect 3 ms 348 KB Output isn't correct
23 Incorrect 5 ms 348 KB Output isn't correct
24 Incorrect 2 ms 348 KB Output isn't correct
25 Incorrect 5 ms 348 KB Output isn't correct
26 Correct 5 ms 596 KB Output is correct
27 Correct 120 ms 1444 KB Output is correct
28 Incorrect 156 ms 1756 KB Output isn't correct
29 Incorrect 246 ms 1988 KB Output isn't correct
30 Incorrect 390 ms 3316 KB Output isn't correct
31 Incorrect 240 ms 2300 KB Output isn't correct
32 Incorrect 304 ms 2368 KB Output isn't correct
33 Incorrect 434 ms 3060 KB Output isn't correct
34 Incorrect 138 ms 1832 KB Output isn't correct
35 Incorrect 431 ms 3152 KB Output isn't correct
36 Correct 476 ms 3056 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Incorrect 64 ms 24924 KB Output isn't correct
39 Correct 1 ms 348 KB Output is correct
40 Incorrect 8 ms 3420 KB Output isn't correct
41 Incorrect 0 ms 348 KB Output isn't correct
42 Incorrect 5 ms 596 KB Output isn't correct
43 Incorrect 66 ms 24924 KB Output isn't correct
44 Incorrect 440 ms 3092 KB Output isn't correct
45 Incorrect 64 ms 24924 KB Output isn't correct
46 Incorrect 66 ms 24924 KB Output isn't correct
47 Incorrect 65 ms 24924 KB Output isn't correct
48 Incorrect 66 ms 24920 KB Output isn't correct
49 Incorrect 65 ms 24920 KB Output isn't correct
50 Incorrect 64 ms 25120 KB Output isn't correct
51 Incorrect 64 ms 24924 KB Output isn't correct
52 Incorrect 65 ms 24924 KB Output isn't correct
53 Incorrect 64 ms 25088 KB Output isn't correct
54 Incorrect 64 ms 24924 KB Output isn't correct
55 Incorrect 65 ms 25092 KB Output isn't correct
56 Incorrect 65 ms 25176 KB Output isn't correct
57 Incorrect 64 ms 24920 KB Output isn't correct
58 Incorrect 68 ms 25172 KB Output isn't correct
59 Incorrect 69 ms 24920 KB Output isn't correct
60 Incorrect 64 ms 24920 KB Output isn't correct
61 Incorrect 66 ms 24924 KB Output isn't correct
62 Incorrect 65 ms 25092 KB Output isn't correct
63 Incorrect 74 ms 25180 KB Output isn't correct
64 Incorrect 65 ms 25088 KB Output isn't correct
65 Incorrect 64 ms 25176 KB Output isn't correct
66 Incorrect 74 ms 24924 KB Output isn't correct
67 Incorrect 65 ms 25092 KB Output isn't correct
68 Incorrect 65 ms 25088 KB Output isn't correct
69 Incorrect 65 ms 24924 KB Output isn't correct
70 Incorrect 42 ms 16220 KB Output isn't correct
71 Incorrect 65 ms 25092 KB Output isn't correct
72 Incorrect 64 ms 24920 KB Output isn't correct
73 Incorrect 64 ms 25336 KB Output isn't correct
74 Incorrect 64 ms 25088 KB Output isn't correct
75 Incorrect 65 ms 24924 KB Output isn't correct
76 Incorrect 66 ms 25084 KB Output isn't correct
77 Incorrect 68 ms 24924 KB Output isn't correct
78 Incorrect 65 ms 24924 KB Output isn't correct
79 Incorrect 65 ms 24920 KB Output isn't correct
80 Incorrect 65 ms 25096 KB Output isn't correct
81 Incorrect 65 ms 24924 KB Output isn't correct
82 Incorrect 65 ms 24924 KB Output isn't correct
83 Incorrect 66 ms 24924 KB Output isn't correct
84 Incorrect 67 ms 24932 KB Output isn't correct
85 Incorrect 67 ms 25084 KB Output isn't correct
86 Incorrect 68 ms 24920 KB Output isn't correct
87 Incorrect 67 ms 24920 KB Output isn't correct
88 Incorrect 67 ms 24920 KB Output isn't correct
89 Incorrect 68 ms 24924 KB Output isn't correct
90 Incorrect 42 ms 16216 KB Output isn't correct
91 Incorrect 66 ms 24924 KB Output isn't correct
92 Incorrect 65 ms 24920 KB Output isn't correct
93 Incorrect 67 ms 24924 KB Output isn't correct
94 Incorrect 67 ms 24924 KB Output isn't correct
95 Incorrect 67 ms 25084 KB Output isn't correct
96 Incorrect 72 ms 24920 KB Output isn't correct
97 Incorrect 66 ms 24924 KB Output isn't correct
98 Incorrect 67 ms 24924 KB Output isn't correct
99 Incorrect 67 ms 24924 KB Output isn't correct
100 Incorrect 71 ms 25092 KB Output isn't correct