题目大意:
有 n ( ≤ 20 ) n(\le20) n(≤20)行 m ( ≤ 100000 ) m(\le 100000) m(≤100000)列的 01 01 01字符串,可以对这样的字符串某一行或者某一列进行翻转( 0 → 1 , 1 → 0 0\rightarrow1,1\rightarrow0 0→1,1→0)操作,询问,操作能得到的字符串内 1 1 1的最小数量
解题思路:
- 首先可以得到一个非常明显的结论,可以枚举当前行翻或者不翻,因为每行不会被翻两次(那不如不翻),然后统计每一列 m i n ( n u m j , 0 , n u m j , 1 ) min(num_{j,0},num_{j,1}) min(numj,0,numj,1)的和即可
- 这样的复杂度是 O ( 2 n ⋅ m ) O(2^n\cdot m) O(2n⋅m)显然是不行的
- 我们设 s s s为枚举行翻转的状态, f i = ( b i t i , n − b i t i ) f_i=(bit_i,n-bit_i) fi=(biti,n−biti), b i t i bit_i biti表示 i i i的二进制中 1 1 1的个数, a i a_i ai为第i列的情况, c n t i cnt_i cnti代表原来序列中状态 i i i的个数
- a n s s = ∑ i = 1 m m i n ( b i t a i ⊕ s , n − b i t a i ⊕ s ) = ∑ i = 0 2 n − 1 c n t i ⋅ f i ⊕ s ans_s=\sum_{i=1}^{m}min(bit_{a_i\oplus s}, n - bit_{a_i\oplus s})=\sum_{i=0}^{2^n-1}cnt_i\cdot f_{i \oplus s} anss=∑i=1mmin(bitai⊕s,n−bitai⊕s)=∑i=02n−1cnti⋅fi⊕s
- i ⊕ i ⊕ s = s i\oplus i\oplus s = s i⊕i⊕s=s, a n s s = ∑ i ⊕ j = = s c n t i ⋅ f j ans_s = \sum_{i\oplus j == s}cnt_i\cdot f_j anss=∑i⊕j==scnti⋅fj
- 标准
F
W
T
FWT
FWT
(话说从 C F CF CF挑 D P DP DP的题目为啥会有这个)
AC代码:
#include <bits/stdc++.h>
#define ft first
#define sd second
#define pb push_back
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0) //不能跟puts混用
#define seteps(N) fixed << setprecision(N)
#define endl "\n"
const int maxn = 22;
const int maxm = 1e5 + 10;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
int n, m;
char c[maxn][maxm];
int cnt[(1 << 20) + 100], f[(1 << 20) + 100];
void XOR(int *f, int x = 1) {
int s = (1 << n);
for (int o = 2, k = 1; o <= s; o <<= 1, k <<= 1)
for (int i = 0; i < s; i += o)
for (int j = 0; j < k; j++) {
f[i+j] += f[i+j+k],
f[i+j+k] = f[i+j] - f[i+j+k] - f[i+j+k];
if (x == -1) f[i + j] /= 2, f[i + j + k] /= 2;
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> c[i] + 1;
for (int j = 1; j <= m; j++) {
int res = 0, num = 0;
for (int i = 1; i <= n; i++) res |= (c[i][j] - '0') << (i - 1);
cnt[res]++;
}
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < n; j++)
if ((i >> j) & 1) f[i]++;
f[i] = min(f[i], n - f[i]);
}
XOR(cnt), XOR(f);
for (int i = 0; i < (1 << n); i++) cnt[i] *= f[i];
XOR(cnt, -1);
int ans = 0x3f3f3f3f;
for (int i = 0; i < (1 << n); i++) ans = min(ans, cnt[i]);
cout << ans << endl;
return 0;
}