Submission #681706

# Submission time Handle Problem Language Result Execution time Memory
681706 2023-01-13T19:43:45 Z tvladm2009 Bomb (IZhO17_bomb) C++14
100 / 100
342 ms 110868 KB
#include <bits/stdc++.h>

using ll = long long;

int const nmax = 2500;

std::string s[5 + nmax];
int dp[5 + nmax], dp_left[5 + nmax][5 + nmax], dp_right[5 + nmax][5 + nmax], dp_up[5 + nmax][5 + nmax], dp_down[5 + nmax][5 + nmax];

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

  int n, m;
  std::cin >> n >> m;
  for(int i = 1;i <= n; i++) {
    std::cin >> s[i];
    s[i] = "#" + s[i];
  }
  for(int i = 1;i <= n; i++)
    for(int j = 1;j <= m; j++) {
      if(s[i][j] == '1') {
        dp_left[i][j] = dp_left[i][j - 1] + 1;
        dp_up[i][j] = dp_up[i - 1][j] + 1;
      }
    }
  for(int i = n; 1 <= i; i--)
    for(int j = m; 1 <= j; j--) {
      if(s[i][j] == '1') {
        dp_right[i][j] = dp_right[i][j + 1] + 1;
        dp_down[i][j] = dp_down[i + 1][j] + 1;
      }
    }
  for(int i = 1;i <= n; i++)
    dp[i] = m + 1;

  int h = n;
  for(int i = 1;i <= n; i++)
    for(int j = 1;j <= m; j++)
      if(s[i][j] == '1') {
        h = std::min(h, dp_up[i][j] + dp_down[i][j] - 1);
        dp[1] = std::min(dp[1], dp_left[i][j] + dp_right[i][j] - 1);
      }
  for(int j = 1;j <= m; j++) {
    int cnt = 0, left = 0, right = m + 1;
    for(int i = 1;i <= n; i++) {
      if(s[i][j] == '1') {
        left = std::max(left, j - dp_left[i][j] + 1);
        right = std::min(right, j + dp_right[i][j] - 1);
        cnt++;
        dp[cnt] = std::min(dp[cnt], right - left + 1);
      } else {
        cnt = 0;
        left = 0;
        right = m + 1;
      }
    }
  }
  for(int j = 1; j <= m; j++) {
    int cnt = 0, left = 0, right = m + 1;
    for(int i = n; 1 <= i; i--) {
      if(s[i][j] == '1') {
        left = std::max(left, j - dp_left[i][j] + 1);
        right = std::min(right, j + dp_right[i][j] - 1);
        cnt++;
        dp[cnt] = std::min(dp[cnt], right - left + 1);
      } else {
        cnt = 0;
        left = 0;
        right = m + 1;
      }
    }
  }
  int result = 0;
  for(int i = 1;i <= h; i++) {
    if(i > 1)
      dp[i] = std::min(dp[i], dp[i - 1]);
    result = std::max(result, dp[i] * i);
  }
  std::cout << result << "\n";
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 19 ms 40448 KB Output is correct
4 Correct 21 ms 40420 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 540 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 0 ms 596 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 1368 KB Output is correct
24 Correct 1 ms 1364 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 1 ms 2132 KB Output is correct
27 Correct 5 ms 6484 KB Output is correct
28 Correct 2 ms 1448 KB Output is correct
29 Correct 8 ms 8404 KB Output is correct
30 Correct 5 ms 6344 KB Output is correct
31 Correct 4 ms 4436 KB Output is correct
32 Correct 4 ms 6184 KB Output is correct
33 Correct 7 ms 8400 KB Output is correct
34 Correct 2 ms 1656 KB Output is correct
35 Correct 2 ms 1876 KB Output is correct
36 Correct 10 ms 11248 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 341 ms 110768 KB Output is correct
39 Correct 1 ms 664 KB Output is correct
40 Correct 47 ms 28064 KB Output is correct
41 Correct 1 ms 724 KB Output is correct
42 Correct 2 ms 2132 KB Output is correct
43 Correct 268 ms 102980 KB Output is correct
44 Correct 7 ms 9940 KB Output is correct
45 Correct 253 ms 105588 KB Output is correct
46 Correct 249 ms 110764 KB Output is correct
47 Correct 258 ms 105756 KB Output is correct
48 Correct 252 ms 110740 KB Output is correct
49 Correct 342 ms 110760 KB Output is correct
50 Correct 253 ms 110760 KB Output is correct
51 Correct 252 ms 110708 KB Output is correct
52 Correct 247 ms 110624 KB Output is correct
53 Correct 249 ms 109388 KB Output is correct
54 Correct 196 ms 84128 KB Output is correct
55 Correct 165 ms 80656 KB Output is correct
56 Correct 325 ms 110768 KB Output is correct
57 Correct 158 ms 70796 KB Output is correct
58 Correct 170 ms 80832 KB Output is correct
59 Correct 155 ms 74664 KB Output is correct
60 Correct 219 ms 94384 KB Output is correct
61 Correct 330 ms 110820 KB Output is correct
62 Correct 332 ms 110744 KB Output is correct
63 Correct 332 ms 110868 KB Output is correct
64 Correct 154 ms 76364 KB Output is correct
65 Correct 226 ms 108604 KB Output is correct
66 Correct 226 ms 102452 KB Output is correct
67 Correct 247 ms 110764 KB Output is correct
68 Correct 278 ms 110864 KB Output is correct
69 Correct 152 ms 70008 KB Output is correct
70 Correct 60 ms 28272 KB Output is correct
71 Correct 134 ms 55980 KB Output is correct
72 Correct 168 ms 66956 KB Output is correct
73 Correct 161 ms 67884 KB Output is correct
74 Correct 155 ms 70992 KB Output is correct
75 Correct 160 ms 74196 KB Output is correct
76 Correct 163 ms 76876 KB Output is correct
77 Correct 166 ms 77848 KB Output is correct
78 Correct 174 ms 78256 KB Output is correct
79 Correct 67 ms 23272 KB Output is correct
80 Correct 64 ms 25880 KB Output is correct
81 Correct 85 ms 26648 KB Output is correct
82 Correct 171 ms 83344 KB Output is correct
83 Correct 167 ms 83672 KB Output is correct
84 Correct 46 ms 13924 KB Output is correct
85 Correct 163 ms 81532 KB Output is correct
86 Correct 295 ms 108492 KB Output is correct
87 Correct 156 ms 79328 KB Output is correct
88 Correct 176 ms 81192 KB Output is correct
89 Correct 209 ms 98636 KB Output is correct
90 Correct 97 ms 56736 KB Output is correct
91 Correct 186 ms 89036 KB Output is correct
92 Correct 223 ms 92336 KB Output is correct
93 Correct 281 ms 106648 KB Output is correct
94 Correct 217 ms 96016 KB Output is correct
95 Correct 170 ms 83780 KB Output is correct
96 Correct 168 ms 83096 KB Output is correct
97 Correct 286 ms 108404 KB Output is correct
98 Correct 170 ms 82712 KB Output is correct
99 Correct 208 ms 95264 KB Output is correct
100 Correct 282 ms 105932 KB Output is correct