# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456316 | dxz05 | Bomb (IZhO17_bomb) | C++14 | 1104 ms | 55912 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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){
if (min({x1, y1, x2, y2}) < 1 || max({x1, y1, x2, y2}) > n) return -1;
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 fill(int x1, int y1, int x2, int y2){
if (sum(x1, y1, x2, y2) != (x2 - x1 + 1) * (y2 - y1 + 1)) return false;
for (int i = x1; i <= x2; i++){
for (int j = y1; j <= y2; j++){
bomb[i][j] = true;
}
}
return true;
}
bool check(int A, int B){
// if (ans > A * B) return true;
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] || bomb[i][j]) continue;
fill(i, j, i + A - 1, j + B - 1);
}
}
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++){
if (!a[i][j] || bomb[i][j]) continue;
if (fill(i, j, i + A - 1, j + B - 1)) continue;
if (fill(i - A + 1, j, i, j + B - 1)) continue;
if (fill(i, j - B + 1, i + A - 1, j)) continue;
if (fill(i - A + 1, j - B + 1, i, j)) continue;
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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |