#include <bits/stdc++.h>
using namespace std;
#define int long long
#define str string
#define fastio ios::sync_with_stdio(0), cin.tie(0);
#define fs first
#define ss second
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define len(x) x.size()
#define print(a) \
for (auto &x : a) \
cout << x << " "; \
cout << endl;
#define printmp(a) \
for (auto &x : a) \
cout << x.fs << " " << x.ss << endl;
const int mod = 1e9 + 7;
void solve(){
int n, m;
cin >> n >> m;
vector<vector<char>> a(n, vector<char> (m));
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
cin >> a[i][j];
if(n * n * m * m <= 4e8){
vector<vector<int>> pref(n + 1, vector<int> (m + 1));
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
pref[i + 1][j + 1] = pref[i][j + 1] + pref[i + 1][j] - pref[i][j] + (a[i][j] == '0');
vector<vector<array<int, 2>>> dp(n, vector<array<int, 2>> (m, {0, 0}));
int ans = 1;
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= m; j ++){
bool flag = 1;
for(int x = 0; x < n; x ++){
for(int y = 0; y < m; y ++){
if(x + i <= n and y + j <= m and pref[x + i][y + j] - pref[x + i][y] - pref[x][y + j] + pref[x][y] == 0)
dp[x][y] = {i, j};
else{
dp[x][y] = {0, 0};
if(y > 0 and dp[x][y - 1][1] > 1)
dp[x][y] = {dp[x][y - 1][0], dp[x][y - 1][1] - 1};
if(x > 0 and dp[x - 1][y][0] > 1)
dp[x][y] = max(dp[x][y], {dp[x - 1][y][0] - 1, dp[x - 1][y][1]});
}
if(a[x][y] == '1' and dp[x][y][0] == 0 and dp[x][y][1] == 0){
flag = 0;
break;
}
}
if(!flag)
break;
}
if(flag)
ans = max(ans, i * j);
else
break;
}
}
cout << ans;
return;
}
vector<vector<int>> dp_right(n, vector<int>(m)), dp_down(n, vector<int>(m));
for(int i = n - 1; i >= 0; i --){
for(int j = m - 1; j >= 0; j --){
if(a[i][j] == '1'){
dp_right[i][j] = (j == m - 1 ? 0 : dp_right[i][j + 1]) + 1;
dp_down[i][j] = (i == n - 1 ? 0 : dp_down[i + 1][j]) + 1;
}
else{
dp_right[i][j] = 0;
dp_down[i][j] = 0;
}
}
}
int x = m, y = n;
for(int i = 0; i < n; i ++){
for(int j = 0; j < m; j ++){
if(a[i][j] == '1'){
if(j == 0 or a[i][j - 1] == '0')
x = min(x, dp_right[i][j]);
if(i == 0 or a[i - 1][j] == '0')
y = min(y, dp_down[i][j]);
}
}
}
cout << x * y << endl;
}
signed main()
{
fastio;
#ifdef Javohir
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
while (t--)
{
solve();
cout << endl;
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
5 ms |
860 KB |
Output is correct |
| 4 |
Correct |
1 ms |
860 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
0 ms |
344 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
1 ms |
604 KB |
Output is correct |
| 20 |
Correct |
1 ms |
604 KB |
Output is correct |
| 21 |
Correct |
1 ms |
344 KB |
Output is correct |
| 22 |
Correct |
1 ms |
600 KB |
Output is correct |
| 23 |
Correct |
8 ms |
604 KB |
Output is correct |
| 24 |
Correct |
1 ms |
604 KB |
Output is correct |
| 25 |
Correct |
5 ms |
604 KB |
Output is correct |
| 26 |
Correct |
4 ms |
604 KB |
Output is correct |
| 27 |
Correct |
2 ms |
1628 KB |
Output is correct |
| 28 |
Incorrect |
2 ms |
2140 KB |
Output isn't correct |
| 29 |
Incorrect |
2 ms |
2396 KB |
Output isn't correct |
| 30 |
Incorrect |
3 ms |
3420 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
2908 KB |
Output isn't correct |
| 32 |
Incorrect |
2 ms |
2908 KB |
Output isn't correct |
| 33 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 34 |
Incorrect |
2 ms |
1628 KB |
Output isn't correct |
| 35 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 36 |
Correct |
3 ms |
3676 KB |
Output is correct |
| 37 |
Correct |
0 ms |
348 KB |
Output is correct |
| 38 |
Correct |
97 ms |
104688 KB |
Output is correct |
| 39 |
Correct |
0 ms |
348 KB |
Output is correct |
| 40 |
Incorrect |
12 ms |
13280 KB |
Output isn't correct |
| 41 |
Correct |
1 ms |
344 KB |
Output is correct |
| 42 |
Correct |
54 ms |
700 KB |
Output is correct |
| 43 |
Correct |
95 ms |
104700 KB |
Output is correct |
| 44 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 45 |
Incorrect |
94 ms |
104528 KB |
Output isn't correct |
| 46 |
Correct |
103 ms |
104692 KB |
Output is correct |
| 47 |
Incorrect |
98 ms |
104444 KB |
Output isn't correct |
| 48 |
Incorrect |
99 ms |
104528 KB |
Output isn't correct |
| 49 |
Correct |
106 ms |
104700 KB |
Output is correct |
| 50 |
Incorrect |
96 ms |
104532 KB |
Output isn't correct |
| 51 |
Incorrect |
101 ms |
104492 KB |
Output isn't correct |
| 52 |
Incorrect |
101 ms |
104700 KB |
Output isn't correct |
| 53 |
Incorrect |
94 ms |
104784 KB |
Output isn't correct |
| 54 |
Incorrect |
93 ms |
104532 KB |
Output isn't correct |
| 55 |
Incorrect |
92 ms |
104532 KB |
Output isn't correct |
| 56 |
Correct |
106 ms |
104528 KB |
Output is correct |
| 57 |
Incorrect |
93 ms |
104528 KB |
Output isn't correct |
| 58 |
Incorrect |
91 ms |
104528 KB |
Output isn't correct |
| 59 |
Incorrect |
91 ms |
104696 KB |
Output isn't correct |
| 60 |
Correct |
93 ms |
104696 KB |
Output is correct |
| 61 |
Correct |
101 ms |
104532 KB |
Output is correct |
| 62 |
Correct |
94 ms |
104532 KB |
Output is correct |
| 63 |
Correct |
91 ms |
104532 KB |
Output is correct |
| 64 |
Correct |
86 ms |
104528 KB |
Output is correct |
| 65 |
Incorrect |
91 ms |
104684 KB |
Output isn't correct |
| 66 |
Incorrect |
93 ms |
104532 KB |
Output isn't correct |
| 67 |
Incorrect |
95 ms |
104532 KB |
Output isn't correct |
| 68 |
Incorrect |
94 ms |
104684 KB |
Output isn't correct |
| 69 |
Incorrect |
92 ms |
104704 KB |
Output isn't correct |
| 70 |
Incorrect |
60 ms |
67216 KB |
Output isn't correct |
| 71 |
Incorrect |
93 ms |
104536 KB |
Output isn't correct |
| 72 |
Incorrect |
89 ms |
104532 KB |
Output isn't correct |
| 73 |
Incorrect |
86 ms |
104528 KB |
Output isn't correct |
| 74 |
Incorrect |
92 ms |
104532 KB |
Output isn't correct |
| 75 |
Incorrect |
92 ms |
104700 KB |
Output isn't correct |
| 76 |
Incorrect |
92 ms |
104532 KB |
Output isn't correct |
| 77 |
Incorrect |
88 ms |
104528 KB |
Output isn't correct |
| 78 |
Incorrect |
88 ms |
104696 KB |
Output isn't correct |
| 79 |
Incorrect |
95 ms |
104700 KB |
Output isn't correct |
| 80 |
Incorrect |
88 ms |
104528 KB |
Output isn't correct |
| 81 |
Incorrect |
89 ms |
104532 KB |
Output isn't correct |
| 82 |
Incorrect |
91 ms |
104536 KB |
Output isn't correct |
| 83 |
Incorrect |
90 ms |
104532 KB |
Output isn't correct |
| 84 |
Incorrect |
90 ms |
104528 KB |
Output isn't correct |
| 85 |
Incorrect |
92 ms |
104500 KB |
Output isn't correct |
| 86 |
Incorrect |
97 ms |
104532 KB |
Output isn't correct |
| 87 |
Incorrect |
93 ms |
104700 KB |
Output isn't correct |
| 88 |
Incorrect |
99 ms |
104528 KB |
Output isn't correct |
| 89 |
Incorrect |
91 ms |
104528 KB |
Output isn't correct |
| 90 |
Incorrect |
60 ms |
67156 KB |
Output isn't correct |
| 91 |
Incorrect |
91 ms |
104528 KB |
Output isn't correct |
| 92 |
Incorrect |
88 ms |
104528 KB |
Output isn't correct |
| 93 |
Incorrect |
94 ms |
104528 KB |
Output isn't correct |
| 94 |
Incorrect |
96 ms |
104532 KB |
Output isn't correct |
| 95 |
Incorrect |
93 ms |
104532 KB |
Output isn't correct |
| 96 |
Incorrect |
92 ms |
104528 KB |
Output isn't correct |
| 97 |
Incorrect |
96 ms |
104692 KB |
Output isn't correct |
| 98 |
Incorrect |
92 ms |
104508 KB |
Output isn't correct |
| 99 |
Incorrect |
98 ms |
104680 KB |
Output isn't correct |
| 100 |
Incorrect |
92 ms |
104680 KB |
Output isn't correct |
