富豪凯匹配串 bitset

bitset使用技巧

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<bitset>
#include<algorithm>
#include<ctime>
using namespace std;
#define ll long long
#define lb long double
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ull unsigned long long
#define endl '\n'
#define clr(a, b) memset(a, b, sizeof(a))
#define lowbit(x) x & -x
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define PB push_back
#define POP pop_back
#define max_ll 9223372036854775807
#define random(x) (rand()%x)
//srand((ll)time(0));
//freopen("E://one.txt","r",stdin); //输入重定向，输入数据将从in.txt文件中读取
//freopen("E://oneout.txt","w",stdout); //输出重定向，输出数据将保存在out.txt文件中
const double eps = 1e-14;
const double pi = acos(-1);
const int maxn = 1e3 + 10;
const int maxm = 1000;
const ll mod = 1e9 + 7;
const int hash_mod = 19260817;
bitset<maxn> a[maxn], q, tmp, p;
int n, m;
char s[maxn];
int main(){
    int len;
    scanf("%d %d", &n, &m);
    for(int i = 1 ; i <= n ; ++ i){
        scanf("%s", s);
        for(int j = 0 ; j < m ; ++ j){
            a[i][j] = s[j] - '0';
        }
    }
    int T;
    scanf("%d", &T);
    for(int i = 1 ; i <= T ; ++ i){
        int cnt = 0;
        scanf("%s", s);
        for(int j = 0 ; j < m ; ++ j){
            if(s[j] == '_'){
                tmp[j] = 0;
                q[j] = 0;
            }
            else{
                tmp[j] = 1;
                q[j] = s[j] - '0';
            }
        }
        for(int j = 1 ; j <= n ; ++ j){
            p = a[j] & tmp;
            if(p == q) cnt ++;
        }
        cout << cnt << endl;
    }
    return 0;
}