oj.uz

답안 #833171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833171 2023-08-22T02:44:30 Z vjudge1 Bomb (IZhO17_bomb) C++17
24 / 100
 180 ms 49792 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// using ld = long double;
#define all(x) begin(x), end(x)
#ifdef LOCAL
#define debug(...) __VA_ARGS__;
#else
#define debug(...)
#endif

template<class A, class B> ostream& operator<<(ostream& os, const pair<A, B> &p);
template<class T> ostream& operator<<(ostream& os, const vector<T> &v);
template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N> &v);

template<class A, class B>
ostream& operator<<(ostream& os, const pair<A, B> &p) {
  return os << '(' << p.first << ',' << p.second << ')';
}
 
template<class T>
ostream& operator<<(ostream& os, const vector<T> &v) {
  os << '{'; bool fs = 1;
  for(auto &i : v) { if(!fs) os << ','; os << i; fs = 0; }
  return os << '}';
}

template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &v) {
  os << '{'; bool fs = 1;
  for(auto &i : v) { if(!fs) os << ','; os << i; fs = 0; }
  return os << '}';
}

void init() {
}
 
void solve(int tt = 0) {
  int n, m; cin >> n >> m;
  vector a(n, vector<int>(m));
  bool ok = 0;
  for(auto &v : a) for(int &i : v) {
    char c; cin >> c;
    i = c - '0';
    ok |= i;
  }
  if(!ok) return void(cout << 0 << '\n');
  int h = 1e9, w = 1e9;
  {
    vector b = a;
    for(int i = 1; i < n; i++) {
      for(int j = 0; j < m; j++) {
        if(b[i][j] != 0) {
          b[i][j] += b[i-1][j];
        }
      }
    }
    debug({
      for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++)
          cerr << b[i][j];
        cerr << '\n';
      }
    });
    for(int i = 0; i < n; i++) {
      for(int j = 0; j < m; j++) if(b[i][j] != 0 && (i == n-1 || (i < n-1 && b[i+1][j] == 0))) {
        h = min(h, b[i][j]);
      }
    }
  }
  {
    vector b = a;
    for(int j = 1; j < m; j++) {
      for(int i = 0; i < n; i++) {
        if(b[i][j] != 0) {
          b[i][j] += b[i][j-1];
        }
      }
    }
    debug({
      for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++)
          cerr << b[i][j];
        cerr << '\n';
      }
    });
    for(int i = 0; i < n; i++) {
      for(int j = 0; j < m; j++) if(b[i][j] != 0 && (j == m-1 || (j < m-1 && b[i][j+1] == 0))) {
        w = min(w, b[i][j]);
      }
    }
  }
  cout << (ll)h * w << '\n';
}

void reset() {
}
 
int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; // cin >> t;
  init();
  for(int i = 1; i <= t; i++) solve(i), reset();
  return 0;
}

Subtask #1
24.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Incorrect 0 ms 320 KB Output isn't correct
12 Incorrect 0 ms 316 KB Output isn't correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Incorrect 0 ms 212 KB Output isn't correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Incorrect 1 ms 340 KB Output isn't correct
19 Incorrect 1 ms 340 KB Output isn't correct
20 Incorrect 1 ms 340 KB Output isn't correct
21 Incorrect 1 ms 340 KB Output isn't correct
22 Incorrect 1 ms 340 KB Output isn't correct
23 Incorrect 1 ms 328 KB Output isn't correct
24 Incorrect 1 ms 340 KB Output isn't correct
25 Incorrect 1 ms 340 KB Output isn't correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Incorrect 2 ms 1304 KB Output isn't correct
29 Incorrect 3 ms 1368 KB Output isn't correct
30 Incorrect 4 ms 1900 KB Output isn't correct
31 Incorrect 3 ms 1616 KB Output isn't correct
32 Incorrect 3 ms 1608 KB Output isn't correct
33 Incorrect 4 ms 2004 KB Output isn't correct
34 Incorrect 2 ms 1044 KB Output isn't correct
35 Incorrect 4 ms 2004 KB Output isn't correct
36 Correct 4 ms 2004 KB Output is correct
37 Incorrect 0 ms 212 KB Output isn't correct
38 Correct 149 ms 49748 KB Output is correct
39 Incorrect 1 ms 212 KB Output isn't correct
40 Incorrect 15 ms 6644 KB Output isn't correct
41 Incorrect 1 ms 320 KB Output isn't correct
42 Incorrect 1 ms 328 KB Output isn't correct
43 Correct 156 ms 49676 KB Output is correct
44 Incorrect 4 ms 2004 KB Output isn't correct
45 Incorrect 137 ms 49680 KB Output isn't correct
46 Correct 138 ms 49672 KB Output is correct
47 Incorrect 130 ms 49656 KB Output isn't correct
48 Incorrect 136 ms 49672 KB Output isn't correct
49 Correct 130 ms 49684 KB Output is correct
50 Incorrect 147 ms 49776 KB Output isn't correct
51 Incorrect 162 ms 49676 KB Output isn't correct
52 Incorrect 140 ms 49644 KB Output isn't correct
53 Incorrect 171 ms 49672 KB Output isn't correct
54 Incorrect 142 ms 49792 KB Output isn't correct
55 Incorrect 130 ms 49676 KB Output isn't correct
56 Correct 149 ms 49672 KB Output is correct
57 Incorrect 155 ms 49672 KB Output isn't correct
58 Incorrect 126 ms 49676 KB Output isn't correct
59 Incorrect 135 ms 49648 KB Output isn't correct
60 Correct 171 ms 49680 KB Output is correct
61 Correct 129 ms 49664 KB Output is correct
62 Correct 151 ms 49640 KB Output is correct
63 Correct 133 ms 49672 KB Output is correct
64 Correct 147 ms 49776 KB Output is correct
65 Incorrect 144 ms 49676 KB Output isn't correct
66 Incorrect 180 ms 49656 KB Output isn't correct
67 Incorrect 129 ms 49684 KB Output isn't correct
68 Incorrect 137 ms 49672 KB Output isn't correct
69 Incorrect 124 ms 49700 KB Output isn't correct
70 Incorrect 96 ms 32136 KB Output isn't correct
71 Incorrect 159 ms 49672 KB Output isn't correct
72 Incorrect 158 ms 49648 KB Output isn't correct
73 Incorrect 158 ms 49656 KB Output isn't correct
74 Incorrect 162 ms 49644 KB Output isn't correct
75 Incorrect 162 ms 49620 KB Output isn't correct
76 Incorrect 163 ms 49684 KB Output isn't correct
77 Incorrect 163 ms 49660 KB Output isn't correct
78 Incorrect 160 ms 49684 KB Output isn't correct
79 Incorrect 156 ms 49676 KB Output isn't correct
80 Incorrect 139 ms 49652 KB Output isn't correct
81 Incorrect 129 ms 49644 KB Output isn't correct
82 Incorrect 136 ms 49640 KB Output isn't correct
83 Incorrect 132 ms 49656 KB Output isn't correct
84 Incorrect 133 ms 49748 KB Output isn't correct
85 Incorrect 153 ms 49736 KB Output isn't correct
86 Incorrect 144 ms 49676 KB Output isn't correct
87 Incorrect 152 ms 49676 KB Output isn't correct
88 Incorrect 128 ms 49676 KB Output isn't correct
89 Incorrect 164 ms 49656 KB Output isn't correct
90 Incorrect 80 ms 32060 KB Output isn't correct
91 Incorrect 143 ms 49680 KB Output isn't correct
92 Incorrect 125 ms 49648 KB Output isn't correct
93 Incorrect 134 ms 49644 KB Output isn't correct
94 Incorrect 135 ms 49676 KB Output isn't correct
95 Incorrect 159 ms 49644 KB Output isn't correct
96 Incorrect 158 ms 49668 KB Output isn't correct
97 Incorrect 148 ms 49784 KB Output isn't correct
98 Incorrect 128 ms 49672 KB Output isn't correct
99 Incorrect 152 ms 49648 KB Output isn't correct
100 Incorrect 160 ms 49656 KB Output isn't correct