Submission #1172741

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> ipair;
typedef tuple<int, int, int> ituple;

const int INF = (int)2e9;
// const int MOD = (int)1e9 + 7;
// const double EPS = 1e-10;

#define MAX_N 500 + 2

void exec(){
  int n;
  string a[MAX_N];
  int allBlackRow = -1;
  bool isAllWhite = true;

  cin >> n;

  for (int i = 0; i < n; i++){
    bool isAllBlack = true;
    cin >> a[i];
    for (int j = 0; j < n; j++){
      if (a[i][j] != '#'){
        isAllBlack = false;
      }
      if (a[i][j] == '#'){
        isAllWhite = false;
      }
    }
    if (isAllBlack){
      allBlackRow = i;
    }
  }

  if (isAllWhite){
    cout << -1 << endl;
    return;
  }

  int result = 0;
  // 真っ黒な行を探す
  if (allBlackRow == -1){
    // 列に黒があるか？
    bool existsBlackInColumn[n];

    for (int i = 0; i < n; i++){
      existsBlackInColumn[i] = false;
      for (int j = 0; j < n; j++){
        if (a[j][i] == '#'){
          existsBlackInColumn[i] = true;
          break;
        }
      }
    }

    int minimumChangeRaw = INF;
    for (int i = 0; i < n; i++){
      int changeColumns = 0;
      int whiteNum = 0;
      for (int j = 0; j < n; j++){
        if (a[i][j] == '.'){
          whiteNum++;
        }
      }
      if (existsBlackInColumn[i]){
        changeColumns += whiteNum;
      }
      else{
        changeColumns += whiteNum + 1;
      }
      minimumChangeRaw = min(minimumChangeRaw, changeColumns);
    }

    result += minimumChangeRaw;
  }

  // 白がある列を探す
  for (int i = 0; i < n; i++){
    for (int j = 0; j < n; j++){
      if (a[j][i] == '.'){
        result++;
        break;
      }
    }
  }

  cout << result << endl;

}

void solve(){
  int t = 1;
  // scanf("%d", &t);
  for (int i = 0; i < t; i++){
    exec();
  }
}

int main(){
  solve();
  return 0;
}

Submission Info

Judge Result