# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91364 | emil_physmath | Bomb (IZhO17_bomb) | C++14 | 333 ms | 6976 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 <stdio.h>
using namespace std;
bool a[2505][2505], temp[2505][2505];
int FindWid(int n, int m);
int FindLen(int n, int m);
int main()
{
int n, m;
cin>>n>>m;
for (int i=0; i<n; i++)
for (int j=0; j<m; j++)
{
char temp;
scanf(" %c", &temp);
a[i][j]=(temp=='1'?true:false);
}
cout<<FindWid(n, m)*FindLen(n, m)<<'\n';
char I;
cin >> I;
return 0;
}
int FindWid(int n, int m)
{
int minWid=-1;
for (int j=0; j<m; j++)
for (int sti=0; sti<n; sti++)
{
int i=sti;
if (!a[i][j]) continue;
while (i+1<m && a[i+1][j])
i++;
if (minWid==-1 || i-sti+1<minWid)
minWid=i-sti+1;
sti=i;
}
return minWid==-1?0:minWid;
}
int FindLen(int n, int m)
{
int minLen=-1;
for (int i=0; i<n; i++)
for (int stj=0; stj<m; stj++)
{
int j=stj;
if (!a[i][j]) continue;
while (j+1<m && a[i][j+1])
j++;
if (minLen==-1 || j-stj+1<minLen)
minLen=j-stj+1;
stj=j;
}
return minLen==-1?0:minLen;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |