#pragma GCC optimize("Ofast,O2,O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
#define MP make_pair
typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 3e2;
const int M = 2522;
int n, m;
int a[M][M];
bool bomb[M][M];
int dp[M][M];
int sum(int x1, int y1, int x2, int y2){
assert(x1 <= x2 && y1 <= y2);
int res = dp[x2][y2];
res -= dp[x1 - 1][y2];
res -= dp[x2][y1 - 1];
res += dp[x1 - 1][y1 - 1];
return res;
}
int ans = 0;
bool check(int A, int B){
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++) bomb[i][j] = false;
}
for (int i = 1; i <= n - A + 1; i++){
for (int j = 1; j <= m - B + 1; j++){
if (!a[i][j]) continue;
if (sum(i, j, i + A - 1, j + B - 1) == A * B){
for (int x = i; x <= i + A - 1; x++){
for (int y = j; y <= j + B - 1; y++){
bomb[x][y] = true;
}
}
}
}
}
// for (int i = n; i >= A; i--){
// for (int j = m; j >= B; j--){
// if (!a[i][j]) continue;
// if (sum(i - A + 1, j - B + 1, i, j) == A * B){
// for (int x = i - A + 1; x <= i; x++){
// for (int y = j - B + 1; y <= j; y++){
// bomb[x][y] = true;
// }
// }
// }
// }
// }
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++){
if (!bomb[i][j] && a[i][j]) return false;
}
}
ans = max(ans, A * B);
return true;
}
void solve(int TC) {
cin >> n >> m;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++){
char ch;
cin >> ch;
a[i][j] = ch - '0';
dp[i][j] = dp[i][j - 1] + a[i][j];
}
}
for (int j = 1; j <= m; j++){
for (int i = 1; i <= n; i++){
dp[i][j] += dp[i - 1][j];
}
}
int A = n, B = m;
for (int j = 1; j <= m; j++){
for (int i = 1; i <= n; i++){
if (a[i][j] == 0) continue;
int k = i;
while (k <= n && a[k][j] == 1) k++;
A = min(A, k - i);
i = k - 1;
}
}
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++){
if (a[i][j] == 0) continue;
int k = j;
while (k <= m && a[i][k] == 1) k++;
B = min(B, k - j);
j = k - 1;
}
}
if (check(A, B)){
cout << ans;
return;
}
if (A < B){
for (int i = 1; i <= A; i++){
int l = 1, r = B;
while (l <= r){
int mid = (l + r) >> 1;
if (check(i, mid)){
l = mid + 1;
} else r = mid - 1;
}
}
} else {
for (int i = 1; i <= B; i++){
int l = 1, r = A;
while (l <= r){
int mid = (l + r) >> 1;
if (check(mid, i)){
l = mid + 1;
} else r = mid - 1;
}
}
}
cout << ans;
}
int main() {
startTime = clock();
cin.tie(nullptr);
cout.tie(nullptr);
ios_base::sync_with_stdio(false);
bool llololcal = false;
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
llololcal = true;
#endif
int TC = 1;
//cin >> TC;
for (int test = 1; test <= TC; test++) {
debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
return 0;
}
Compilation message
bomb.cpp: In function 'int main()':
bomb.cpp:19:20: warning: statement has no effect [-Wunused-value]
19 | #define debug(...) 42
| ^~
bomb.cpp:188:9: note: in expansion of macro 'debug'
188 | debug(test);
| ^~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
456 KB |
Output is correct |
3 |
Correct |
13 ms |
26552 KB |
Output is correct |
4 |
Correct |
13 ms |
26572 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
460 KB |
Output is correct |
9 |
Correct |
1 ms |
460 KB |
Output is correct |
10 |
Correct |
1 ms |
460 KB |
Output is correct |
11 |
Correct |
1 ms |
460 KB |
Output is correct |
12 |
Correct |
1 ms |
460 KB |
Output is correct |
13 |
Correct |
1 ms |
460 KB |
Output is correct |
14 |
Correct |
1 ms |
460 KB |
Output is correct |
15 |
Correct |
1 ms |
460 KB |
Output is correct |
16 |
Correct |
1 ms |
460 KB |
Output is correct |
17 |
Correct |
1 ms |
972 KB |
Output is correct |
18 |
Correct |
1 ms |
1100 KB |
Output is correct |
19 |
Correct |
3 ms |
1348 KB |
Output is correct |
20 |
Correct |
4 ms |
1356 KB |
Output is correct |
21 |
Correct |
1 ms |
844 KB |
Output is correct |
22 |
Correct |
2 ms |
1100 KB |
Output is correct |
23 |
Correct |
8 ms |
1356 KB |
Output is correct |
24 |
Correct |
3 ms |
1220 KB |
Output is correct |
25 |
Correct |
14 ms |
1356 KB |
Output is correct |
26 |
Correct |
2 ms |
1356 KB |
Output is correct |
27 |
Correct |
4 ms |
4044 KB |
Output is correct |
28 |
Correct |
9 ms |
4300 KB |
Output is correct |
29 |
Execution timed out |
1081 ms |
5456 KB |
Time limit exceeded |
30 |
Execution timed out |
1091 ms |
6476 KB |
Time limit exceeded |
31 |
Correct |
891 ms |
5144 KB |
Output is correct |
32 |
Correct |
365 ms |
5964 KB |
Output is correct |
33 |
Execution timed out |
1084 ms |
6732 KB |
Time limit exceeded |
34 |
Correct |
10 ms |
4684 KB |
Output is correct |
35 |
Correct |
73 ms |
6732 KB |
Output is correct |
36 |
Correct |
46 ms |
6732 KB |
Output is correct |
37 |
Correct |
1 ms |
460 KB |
Output is correct |
38 |
Correct |
194 ms |
57568 KB |
Output is correct |
39 |
Correct |
1 ms |
460 KB |
Output is correct |
40 |
Execution timed out |
1094 ms |
16232 KB |
Time limit exceeded |
41 |
Correct |
1 ms |
460 KB |
Output is correct |
42 |
Correct |
63 ms |
1452 KB |
Output is correct |
43 |
Execution timed out |
1088 ms |
57500 KB |
Time limit exceeded |
44 |
Execution timed out |
1089 ms |
6732 KB |
Time limit exceeded |
45 |
Execution timed out |
1089 ms |
57600 KB |
Time limit exceeded |
46 |
Correct |
215 ms |
57540 KB |
Output is correct |
47 |
Execution timed out |
1093 ms |
57552 KB |
Time limit exceeded |
48 |
Execution timed out |
1089 ms |
57648 KB |
Time limit exceeded |
49 |
Correct |
414 ms |
57524 KB |
Output is correct |
50 |
Execution timed out |
1086 ms |
57600 KB |
Time limit exceeded |
51 |
Execution timed out |
1081 ms |
57604 KB |
Time limit exceeded |
52 |
Execution timed out |
1095 ms |
57608 KB |
Time limit exceeded |
53 |
Execution timed out |
1092 ms |
57600 KB |
Time limit exceeded |
54 |
Execution timed out |
1087 ms |
57604 KB |
Time limit exceeded |
55 |
Execution timed out |
1091 ms |
57548 KB |
Time limit exceeded |
56 |
Correct |
207 ms |
57600 KB |
Output is correct |
57 |
Execution timed out |
1100 ms |
57544 KB |
Time limit exceeded |
58 |
Execution timed out |
1102 ms |
57412 KB |
Time limit exceeded |
59 |
Execution timed out |
1075 ms |
57412 KB |
Time limit exceeded |
60 |
Correct |
631 ms |
57380 KB |
Output is correct |
61 |
Correct |
449 ms |
57376 KB |
Output is correct |
62 |
Execution timed out |
1094 ms |
57316 KB |
Time limit exceeded |
63 |
Correct |
903 ms |
57372 KB |
Output is correct |
64 |
Correct |
251 ms |
57284 KB |
Output is correct |
65 |
Execution timed out |
1094 ms |
57344 KB |
Time limit exceeded |
66 |
Execution timed out |
1095 ms |
57412 KB |
Time limit exceeded |
67 |
Execution timed out |
1086 ms |
57352 KB |
Time limit exceeded |
68 |
Execution timed out |
1090 ms |
57292 KB |
Time limit exceeded |
69 |
Execution timed out |
1068 ms |
57344 KB |
Time limit exceeded |
70 |
Execution timed out |
1049 ms |
46148 KB |
Time limit exceeded |
71 |
Execution timed out |
1059 ms |
57376 KB |
Time limit exceeded |
72 |
Execution timed out |
1090 ms |
57352 KB |
Time limit exceeded |
73 |
Execution timed out |
1089 ms |
57300 KB |
Time limit exceeded |
74 |
Execution timed out |
1077 ms |
57364 KB |
Time limit exceeded |
75 |
Execution timed out |
1078 ms |
57348 KB |
Time limit exceeded |
76 |
Execution timed out |
1081 ms |
57352 KB |
Time limit exceeded |
77 |
Execution timed out |
1089 ms |
57276 KB |
Time limit exceeded |
78 |
Execution timed out |
1095 ms |
57344 KB |
Time limit exceeded |
79 |
Execution timed out |
1093 ms |
57344 KB |
Time limit exceeded |
80 |
Execution timed out |
1084 ms |
57352 KB |
Time limit exceeded |
81 |
Execution timed out |
1095 ms |
57284 KB |
Time limit exceeded |
82 |
Execution timed out |
1094 ms |
57344 KB |
Time limit exceeded |
83 |
Execution timed out |
1096 ms |
57352 KB |
Time limit exceeded |
84 |
Execution timed out |
1100 ms |
57344 KB |
Time limit exceeded |
85 |
Execution timed out |
1097 ms |
57412 KB |
Time limit exceeded |
86 |
Execution timed out |
1075 ms |
57604 KB |
Time limit exceeded |
87 |
Execution timed out |
1074 ms |
57576 KB |
Time limit exceeded |
88 |
Execution timed out |
1096 ms |
57600 KB |
Time limit exceeded |
89 |
Execution timed out |
1088 ms |
57600 KB |
Time limit exceeded |
90 |
Execution timed out |
1077 ms |
46456 KB |
Time limit exceeded |
91 |
Execution timed out |
1089 ms |
57608 KB |
Time limit exceeded |
92 |
Execution timed out |
1085 ms |
57604 KB |
Time limit exceeded |
93 |
Execution timed out |
1090 ms |
57608 KB |
Time limit exceeded |
94 |
Execution timed out |
1093 ms |
57536 KB |
Time limit exceeded |
95 |
Execution timed out |
1088 ms |
57540 KB |
Time limit exceeded |
96 |
Execution timed out |
1085 ms |
57504 KB |
Time limit exceeded |
97 |
Execution timed out |
1080 ms |
57592 KB |
Time limit exceeded |
98 |
Execution timed out |
1089 ms |
57600 KB |
Time limit exceeded |
99 |
Execution timed out |
1083 ms |
57620 KB |
Time limit exceeded |
100 |
Execution timed out |
1078 ms |
57476 KB |
Time limit exceeded |