hdu 5745(bitset)

来源：互联网发布：c 函数定义数组长度编辑：程序博客网时间：2024/05/17 07:32
bool型的dp可以用bitset搞
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <bitset>using namespace std;#define N 100200#define M 200020#define mod 1000000007#define LL long long#define ls (i << 1)#define rs (ls | 1)#define md (ll + rr >> 1)#define lson ll, md, ls#define rson md + 1, rr, rsbitset<100020> bs[3];bitset<100020> mc[26 * 26 + 26];int n, m;char p[N], s[N];int calc(char c) {    return c - 'a';}int calc(char a, char b) {    if(a > b) swap(a, b);    return 26 + (a - 'a') * 26 + b - 'a';}int main() {    int cas;    scanf("%d", &cas);    while(cas--) {        scanf("%d%d", &n, &m);        scanf("%s%s", s, p);        for(int i = 0; i < 26; ++i) {            mc[i].reset();            for(int j = 0; j < 26; ++j) {                mc[26 + i * 26 + j].reset();            }        }        for(int i = 0; i < n; ++i) {            mc[calc(s[i])].set(i, 1);            if(i > 0) mc[calc(s[i-1], s[i])].set(i, 1);        }        for(int j = 0; j < m; ++j) {            int now = j % 3;            if(j > 0)                 bs[now] = (bs[(now + 2) % 3] << 1) & mc[calc(p[j])];            else                 bs[now] = mc[calc(p[j])];            if(j == 1) bs[now] |= mc[calc(p[j-1], p[j])];            else if(j > 1) bs[now] |= (bs[(now + 1) % 3] << 2) & mc[calc(p[j-1], p[j])];        }        for(int i = 0; i < n; ++i) {            if(i + m - 1 < n) putchar(bs[(m + 2) % 3][i+m-1] ? '1': '0');            else putchar('0');        }        puts("");    }    return 0;}
0 0