http://lx.lanqiao.cn/problem.page?gpid=T519
题意:给出一个n*m的矩阵(其实就是n个 m位二进制数),有几对这样的二进制数 x1,x2,满足 x1按位取反后得到x2。
题解:如果按照我这样理解的话那么就很好做了, 用一个hash数组记录每一个二进制数的十进制值,数值数组记录每一个十进制值的个数,对数就是 x1的个数*x2的个数。
代码:
/* ***********************************************
Author :pall_scall
Created Time :2019年03月17日 星期日 21时23分44秒
File Name :acm.cpp
************************************************ */
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) x&-x
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const double eps = 1e-6;
const double pi = acos(-1.0);
int a[maxn],mp[maxn*25];
int n,m;
int rev(int sum){
int x = 0,cnt = sum;
for(int i = 0; i < m; i++){
if(cnt&(1<<i)) continue;
x += (1<<i);
}
return x;
}
int main(){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
//printf("%d %d\n",-10,~(-10));
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++){
int x,sum = 0;
for(int j = 1; j <= m; j++){
scanf("%d",&x);
if(x == 1)
sum += (1<<(m-j));
}
mp[sum]++;
a[i] = sum;
}
int ans = 0;
for(int i = 1; i <= n; i++){
int sum = rev(a[i]);
int sum2 = rev(sum);
if(sum2 == a[i]){
//cout<<"sssss"<<endl;
ans += mp[a[i]]*mp[sum];
mp[a[i]] = 0;
mp[sum] = 0;
}
}
printf("%d\n",ans);
return 0;
}