oj.uz

Submission #973334

# Submission time Handle Problem Language Result Execution time Memory
973334 2024-05-01T18:49:09 Z MilosMilutinovic Bomb (IZhO17_bomb) C++14
24 / 100
 106 ms 81012 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;
    }
  }
  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;
    }
  }
  int height = n;
  for (int j = 0; j < m; j++) {
    for (int i = 0; i < n; i++) {
      if (s[i][j] == '0') {
        continue;
      }
      int ptr = i;
      while (ptr + 1 < n && s[ptr + 1][j] == '1') {
        ptr += 1;
      }
      height = min(height, ptr - i + 1);
      i = ptr;
    }
  }
  vector<int> mx(m + 1, height);
  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;
      }
      int mn = (int) 1e9;
      for (int k = j; k <= ptr; k++) {
        mn = min(mn, len[i][k]);
        mx[k - j + 1] = min(mx[k - j + 1], mn);
      }
      j = ptr;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = m - 1; j >= 0; j--) {
      if (s[i][j] == '0') {
        continue;
      }
      int ptr = j;
      while (ptr > 0 && s[i][ptr - 1] == '1'){
        ptr -= 1;
      }
      int mn = (int) 1e9;
      for (int k = j; k >= ptr; k--) {
        mn = min(mn, len[i][k]);
        mx[j - k + 1] = min(mx[j - k + 1], mn);
      }
      j = ptr;
    }
  }
  for (int i = 1; i < width; 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
24.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is 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 348 KB Output isn't correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 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 348 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 0 ms 348 KB Output isn't correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Incorrect 0 ms 348 KB Output isn't correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Incorrect 1 ms 348 KB Output isn't correct
25 Incorrect 1 ms 348 KB Output isn't correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Incorrect 3 ms 1884 KB Output isn't correct
29 Incorrect 2 ms 1884 KB Output isn't correct
30 Incorrect 3 ms 2652 KB Output isn't correct
31 Incorrect 2 ms 2396 KB Output isn't correct
32 Incorrect 2 ms 2396 KB Output isn't correct
33 Incorrect 3 ms 2908 KB Output isn't correct
34 Incorrect 1 ms 1372 KB Output isn't correct
35 Incorrect 3 ms 3024 KB Output isn't correct
36 Correct 4 ms 2904 KB Output is correct
37 Incorrect 0 ms 348 KB Output isn't correct
38 Correct 102 ms 80756 KB Output is correct
39 Incorrect 1 ms 348 KB Output isn't correct
40 Incorrect 13 ms 10436 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 99 ms 80724 KB Output is correct
44 Incorrect 3 ms 2908 KB Output isn't correct
45 Incorrect 100 ms 80632 KB Output isn't correct
46 Correct 93 ms 80840 KB Output is correct
47 Incorrect 100 ms 80848 KB Output isn't correct
48 Incorrect 97 ms 80724 KB Output isn't correct
49 Correct 101 ms 80840 KB Output is correct
50 Incorrect 98 ms 80724 KB Output isn't correct
51 Incorrect 96 ms 80976 KB Output isn't correct
52 Incorrect 101 ms 80724 KB Output isn't correct
53 Incorrect 98 ms 80724 KB Output isn't correct
54 Incorrect 92 ms 80604 KB Output isn't correct
55 Incorrect 93 ms 80840 KB Output isn't correct
56 Correct 100 ms 80724 KB Output is correct
57 Incorrect 93 ms 80724 KB Output isn't correct
58 Incorrect 92 ms 80844 KB Output isn't correct
59 Incorrect 87 ms 80840 KB Output isn't correct
60 Correct 97 ms 80640 KB Output is correct
61 Correct 106 ms 80720 KB Output is correct
62 Correct 103 ms 80748 KB Output is correct
63 Correct 99 ms 80600 KB Output is correct
64 Correct 92 ms 80724 KB Output is correct
65 Incorrect 95 ms 81012 KB Output isn't correct
66 Incorrect 93 ms 80628 KB Output isn't correct
67 Incorrect 98 ms 80660 KB Output isn't correct
68 Incorrect 99 ms 80720 KB Output isn't correct
69 Incorrect 89 ms 80720 KB Output isn't correct
70 Incorrect 55 ms 51804 KB Output isn't correct
71 Incorrect 86 ms 80680 KB Output isn't correct
72 Incorrect 91 ms 80656 KB Output isn't correct
73 Incorrect 92 ms 80844 KB Output isn't correct
74 Incorrect 89 ms 80844 KB Output isn't correct
75 Incorrect 92 ms 80864 KB Output isn't correct
76 Incorrect 91 ms 80724 KB Output isn't correct
77 Incorrect 90 ms 80844 KB Output isn't correct
78 Incorrect 89 ms 80720 KB Output isn't correct
79 Incorrect 81 ms 80720 KB Output isn't correct
80 Incorrect 82 ms 80844 KB Output isn't correct
81 Incorrect 82 ms 80848 KB Output isn't correct
82 Incorrect 90 ms 80624 KB Output isn't correct
83 Incorrect 90 ms 80724 KB Output isn't correct
84 Incorrect 81 ms 80676 KB Output isn't correct
85 Incorrect 90 ms 80728 KB Output isn't correct
86 Incorrect 99 ms 80728 KB Output isn't correct
87 Incorrect 91 ms 80848 KB Output isn't correct
88 Incorrect 91 ms 80840 KB Output isn't correct
89 Incorrect 93 ms 80724 KB Output isn't correct
90 Incorrect 57 ms 51804 KB Output isn't correct
91 Incorrect 91 ms 80724 KB Output isn't correct
92 Incorrect 97 ms 80848 KB Output isn't correct
93 Incorrect 101 ms 80828 KB Output isn't correct
94 Incorrect 97 ms 80840 KB Output isn't correct
95 Incorrect 91 ms 80620 KB Output isn't correct
96 Incorrect 93 ms 80720 KB Output isn't correct
97 Incorrect 102 ms 80620 KB Output isn't correct
98 Incorrect 92 ms 80724 KB Output isn't correct
99 Incorrect 90 ms 80732 KB Output isn't correct
100 Incorrect 101 ms 80608 KB Output isn't correct