HDU5972Regular Number(ShiftAnd算法 bitset)

#include<bits/stdc++.h>
#define chmax(a, b) (a = (a > b ? a : b))
#define chmin(a, b) (a = (a < b ? a : b))
#define LL long long
//#define int long long 
using namespace std;
const int MAXN = 5e6 + 10;
inline int read() {
    int x = 0, f = 1; char c = getchar();
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int N;
char s[MAXN], tmp = '\0';
bitset<1001> b[11], ans;
void solve() {
    for(int i = 0; i <= N; i++) b[i].reset(); ans.reset();
    for(int i = 0; i < N; i++) {
        int num = read();
        for(int j = 0; j < num; j++) b[read()].set(i);
    }
    gets(s);
    int L = strlen(s);
    for(int i = 0; i < L; i++) {
        ans <<= 1; ans.set(0);
        ans &= b[s[i] - '0'];
        if(ans[N - 1] == 1) swap(s[i + 1], tmp), puts(s + i - N + 1), swap(s[i + 1], tmp);
    }
}
main() {
  scanf("%d", &N); solve();
}
/*
4
3 0 9 7
2 5 7
2 2 5
2 4 5
09755420524
*/