# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366809 | Ruxandra985 | Bomb (IZhO17_bomb) | C++14 | 93 ms | 12652 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;
char a[2510][2510];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , m , i , j , miniw , minih , lenc;
fscanf (fin,"%d%d\n",&n,&m);
for (i = 1 ; i <= n ; i++){
for (j = 1 ; j <= m ; j++)
a[i][j] = fgetc(fin);
fgetc(fin);
}
miniw = m + 10;
for (i = 1 ; i <= n ; i++){
lenc = 0;
for (j = 1 ; j <= m ; j++){
if (a[i][j] == '0'){
if (lenc)
miniw = min(miniw , lenc);
lenc = 0;
}
else lenc++;
}
if (lenc)
miniw = min(miniw , lenc);
}
minih = n + 10;
for (j = 1 ; j <= m ; j++){
lenc = 0;
for (i = 1 ; i <= n ; i++){
if (a[i][j] == '0'){
if (lenc)
minih = min(minih , lenc);
lenc = 0;
}
else lenc++;
}
if (lenc)
minih = min(minih , lenc);
}
fprintf (fout,"%d", miniw * minih);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |