# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38376 | antimirage | Bomb (IZhO17_bomb) | C++14 | 1000 ms | 2504 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 <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
using namespace std;
const int N = 250;
int n, m, ans;
int u[N][N], ar[N][N];
bool FL = true;
inline bool check(int w, int h)
{
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
u[i][j] = ar[i][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (ar[i][j] == 1)
{
bool fl = false;
for (int k = max(1, i - w + 1); k <= i; k++)
{
for (int l = max(1, j - h + 1); l <= j; l++)
{
if (u[k][l] == 0)
{
fl = true;
break;
}
}
if (fl) break;
}
if (!fl)
{
for (int k = max(1, i - w + 1); k <= i; k++)
for (int l = max(1, j - h + 1); l <= j; l++)
u[k][l] = -1;
}
}
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
if (u[i][j] == 1)
return false;
}
return true;
}
main ()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
scanf("\n");
for (int j = 1; j <= m; j++)
{
char ch;
scanf("%c", &ch);
ar[i][j] = ch - 48;
if (ar[i][j] == 1)
FL = false;
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (check(i, j))
ans = max(ans, i * j);
}
}
if (FL) ans = 0;
cout << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |