oj.uz

답안 #833453

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833453 2023-08-22T05:47:41 Z vjudge1 Bomb (IZhO17_bomb) C++17
24 / 100
 137 ms 24912 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;
  {
    for(int i = 0; i < n; i++) {
      int cur = 0;
      for(int j = 0; j < m; j++) {
        if(a[i][j] == 0) {
          if(cur != 0) w = min(w, cur);
          cur = 0;
        } else {
          cur++;
        }
      }
      if(cur != 0) w = min(w, cur);
    }
  }
  {
    for(int j = 0; j < m; j++) {
      int cur = 0;
      for(int i = 0; i < n; i++) {
        if(a[i][j] == 0) {
          if(cur != 0) h = min(h, cur);
          cur = 0;
        } else {
          cur++;
        }
      }
      if(cur != 0) h = min(h, cur);
    }
  }
  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 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 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 0 ms 340 KB Output isn't correct
21 Incorrect 1 ms 340 KB Output isn't correct
22 Incorrect 0 ms 340 KB Output isn't correct
23 Incorrect 1 ms 340 KB Output isn't correct
24 Incorrect 0 ms 464 KB Output isn't correct
25 Incorrect 0 ms 340 KB Output isn't correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Incorrect 2 ms 724 KB Output isn't correct
29 Incorrect 2 ms 724 KB Output isn't correct
30 Incorrect 4 ms 980 KB Output isn't correct
31 Incorrect 2 ms 852 KB Output isn't correct
32 Incorrect 2 ms 852 KB Output isn't correct
33 Incorrect 3 ms 1108 KB Output isn't correct
34 Incorrect 1 ms 596 KB Output isn't correct
35 Incorrect 3 ms 1108 KB Output isn't correct
36 Correct 3 ms 1108 KB Output is correct
37 Incorrect 1 ms 212 KB Output isn't correct
38 Correct 113 ms 24876 KB Output is correct
39 Incorrect 0 ms 212 KB Output isn't correct
40 Incorrect 10 ms 3364 KB Output isn't correct
41 Incorrect 0 ms 212 KB Output isn't correct
42 Incorrect 0 ms 340 KB Output isn't correct
43 Correct 117 ms 24868 KB Output is correct
44 Incorrect 3 ms 1108 KB Output isn't correct
45 Incorrect 125 ms 24788 KB Output isn't correct
46 Correct 123 ms 24908 KB Output is correct
47 Incorrect 117 ms 24864 KB Output isn't correct
48 Incorrect 131 ms 24868 KB Output isn't correct
49 Correct 127 ms 24864 KB Output is correct
50 Incorrect 122 ms 24788 KB Output isn't correct
51 Incorrect 113 ms 24788 KB Output isn't correct
52 Incorrect 125 ms 24864 KB Output isn't correct
53 Incorrect 122 ms 24788 KB Output isn't correct
54 Incorrect 116 ms 24788 KB Output isn't correct
55 Incorrect 137 ms 24788 KB Output isn't correct
56 Correct 119 ms 24788 KB Output is correct
57 Incorrect 122 ms 24908 KB Output isn't correct
58 Incorrect 122 ms 24872 KB Output isn't correct
59 Incorrect 122 ms 24872 KB Output isn't correct
60 Correct 120 ms 24912 KB Output is correct
61 Correct 111 ms 24864 KB Output is correct
62 Correct 125 ms 24788 KB Output is correct
63 Correct 122 ms 24788 KB Output is correct
64 Correct 117 ms 24868 KB Output is correct
65 Incorrect 118 ms 24908 KB Output isn't correct
66 Incorrect 118 ms 24788 KB Output isn't correct
67 Incorrect 117 ms 24864 KB Output isn't correct
68 Incorrect 115 ms 24788 KB Output isn't correct
69 Incorrect 130 ms 24872 KB Output isn't correct
70 Incorrect 61 ms 16044 KB Output isn't correct
71 Incorrect 114 ms 24868 KB Output isn't correct
72 Incorrect 113 ms 24848 KB Output isn't correct
73 Incorrect 118 ms 24788 KB Output isn't correct
74 Incorrect 126 ms 24868 KB Output isn't correct
75 Incorrect 126 ms 24872 KB Output isn't correct
76 Incorrect 120 ms 24864 KB Output isn't correct
77 Incorrect 125 ms 24868 KB Output isn't correct
78 Incorrect 117 ms 24864 KB Output isn't correct
79 Incorrect 112 ms 24864 KB Output isn't correct
80 Incorrect 118 ms 24864 KB Output isn't correct
81 Incorrect 119 ms 24864 KB Output isn't correct
82 Incorrect 119 ms 24868 KB Output isn't correct
83 Incorrect 114 ms 24868 KB Output isn't correct
84 Incorrect 110 ms 24788 KB Output isn't correct
85 Incorrect 112 ms 24868 KB Output isn't correct
86 Incorrect 118 ms 24908 KB Output isn't correct
87 Incorrect 112 ms 24864 KB Output isn't correct
88 Incorrect 122 ms 24864 KB Output isn't correct
89 Incorrect 118 ms 24868 KB Output isn't correct
90 Incorrect 65 ms 15956 KB Output isn't correct
91 Incorrect 115 ms 24788 KB Output isn't correct
92 Incorrect 117 ms 24788 KB Output isn't correct
93 Incorrect 113 ms 24872 KB Output isn't correct
94 Incorrect 114 ms 24788 KB Output isn't correct
95 Incorrect 111 ms 24868 KB Output isn't correct
96 Incorrect 117 ms 24892 KB Output isn't correct
97 Incorrect 121 ms 24788 KB Output isn't correct
98 Incorrect 118 ms 24868 KB Output isn't correct
99 Incorrect 117 ms 24864 KB Output isn't correct
100 Incorrect 124 ms 24788 KB Output isn't correct