Submission #2385242

---

Source Code Expand

#include <cstdio>
#include <iostream>
using namespace std;

int x[200][200];
int y[200][200];
int z[200][200];
int map[200][200];

int main(){
  int a, b, h, w;
  cin >> h >> w >> a >> b;
  for (int i = 0; i < h; i++) {
    string s; cin >> s;
    for (int j = 0; j < w; j++) {
      if (s[j] == '.') map[i][j] = 0;
      else map[i][j] = 1;
    }
  }

  int cz = 0;
  for (int i = 0; i < (h + 1) / 2; i++){
    for (int j = 0; j < (w + 1) / 2; j++) {
      if (i == h-i-1 || j == w-j-i) continue;
      z[i][j] = map[i][j] + map[h-i-1][j] + map[h-i-1][w-j-1] + map[i][w-j-1];
      if (z[i][j] == 4) {
        cz++;
        map[i][j]--;
        map[h-i-1][j]--;
        map[h-i-1][w-j-1]--;
        map[i][w-j-1]--;
      }
    }
  }

  int co = cz * max(a, b);
  int czx = 0; int czy = 0;

  if (w % 2 == 1) {
    for (int i = 0; i < (h+1) / 2; i++) {
      if (i == h-i-1) continue;
      if (map[i][w/2] == 1 && map[h-i-1][w/2] == 1) {
        cz++;
        czx++;
        map[i][w/2]--;
        map[h-i-1][w/2]--;
      }
    }
  }

  co += czx * b;

  if (h % 2 == 1) {
    for (int i = 0; i < (w+1) / 2; i++) {
      if (i == w-i-1) continue;
      if (map[h/2][i] == 1 && map[h/2][w-i-1] == 1) {
        cz++;
        czy++;
        map[h/2][i]--;
        map[h/2][w-i-1]--;
      }
    }
  }

  co += czy * a;

  if (h % 2 == 1 && w % 2 == 1) {
    if (map[h/2][w/2] == 1) {
      cz++;
      map[h/2][w/2]--;
    }
  }


  int dcz = -1;
  for (int i = 0; i < 200; i++) {
    for (int j = 0; j < 200; j++) {
      if (map[i][j] > 0) dcz = 0;
    }
  }

  int cx = 0; int cy = 0;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      x[min(i, h-i-1)][j] += map[i][j];
      y[i][min(j, w-j-1)] += map[i][j];
      if (x[min(i, h-i-1)][j] == 2) {
        cx++;
        x[min(i, h-i-1)][j] -= 2;
      }
      if (y[i][min(j, w-j-1)] == 2) {
        cy++;
        y[i][min(j, w-j-1)] -= 2;
      }
    }
  }
  int dx = -1; int dy = -1;
  for (int i = 0; i < 200; i++) {
    for (int j = 0; j < 200; j++) {
      if (x[i][j] > 0) dx = 0;
      if (y[i][j] > 0) dy = 0;
    }
  }
  //printf("cz: %d, co: %d\n", cz, co);
  cout << co + max((a+b) * (cz+1+dcz) + a * max((cx + dx), 0), (a+b) * (cz+1+dcz) + b * max((cy + dy), 0)) << endl;
  return 0;
}

Submission Info

Judge Result