hdu 5972 Regular Number(Shift-And算法)

                 1 #include<bits/stdc++.h>
 2#define F(i,a,b) for(int i=a;i<=b;++i)
 3usingnamespace std;
 4 5namespace Shift_And{
 6constint N=5e6+7,tyn=11;
 7     bitset<1007>s[tyn],ans;
 8int len;char str[N];
 9voidin(int n)
10    {
11         F(i,0,tyn-1)s[i].reset();
12        ans.reset();
13         F(i,1,n)
14        {
15int num,x;
16             scanf("%d",&num);
17             F(j,1,num)scanf("%d",&x),s[x][i]=1;
18        }
19         getchar(),gets(str+1),len=strlen(str+1);
20    }
21void shift_and(int n)
22    {
23         F(i,1,len)
24        {
25             ans=ans<<1,ans[1]=1;
26             ans&=s[str[i]-‘0‘];
27if(ans[n])
28            {
29char tp=str[i+1];
30                 str[i+1]=0;
31                 puts(str+i-n+1);
32                 str[i+1]=tp;
33            }
34        }
3536    }
37}
3839int main()
40{
41int n;
42while(~scanf("%d",&n))
43    {
44         Shift_And::in(n);
45        Shift_And::shift_and(n);
46    }
47return0;
48 }