# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96709 | choikiwon | Bomb (IZhO17_bomb) | C++17 | 860 ms | 112456 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.
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MN = 2525;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int N, M;
char G[MN][MN];
int cc[MN][MN][4];
int dp(int r, int c, int d) {
if(r < 0 || N <= r || c < 0 || M <= c) return 0;
int &ret = cc[r][c][d];
if(ret != -1) return ret;
if(G[r][c] == '0') return ret = 0;
return ret = dp(r + dy[d], c + dx[d], d) + 1;
}
int mn[MN];
int main() {
//*
scanf("%d %d", &N, &M);
for(int i = 0; i < N; i++) {
scanf("\n");
for(int j = 0; j < M; j++) {
scanf("%c", &G[i][j]);
}
}
//*/
memset(cc, -1, sizeof(cc));
int mnw = 1e9;
for(int i = 0; i < N; i++) for(int j = 0; j < M; j++) if(G[i][j] == '1') {
mnw = min(mnw, dp(i, j, 2) + dp(i, j, 3) - 1);
}
for(int i = 0; i <= mnw; i++) mn[i] = 1e9;
for(int i = 0; i < N; i++) {
int len = 0;
for(int j = 0; j < M; j++) {
if(G[i][j] == '1') {
if(dp(i, j, 3) == 1 && dp(i, j, 0) == 1) {
len = 1;
}
if(len) {
mn[len] = min(mn[len], dp(i, j, 1));
len++;
}
}
else len = 0;
}
len = 0;
for(int j = M - 1; j >= 0; j--) {
if(G[i][j] == '1') {
if(dp(i, j, 2) == 1 && dp(i, j, 0) == 1) {
len = 1;
}
if(len) {
mn[len] = min(mn[len], dp(i, j, 1));
len++;
}
}
else len = 0;
}
}
int ans = 0;
for(int i = 1; i <= mnw; i++) {
mn[i] = min(mn[i], mn[i - 1]);
ans = max(ans, mn[i] * i);
}
printf("%d", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |