Regular Number HDU-5972

Regular Number HDU-5972

• Regular Number HDU-5972

Regular Number HDU-5972

题意：给出一个由‘|’构成的正则表达式描述的模式串，求出给出文本串中所包含的所有模式子串。
思路：依靠bitset+shif-and匹配算法解决。(shift-and和shift-or算法)
注意：本题把string卡住了，只能用char来进行输入输出。
AC代码如下:

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<map>
#include<sstream>
#include<set>
#include<bitset>
using namespace std;
#define inf 0x3f3f3f3f
bitset<1005>B[15],D;
char s[5000005];
int n, m, x;
int main()
{
	while (scanf("%d", &n) != EOF)
	{
		for (int i = 0; i < 10; i++)
			B[i].reset();
		D.reset();
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &m);
			for (int j = 0; j < m; j++)
			{
				scanf("%d", &x);
				B[x].set(i);
			}
		}
		scanf("%s", s);
		int len = strlen(s);
		for (int i = 0; i < len; i++)
		{
			D <<= 1;
			D[0] = 1;
			D &= B[s[i] - '0'];
			if (D[n - 1] == 1) {
				char tmp = s[i + 1];
				s[i + 1] = '\0';
				puts(s + i - n + 1);
				s[i + 1] = tmp;
			}
		}
	}
	return 0;
}