Submission #3509511

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"

using namespace std;

const long long int MOD = 1000000007;
//const long long int MOD = 998244353;

long long int N, M, K, H, W, L, R;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N;
	vector<string>s(N);
	for (auto &i : s)cin >> i;
	bool flag = false;
	vector<int>placed(N);
	vector<int>non_placed(N);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (s[i][j] == '#') {
				placed[j] = 1;
				flag = true;
			}
			else {
				non_placed[j] = 1;
			}
		}
	}
	if (!flag) {
		cout << -1 << endl;
		return 0;
	}
	int add = accumulate(non_placed.begin(), non_placed.end(), 0);
	int ans = MOD;
	for (int i = 0; i < N; i++) {
		int box = 0;
		for (int j = 0; j < N; j++) {
			if (s[i][j] == '.') {
				box += 2 - placed[i];
			}
		}
		ans = min(ans,add + box);
	}
	cout << ans << endl;
	return 0;

}

Submission Info

Judge Result