Algorithm
You are given a rectangular cake, represented as an r × c grid. Each cell either has an evil strawberry, or is empty. For example, a 3 × 4 cake may look as follows:
The cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.
Please output the maximum number of cake cells that the cakeminator can eat.
The first line contains two integers r and c (2 ≤ r, c ≤ 10), denoting the number of rows and the number of columns of the cake. The next r lines each contains c characters — the j-th character of the i-th line denotes the content of the cell at row i and column j, and is either one of these:
- '.' character denotes a cake cell with no evil strawberry;
- 'S' character denotes a cake cell with an evil strawberry.
Output the maximum number of cake cells that the cakeminator can eat.
3 4
S...
....
..S.
8
For the first example, one possible way to eat the maximum number of cake cells is as follows (perform 3 eats).
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <stdio.h>
using namespace std;
char board[11][11];
bool rows[10], cols[10];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++) {
scanf(" %c", &board[i][j]);
if(board[i][j] == 'S')
rows[i] = cols[j] = true;
}
int res = 0;
for(int i = 0; i < n; i++)
if(!rows[i])
for(int j = 0; j < m; j++) {
res += (board[i][j] != '#');
board[i][j] = '#';
}
for(int i = 0; i < m; i++)
if(!cols[i])
for(int j = 0; j < n; j++) {
res += (board[j][i] != '#');
board[j][i] = '#';
}
printf("%d\n", res);
return 0;
}Input
S...
....
..S.
Output
Demonstration
Codeforces Solution-Cakeminator-Solution in C, C++, Java, Python