Submission #44759471

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define pb(a) push_back(a)
#define MAX(a, b) ((a < b)?b:a)
#define MIN(a, b) ((a > b)?b:a)
#define lcm(a, b) (a / gcd(a, b) * b) // 最小公倍数

typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned int uint;
using namespace std;
// -------------------------------------

char c[2009][2009];
int H, W;

void show() {
  // rep(h, H) {
  //   rep(w, W) {
  //     cout << c[h][w];
  //   }
  //   cout << endl;
  // }
}

bool checkh(int h) {
  char prev = 0;
  int count = 0;
  rep (w, W) {
    if ( c[h][w] != 0 ) count++;

    if ( prev == 0 ) {
      if ( c[h][w] != 0 ) prev = c[h][w];
    } else {
      if ( c[h][w] != 0 ) {
        if ( prev != c[h][w] ) return false;
        prev = c[h][w];
      }
    }
  }
  if ( prev == 0 ) return false;
  if ( count < 2 ) return false;
  return true;
}

bool checkw(int w) {
  char prev = 0;
  int count = 0;
  rep (h, H) {
    if ( c[h][w] != 0 ) count++;
  
    if ( prev == 0 ) {
      if ( c[h][w] != 0 ) prev = c[h][w];
    } else {
      if ( c[h][w] != 0 ) {
        if ( prev != c[h][w] ) return false;
        prev = c[h][w];
      }
    }
  }
  if ( prev == 0 ) return false;
  if ( count < 2 ) return false;
  return true;
}

int main() {
  cin >> H >> W;

  rep(h, H) {
    string s;
    cin >> s;
    rep(w, s.length()) {
      c[h][w] = s[w];
    }
  }

  // cout << "input----" << endl;
  show();

  while (true) {
    vector<int> markh;
    vector<int> markw;
    //1
    rep(h, H) {
      if ( checkh(h) ) markh.pb(h);
    }
    //2
    rep(w, W) {
      if ( checkw(w) ) markw.pb(w);
    }
    // 3
    if ( markh.size() == 0 && markw.size() == 0 ) break;

    // cout << "-----" << endl;
    // cout << "markh: " << markh.size() << ", markw: " << markw.size() << endl;
    show();
    for(int h : markh) {
      rep(w, W) c[h][w] = 0;
    }
    // cout << "-----hdel" << endl;
    show();
    for(int w : markw) {
      rep(h, H) c[h][w] = 0;
    }
    // cout << "-----wdel" << endl;
    show();
  }

  int ans = 0;

  rep(h, H) {
    rep(w, W) {
      if ( c[h][w] != 0 ) ans++;
    }
  }

  cout << ans << endl;

	return 0;
}

Submission Info

Judge Result