oj.uz

Submission #973323

# Submission time Handle Problem Language Result Execution time Memory
973323 2024-05-01T18:30:47 Z MilosMilutinovic Bomb (IZhO17_bomb) C++14
7 / 100
 144 ms 81092 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;
    }
  }
  cout << width << '\n';
  return 0;
  for (int i = 1; i < m; i++) {
    mx[i + 1] = min(mx[i + 1], mx[i]);
  }
  int res = n * m;
  for (int i = 1; i <= width; i++) {
    res = min(res, mx[i] * i);
  }
  cout << res << '\n';
  return 0;
}

Subtask #1
7.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Incorrect 1 ms 856 KB Output isn't correct
4 Incorrect 1 ms 936 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't 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 1 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 Incorrect 0 ms 348 KB Output isn't correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Incorrect 1 ms 344 KB Output isn't correct
18 Incorrect 1 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 348 KB Output isn't correct
23 Incorrect 1 ms 348 KB Output isn't correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Incorrect 1 ms 348 KB Output isn't correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Correct 2 ms 1372 KB Output is correct
28 Incorrect 3 ms 2036 KB Output isn't correct
29 Incorrect 3 ms 1884 KB Output isn't correct
30 Incorrect 3 ms 2652 KB Output isn't correct
31 Incorrect 3 ms 2392 KB Output isn't correct
32 Incorrect 3 ms 2396 KB Output isn't correct
33 Incorrect 3 ms 2908 KB Output isn't correct
34 Incorrect 2 ms 1372 KB Output isn't correct
35 Incorrect 3 ms 2908 KB Output isn't correct
36 Incorrect 5 ms 2908 KB Output isn't correct
37 Incorrect 0 ms 348 KB Output isn't correct
38 Incorrect 118 ms 80660 KB Output isn't correct
39 Incorrect 0 ms 344 KB Output isn't correct
40 Incorrect 17 ms 10448 KB Output isn't correct
41 Incorrect 0 ms 344 KB Output isn't correct
42 Incorrect 1 ms 344 KB Output isn't correct
43 Incorrect 127 ms 80604 KB Output isn't correct
44 Incorrect 4 ms 3160 KB Output isn't correct
45 Incorrect 112 ms 80632 KB Output isn't correct
46 Incorrect 105 ms 80840 KB Output isn't correct
47 Incorrect 111 ms 80720 KB Output isn't correct
48 Incorrect 111 ms 80692 KB Output isn't correct
49 Incorrect 129 ms 80724 KB Output isn't correct
50 Incorrect 112 ms 80848 KB Output isn't correct
51 Incorrect 111 ms 80716 KB Output isn't correct
52 Incorrect 118 ms 80620 KB Output isn't correct
53 Incorrect 110 ms 80840 KB Output isn't correct
54 Incorrect 102 ms 80640 KB Output isn't correct
55 Incorrect 103 ms 81092 KB Output isn't correct
56 Incorrect 114 ms 80844 KB Output isn't correct
57 Incorrect 104 ms 80720 KB Output isn't correct
58 Incorrect 100 ms 80620 KB Output isn't correct
59 Incorrect 106 ms 80844 KB Output isn't correct
60 Incorrect 122 ms 80872 KB Output isn't correct
61 Incorrect 144 ms 80804 KB Output isn't correct
62 Incorrect 116 ms 80724 KB Output isn't correct
63 Incorrect 134 ms 80976 KB Output isn't correct
64 Incorrect 98 ms 80724 KB Output isn't correct
65 Incorrect 107 ms 80840 KB Output isn't correct
66 Incorrect 104 ms 80820 KB Output isn't correct
67 Incorrect 113 ms 80720 KB Output isn't correct
68 Incorrect 115 ms 80672 KB Output isn't correct
69 Incorrect 100 ms 80724 KB Output isn't correct
70 Incorrect 62 ms 51756 KB Output isn't correct
71 Incorrect 101 ms 80728 KB Output isn't correct
72 Incorrect 112 ms 80744 KB Output isn't correct
73 Incorrect 105 ms 80720 KB Output isn't correct
74 Incorrect 100 ms 80656 KB Output isn't correct
75 Incorrect 98 ms 80720 KB Output isn't correct
76 Incorrect 112 ms 80812 KB Output isn't correct
77 Incorrect 99 ms 80720 KB Output isn't correct
78 Incorrect 99 ms 80844 KB Output isn't correct
79 Incorrect 90 ms 80840 KB Output isn't correct
80 Incorrect 102 ms 80844 KB Output isn't correct
81 Incorrect 91 ms 80692 KB Output isn't correct
82 Incorrect 101 ms 80724 KB Output isn't correct
83 Incorrect 102 ms 80612 KB Output isn't correct
84 Incorrect 90 ms 80844 KB Output isn't correct
85 Incorrect 107 ms 80604 KB Output isn't correct
86 Incorrect 112 ms 80720 KB Output isn't correct
87 Correct 100 ms 80844 KB Output is correct
88 Incorrect 102 ms 80720 KB Output isn't correct
89 Incorrect 108 ms 80844 KB Output isn't correct
90 Incorrect 65 ms 51920 KB Output isn't correct
91 Incorrect 100 ms 80724 KB Output isn't correct
92 Incorrect 105 ms 80828 KB Output isn't correct
93 Incorrect 113 ms 80632 KB Output isn't correct
94 Incorrect 104 ms 80844 KB Output isn't correct
95 Incorrect 112 ms 80844 KB Output isn't correct
96 Incorrect 101 ms 80848 KB Output isn't correct
97 Incorrect 112 ms 80640 KB Output isn't correct
98 Incorrect 100 ms 80616 KB Output isn't correct
99 Incorrect 102 ms 80832 KB Output isn't correct
100 Incorrect 110 ms 80840 KB Output isn't correct