CK1604-Editorial

editorial
1

Smart Computer-Editorial

Just brute force centers of pulses and their sizes, and check if they intersect or not.

c++ code-

#include <bits/stdc++.h>
using namespace std;

const int N = 20;
int n, m, ans;
char c[N][N];

int main() {

scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
        cin >> c[i][j];            
    }
}

for (int x = 1; x <= n; x++) {
    for (int y = 1;y <= m; y++){
        int r = 0;
        while (c[x + r][y] == 'G' && c[x - r][y] == 'G' &&
               c[x][y + r] == 'G' && c[x][y - r] == 'G') {
            c[x + r][y] = c[x - r][y] = c[x][y + r] = c[x][y - r] = 'g';
            for (int X = 1; X <= n; X++) {
                for (int Y = 1; Y <= m; Y++){
                    int R = 0;
                    while (c[X + R][Y] == 'G' && c[X - R][Y] == 'G' && 
                            c[X][Y + R] == 'G' && c[X][Y - R] == 'G') {
                        ans = max(ans, (1 + 4 * r) * (1 + 4 * R));
                        R++;
                    }
                }
            }
            r++;
        }
        r = 0;
        while (c[x + r][y] == 'g' && c[x - r][y] == 'g' && 
                c[x][y + r] == 'g' && c[x][y - r] == 'g') {
            c[x + r][y] = c[x - r][y] = c[x][y + r] = c[x][y - r] = 'G';
            r++;
        }
    }
}
cout << ans << endl;
return 0;

}