oj.uz

답안 #833193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833193 2023-08-22T03:04:17 Z vjudge1 Bomb (IZhO17_bomb) C++17
22 / 100
 1000 ms 73976 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');
  vector pref(n, vector<int>(m));
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < m; j++) {
      pref[i][j] = a[i][j];
      if(i) pref[i][j] += pref[i-1][j];
      if(j) pref[i][j] += pref[i][j-1];
      if(i > 0 && j > 0) pref[i][j] -= pref[i-1][j-1];
    }
  }
  const auto get = [&](int i1, int j1, int i2, int j2) -> int {
    int ans = pref[i2][j2];
    if(i1) ans -= pref[i1-1][j2];
    if(j1) ans -= pref[i2][j1-1];
    if(i1 && j1) ans += pref[i1-1][j1-1];
    return ans;
  };
  vector b(n, vector<int>(m));
  const int INF = 1e9;
  int ans = 0;
  for(int h = 1; h <= n; h++) {
    debug(cerr << "h = " << h << '\n');
    int best = INF;
    for(int i = 0; i+h-1 < n; i++) {
      int consec = 0;
      for(int j = 0; j < m; j++) {
        int x = (get(i, j, i+h-1, j) == h);
        debug(cerr << x);
        if(x) {
          consec++;
          for(int k = i; k < i+h; k++)
            b[k][j] = 1;
        } else {
          if(consec != 0) best = min(best, consec);
          consec = 0;
        }
      }
      if(consec != 0) best = min(best, consec);
      debug(cerr << '\n');
    }
    debug(cerr << "best = " << best << '\n');
    if(best != INF && a == b) ans = max(ans, best * h);
    for(int i = 0; i < n; i++) {
      for(int j = 0; j < m; j++)
        b[i][j] = 0;
    }
  }
  cout << ans << '\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
22.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 478 ms 724 KB Output is correct
4 Correct 173 ms 724 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 224 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 1 ms 340 KB Output isn't correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Incorrect 1 ms 340 KB Output isn't correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Incorrect 2 ms 340 KB Output isn't correct
24 Incorrect 2 ms 340 KB Output isn't correct
25 Incorrect 2 ms 340 KB Output isn't correct
26 Incorrect 9 ms 340 KB Output isn't correct
27 Correct 398 ms 1268 KB Output is correct
28 Correct 39 ms 1620 KB Output is correct
29 Incorrect 873 ms 1824 KB Output isn't correct
30 Incorrect 138 ms 2516 KB Output isn't correct
31 Incorrect 76 ms 2100 KB Output isn't correct
32 Incorrect 102 ms 2132 KB Output isn't correct
33 Incorrect 300 ms 2716 KB Output isn't correct
34 Correct 37 ms 1236 KB Output is correct
35 Incorrect 107 ms 2720 KB Output isn't correct
36 Execution timed out 1076 ms 2644 KB Time limit exceeded
37 Incorrect 0 ms 212 KB Output isn't correct
38 Execution timed out 1088 ms 73900 KB Time limit exceeded
39 Incorrect 0 ms 212 KB Output isn't correct
40 Execution timed out 1079 ms 9388 KB Time limit exceeded
41 Incorrect 0 ms 212 KB Output isn't correct
42 Incorrect 4 ms 340 KB Output isn't correct
43 Execution timed out 1086 ms 73892 KB Time limit exceeded
44 Execution timed out 1077 ms 2644 KB Time limit exceeded
45 Execution timed out 1084 ms 73888 KB Time limit exceeded
46 Execution timed out 1085 ms 73908 KB Time limit exceeded
47 Execution timed out 1096 ms 73892 KB Time limit exceeded
48 Execution timed out 1052 ms 73944 KB Time limit exceeded
49 Execution timed out 1090 ms 73904 KB Time limit exceeded
50 Execution timed out 1079 ms 73932 KB Time limit exceeded
51 Execution timed out 1090 ms 73872 KB Time limit exceeded
52 Execution timed out 1079 ms 73888 KB Time limit exceeded
53 Execution timed out 1096 ms 73932 KB Time limit exceeded
54 Execution timed out 1078 ms 73876 KB Time limit exceeded
55 Execution timed out 1093 ms 73932 KB Time limit exceeded
56 Execution timed out 1078 ms 73876 KB Time limit exceeded
57 Execution timed out 1082 ms 73876 KB Time limit exceeded
58 Execution timed out 1097 ms 73904 KB Time limit exceeded
59 Execution timed out 1080 ms 73932 KB Time limit exceeded
60 Execution timed out 1081 ms 73896 KB Time limit exceeded
61 Execution timed out 1086 ms 73892 KB Time limit exceeded
62 Execution timed out 1095 ms 73932 KB Time limit exceeded
63 Execution timed out 1092 ms 73868 KB Time limit exceeded
64 Execution timed out 1088 ms 73944 KB Time limit exceeded
65 Execution timed out 1089 ms 73932 KB Time limit exceeded
66 Execution timed out 1092 ms 73908 KB Time limit exceeded
67 Execution timed out 1065 ms 73932 KB Time limit exceeded
68 Execution timed out 1088 ms 73964 KB Time limit exceeded
69 Execution timed out 1083 ms 73892 KB Time limit exceeded
70 Execution timed out 1090 ms 47396 KB Time limit exceeded
71 Execution timed out 1085 ms 73932 KB Time limit exceeded
72 Execution timed out 1065 ms 73876 KB Time limit exceeded
73 Execution timed out 1076 ms 73876 KB Time limit exceeded
74 Execution timed out 1069 ms 73892 KB Time limit exceeded
75 Execution timed out 1074 ms 73892 KB Time limit exceeded
76 Execution timed out 1074 ms 73900 KB Time limit exceeded
77 Execution timed out 1086 ms 73876 KB Time limit exceeded
78 Execution timed out 1077 ms 73940 KB Time limit exceeded
79 Execution timed out 1047 ms 73872 KB Time limit exceeded
80 Execution timed out 1089 ms 73880 KB Time limit exceeded
81 Execution timed out 1094 ms 73892 KB Time limit exceeded
82 Execution timed out 1088 ms 73976 KB Time limit exceeded
83 Execution timed out 1084 ms 73888 KB Time limit exceeded
84 Execution timed out 1081 ms 73916 KB Time limit exceeded
85 Execution timed out 1053 ms 73932 KB Time limit exceeded
86 Execution timed out 1092 ms 73932 KB Time limit exceeded
87 Execution timed out 1088 ms 73892 KB Time limit exceeded
88 Execution timed out 1077 ms 73904 KB Time limit exceeded
89 Execution timed out 1097 ms 73900 KB Time limit exceeded
90 Execution timed out 1075 ms 47416 KB Time limit exceeded
91 Execution timed out 1090 ms 73896 KB Time limit exceeded
92 Execution timed out 1085 ms 73956 KB Time limit exceeded
93 Execution timed out 1085 ms 73892 KB Time limit exceeded
94 Execution timed out 1089 ms 73892 KB Time limit exceeded
95 Execution timed out 1094 ms 73904 KB Time limit exceeded
96 Execution timed out 1092 ms 73904 KB Time limit exceeded
97 Execution timed out 1086 ms 73932 KB Time limit exceeded
98 Execution timed out 1080 ms 73884 KB Time limit exceeded
99 Execution timed out 1063 ms 73900 KB Time limit exceeded
100 Execution timed out 1073 ms 73892 KB Time limit exceeded