Submission #44747768

---

Source Code Expand

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

int main() {
  int H, W;
  cin >> H >> W;
  char c[H][W];
  for (int h = 0; h < H; ++h) for (int w = 0; w < W; ++w) {
    cin >> c[h][w];
  }

  vector<array<int, 26>> rows(H), cols(W);
  for (auto &row : rows) row = {};
  for (auto &col : cols) col = {};
  for (int h = 0; h < H; ++h) for (int w = 0; w < W; ++w) {
    rows[h][c[h][w]-'a']++;
    cols[w][c[h][w]-'a']++;
  }

  bool flag = true;
  while (flag) {
    flag = false;
    array<int, 26> sub_row{}, sub_col{};
    for (auto it = rows.begin(); it != rows.end();) {
      if (count(it->begin(), it->end(), 0) == 25) {
        auto deleted = find_if(it->begin(), it->end(), [](int i) {return i > 0;});
        if (*deleted > 1) {
          flag = true;
          int d = distance(it->begin(), deleted);
          sub_col[d]++;
          it = rows.erase(it);
          continue;
        }
      }
      ++it;
    }
    for (auto it = cols.begin(); it != cols.end();) {
      if (count(it->begin(), it->end(), 0) == 25) {
        auto deleted = find_if(it->begin(), it->end(), [](int i) {return i > 0;});
        if (*deleted > 1) {
          flag = true;
          int d = distance(it->begin(), deleted);
          sub_row[d]++;
          it = cols.erase(it);
          continue;
        }
      }
      ++it;
    }
    for (auto &row : rows) 
      for (int i = 0; i < 26; ++i)
        row[i] -= sub_row[i];
    for (auto &col : cols) 
      for (int i = 0; i < 26; ++i)
        col[i] -= sub_col[i];
  }

  int ans = 0;
  for (auto &row : rows) for (auto c : row) ans += c;
  cout << ans << endl;
}

Submission Info

Judge Result