# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833866 | vjudge1 | Bomb (IZhO17_bomb) | C++17 | 386 ms | 60124 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;
int dpHorizontal[2505][2505] = {0};
int dpVertical[2505][2505] = {0};
char arr[2505][2505];
int main()
{
int n, m;
cin >> n >> m;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
cin >> arr[i][j];
}
}
int res = 0;
int sum = 0;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
if(arr[i - 1][j - 1] == '1')
{
dpHorizontal[i][j] = dpHorizontal[i][j - 1] + 1;
}
}
}
for(int i = 1; i <= m; i++)
{
for(int j = 1; j <= n; j++)
{
if(arr[j - 1][i - 1] == '1')
{
dpVertical[j][i] = dpVertical[j - 1][i] + 1;
}
}
}
int minHorizontal = -1;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
if(dpHorizontal[i][j + 1] == 0 && dpHorizontal[i][j] > 0)
{
if(minHorizontal == -1)
{
minHorizontal = dpHorizontal[i][j];
}
else minHorizontal = min(minHorizontal, dpHorizontal[i][j]);
}
}
}
// cout << minHorizontal << endl;
int minVertical = -1;
for(int i = 1; i <= m; i++)
{
for(int j = 1; j <= n; j++)
{
if(dpVertical[j + 1][i] == 0 && dpVertical[j][i] > 0)
{
if(minVertical == -1)
{
minVertical = dpVertical[j][i];
}
else minVertical= min(minVertical, dpVertical[j][i]);
}
}
}
res = minHorizontal * minVertical;
cout << res << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |