oj.uz

답안 #833410

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833410 2023-08-22T05:25:00 Z vjudge1 Bomb (IZhO17_bomb) C++17
24 / 100
 246 ms 49508 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');
  const int INF = 1e9;
  int h = INF, w = INF;
  {
    vector b = a;
    for(int i = 1; i < n; i++) {
      for(int j = 0; j < m; j++) {
        if(a[i][j] != 0 && a[i-1][j] == 1) {
          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(a[i][j] != 0 && a[i][j-1] == 1) {
          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]);
      }
    }
  }
  debug(cerr << h << ' ' << w << '\n');
  if(h != INF && w != INF) cout << (ll)h * w << '\n';
  else cout << 0 << '\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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 0 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 212 KB Output isn't correct
12 Incorrect 1 ms 212 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 1 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 0 ms 340 KB Output isn't correct
20 Incorrect 1 ms 464 KB Output isn't correct
21 Incorrect 0 ms 340 KB Output isn't correct
22 Incorrect 0 ms 340 KB Output isn't correct
23 Incorrect 0 ms 340 KB Output isn't correct
24 Incorrect 0 ms 340 KB Output isn't correct
25 Incorrect 1 ms 340 KB Output isn't correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 2 ms 916 KB Output is correct
28 Incorrect 2 ms 1176 KB Output isn't correct
29 Incorrect 3 ms 1248 KB Output isn't correct
30 Incorrect 3 ms 1772 KB Output isn't correct
31 Incorrect 3 ms 1492 KB Output isn't correct
32 Incorrect 3 ms 1508 KB Output isn't correct
33 Incorrect 4 ms 1876 KB Output isn't correct
34 Incorrect 2 ms 980 KB Output isn't correct
35 Incorrect 4 ms 1876 KB Output isn't correct
36 Correct 4 ms 1876 KB Output is correct
37 Incorrect 0 ms 212 KB Output isn't correct
38 Correct 193 ms 49428 KB Output is correct
39 Incorrect 0 ms 212 KB Output isn't correct
40 Incorrect 15 ms 6484 KB Output isn't correct
41 Incorrect 0 ms 212 KB Output isn't correct
42 Incorrect 1 ms 340 KB Output isn't correct
43 Correct 193 ms 49388 KB Output is correct
44 Incorrect 4 ms 2004 KB Output isn't correct
45 Incorrect 177 ms 49428 KB Output isn't correct
46 Correct 173 ms 49420 KB Output is correct
47 Incorrect 189 ms 49416 KB Output isn't correct
48 Incorrect 180 ms 49428 KB Output isn't correct
49 Correct 210 ms 49416 KB Output is correct
50 Incorrect 190 ms 49388 KB Output isn't correct
51 Incorrect 180 ms 49416 KB Output isn't correct
52 Incorrect 182 ms 49420 KB Output isn't correct
53 Incorrect 175 ms 49428 KB Output isn't correct
54 Incorrect 165 ms 49420 KB Output isn't correct
55 Incorrect 157 ms 49420 KB Output isn't correct
56 Correct 211 ms 49432 KB Output is correct
57 Incorrect 150 ms 49392 KB Output isn't correct
58 Incorrect 160 ms 49384 KB Output isn't correct
59 Incorrect 159 ms 49452 KB Output isn't correct
60 Correct 185 ms 49432 KB Output is correct
61 Correct 211 ms 49416 KB Output is correct
62 Correct 212 ms 49452 KB Output is correct
63 Correct 210 ms 49420 KB Output is correct
64 Correct 163 ms 49428 KB Output is correct
65 Incorrect 193 ms 49428 KB Output isn't correct
66 Incorrect 185 ms 49428 KB Output isn't correct
67 Incorrect 191 ms 49424 KB Output isn't correct
68 Incorrect 194 ms 49388 KB Output isn't correct
69 Incorrect 154 ms 49404 KB Output isn't correct
70 Incorrect 84 ms 31740 KB Output isn't correct
71 Incorrect 146 ms 49364 KB Output isn't correct
72 Incorrect 152 ms 49428 KB Output isn't correct
73 Incorrect 166 ms 49460 KB Output isn't correct
74 Incorrect 162 ms 49428 KB Output isn't correct
75 Incorrect 154 ms 49420 KB Output isn't correct
76 Incorrect 162 ms 49384 KB Output isn't correct
77 Incorrect 161 ms 49428 KB Output isn't correct
78 Incorrect 167 ms 49388 KB Output isn't correct
79 Incorrect 139 ms 49424 KB Output isn't correct
80 Incorrect 139 ms 49388 KB Output isn't correct
81 Incorrect 134 ms 49460 KB Output isn't correct
82 Incorrect 166 ms 49420 KB Output isn't correct
83 Incorrect 172 ms 49420 KB Output isn't correct
84 Incorrect 137 ms 49420 KB Output isn't correct
85 Incorrect 161 ms 49424 KB Output isn't correct
86 Incorrect 225 ms 49508 KB Output isn't correct
87 Incorrect 162 ms 49388 KB Output isn't correct
88 Incorrect 171 ms 49384 KB Output isn't correct
89 Incorrect 168 ms 49428 KB Output isn't correct
90 Incorrect 92 ms 31748 KB Output isn't correct
91 Incorrect 161 ms 49416 KB Output isn't correct
92 Incorrect 186 ms 49396 KB Output isn't correct
93 Incorrect 204 ms 49428 KB Output isn't correct
94 Incorrect 180 ms 49420 KB Output isn't correct
95 Incorrect 158 ms 49416 KB Output isn't correct
96 Incorrect 160 ms 49388 KB Output isn't correct
97 Incorrect 214 ms 49468 KB Output isn't correct
98 Incorrect 169 ms 49464 KB Output isn't correct
99 Incorrect 181 ms 49428 KB Output isn't correct
100 Incorrect 246 ms 49428 KB Output isn't correct