1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i,n) cin >> v[i];
vector<int> cnt(n);
rep(i,n) {
rep(j,n) {
if(v[i][j] == '#') continue;
if(v[i][j] == 'o') cnt[i]++;
}
}
set<P> st;
rep(i,n) {
rep(j,n) {
if(v[i][j] == '-') {
int s = i, t = j;
if(s > t) swap(s,t);
st.insert(P(s,t));
}
}
}
int ans = n;
int m = st.size();
if(m == 0) {
int val = cnt[0];
sort(cnt.begin(),cnt.end());
cnt.erase(unique(cnt.begin(),cnt.end()),cnt.end());
reverse(cnt.begin(),cnt.end());
rep(i,cnt.size()) {
if(val == cnt[i]) {
ans = i;
break;
}
}
} else {
vector<P> v2(st.begin(), st.end());
rep(i,1<<m) {
vector<int> res(cnt.begin(), cnt.end());
rep(j,m) {
P p = v2[j];
if(i & (1<<j)) {
res[p.first]++;
} else {
res[p.second]++;
}
}
int val = res[0];
sort(res.begin(),res.end());
res.erase(unique(res.begin(),res.end()),res.end());
reverse(res.begin(),res.end());
int id = 0;
rep(j,res.size()) {
if(res[j] == val) {
id = j;
break;
}
}
ans = min(ans,id);
}
}
cout << ans + 1 << endl;
return 0;
}
|