oj.uz

Submission #973325

# Submission time Handle Problem Language Result Execution time Memory
973325 2024-05-01T18:32:11 Z MilosMilutinovic Bomb (IZhO17_bomb) C++14
20 / 100
 138 ms 80872 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<string> s(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  vector<vector<int>> U(n, vector<int>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '0') {
        continue; 
      }
      U[i][j] = (i == 0 || s[i - 1][j] == '0' ? i : U[i - 1][j]);
    }
  }
  vector<vector<int>> D(n, vector<int>(m));
  for (int i = n - 1; i >= 0; i--) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '0') {
        continue;
      }
      D[i][j] = (i == n - 1 || s[i + 1][j] == '0' ? i : D[i + 1][j]);
    }
  }
  vector<vector<int>> len(n, vector<int>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '0') {
        continue;
      }
      len[i][j] = D[i][j] - U[i][j] + 1;
    }
  }
  vector<int> mx(m + 1, n);
  for (int i = 0; i < n; i++) {
    vector<int> stk;
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '0') {
        while (!stk.empty()) {
          int l = j - stk.back();
          mx[l] = min(mx[l], len[i][stk.back()]);
          stk.pop_back();
        }
        continue;
      }
      while (!stk.empty() && len[i][stk.back()] >= len[i][j]) {
        int l = j - stk.back() + 1;
        mx[l] = min(mx[l], len[i][j]);
        stk.pop_back();
      }
      if (!stk.empty()) {
        int l = j - stk.back() + 1;
        mx[l] = min(mx[l], len[i][stk.back()]);
      }
      stk.push_back(j);
    }
    while (!stk.empty()) {
      int l = m - stk.back();
      mx[l] = min(mx[l], len[i][stk.back()]);
      stk.pop_back();
    }
  }
  for (int i = 0; i < n; i++) {
    vector<int> stk;
    for (int j = m - 1; j >= 0; j--) {
      if (s[i][j] == '0') {
        while (!stk.empty()) {
          int l = stk.back() - j;
          mx[l] = min(mx[l], len[i][stk.back()]);
          stk.pop_back();
        }
        continue;
      }
      while (!stk.empty() && len[i][stk.back()] >= len[i][j]) {
        int l = stk.back() - j + 1;
        mx[l] = min(mx[l], len[i][j]);
        stk.pop_back();
      }
      if (!stk.empty()) {
        int l = stk.back() - j + 1;
        mx[l] = min(mx[l], len[i][stk.back()]);
      }
      stk.push_back(j);
    }
    while (!stk.empty()) {
      int l = stk.back() + 1;
      mx[l] = min(mx[l], len[i][stk.back()]);
      stk.pop_back();
    }
  }
  int width = m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '0') {
        continue;
      }
      int ptr = j;
      while (ptr + 1 < m && s[i][ptr + 1] == '1') {
        ptr += 1;
      }
      width = min(width, ptr - j + 1);
      j = ptr;
    }
  }
  for (int i = 1; i < m; i++) {
    mx[i + 1] = min(mx[i + 1], mx[i]);
  }
  int res = 0;
  for (int i = 1; i <= width; i++) {
    res = max(res, mx[i] * i);
  }
  cout << res << '\n';
  return 0;
}

Subtask #1
20.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Incorrect 0 ms 600 KB Output isn't correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Incorrect 1 ms 344 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Correct 0 ms 348 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 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Incorrect 1 ms 348 KB Output isn't correct
20 Incorrect 1 ms 348 KB Output isn't correct
21 Incorrect 1 ms 348 KB Output isn't correct
22 Incorrect 0 ms 344 KB Output isn't correct
23 Incorrect 1 ms 600 KB Output isn't correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Incorrect 1 ms 604 KB Output isn't correct
26 Correct 1 ms 344 KB Output is correct
27 Incorrect 2 ms 1372 KB Output isn't correct
28 Incorrect 2 ms 1884 KB Output isn't correct
29 Incorrect 3 ms 1880 KB Output isn't correct
30 Incorrect 4 ms 2652 KB Output isn't correct
31 Incorrect 4 ms 2396 KB Output isn't correct
32 Incorrect 3 ms 2392 KB Output isn't correct
33 Incorrect 4 ms 2904 KB Output isn't correct
34 Incorrect 2 ms 1372 KB Output isn't correct
35 Incorrect 4 ms 2904 KB Output isn't correct
36 Correct 5 ms 2908 KB Output is correct
37 Incorrect 0 ms 544 KB Output isn't correct
38 Correct 121 ms 80756 KB Output is correct
39 Incorrect 0 ms 348 KB Output isn't correct
40 Incorrect 14 ms 10444 KB Output isn't correct
41 Incorrect 0 ms 348 KB Output isn't correct
42 Incorrect 1 ms 348 KB Output isn't correct
43 Correct 118 ms 80848 KB Output is correct
44 Incorrect 4 ms 2904 KB Output isn't correct
45 Incorrect 113 ms 80844 KB Output isn't correct
46 Correct 107 ms 80848 KB Output is correct
47 Incorrect 138 ms 80640 KB Output isn't correct
48 Incorrect 116 ms 80848 KB Output isn't correct
49 Incorrect 129 ms 80840 KB Output isn't correct
50 Incorrect 115 ms 80840 KB Output isn't correct
51 Incorrect 113 ms 80844 KB Output isn't correct
52 Incorrect 112 ms 80724 KB Output isn't correct
53 Incorrect 131 ms 80668 KB Output isn't correct
54 Incorrect 103 ms 80720 KB Output isn't correct
55 Incorrect 103 ms 80724 KB Output isn't correct
56 Correct 115 ms 80816 KB Output is correct
57 Incorrect 101 ms 80720 KB Output isn't correct
58 Incorrect 100 ms 80844 KB Output isn't correct
59 Incorrect 101 ms 80844 KB Output isn't correct
60 Correct 108 ms 80872 KB Output is correct
61 Incorrect 132 ms 80844 KB Output isn't correct
62 Correct 117 ms 80820 KB Output is correct
63 Correct 121 ms 80844 KB Output is correct
64 Correct 108 ms 80724 KB Output is correct
65 Incorrect 127 ms 80840 KB Output isn't correct
66 Incorrect 122 ms 80720 KB Output isn't correct
67 Incorrect 113 ms 80720 KB Output isn't correct
68 Incorrect 134 ms 80840 KB Output isn't correct
69 Incorrect 107 ms 80856 KB Output isn't correct
70 Incorrect 62 ms 51916 KB Output isn't correct
71 Incorrect 93 ms 80608 KB Output isn't correct
72 Incorrect 99 ms 80724 KB Output isn't correct
73 Incorrect 112 ms 80784 KB Output isn't correct
74 Incorrect 99 ms 80724 KB Output isn't correct
75 Incorrect 99 ms 80708 KB Output isn't correct
76 Incorrect 102 ms 80844 KB Output isn't correct
77 Incorrect 113 ms 80608 KB Output isn't correct
78 Incorrect 101 ms 80720 KB Output isn't correct
79 Incorrect 91 ms 80720 KB Output isn't correct
80 Incorrect 90 ms 80720 KB Output isn't correct
81 Incorrect 99 ms 80740 KB Output isn't correct
82 Incorrect 103 ms 80728 KB Output isn't correct
83 Incorrect 99 ms 80844 KB Output isn't correct
84 Incorrect 93 ms 80640 KB Output isn't correct
85 Incorrect 105 ms 80604 KB Output isn't correct
86 Incorrect 118 ms 80840 KB Output isn't correct
87 Incorrect 99 ms 80840 KB Output isn't correct
88 Incorrect 100 ms 80820 KB Output isn't correct
89 Incorrect 120 ms 80844 KB Output isn't correct
90 Incorrect 68 ms 51920 KB Output isn't correct
91 Incorrect 104 ms 80732 KB Output isn't correct
92 Incorrect 108 ms 80724 KB Output isn't correct
93 Incorrect 111 ms 80772 KB Output isn't correct
94 Incorrect 103 ms 80748 KB Output isn't correct
95 Incorrect 105 ms 80852 KB Output isn't correct
96 Incorrect 102 ms 80848 KB Output isn't correct
97 Incorrect 114 ms 80720 KB Output isn't correct
98 Incorrect 103 ms 80844 KB Output isn't correct
99 Incorrect 111 ms 80720 KB Output isn't correct
100 Incorrect 111 ms 80724 KB Output isn't correct