{"id":705,"date":"2020-07-24T22:29:26","date_gmt":"2020-07-24T14:29:26","guid":{"rendered":"http:\/\/www.zyhcoding.club\/?p=705"},"modified":"2020-09-28T21:13:58","modified_gmt":"2020-09-28T13:13:58","slug":"%e9%98%bf%e7%8b%b8%e7%9a%84%e5%ad%97%e7%ac%a6%e4%b8%b2","status":"publish","type":"post","link":"http:\/\/www.zyhcoding.club\/index.php\/2020\/07\/24\/%e9%98%bf%e7%8b%b8%e7%9a%84%e5%ad%97%e7%ac%a6%e4%b8%b2\/","title":{"rendered":"AC\u81ea\u52a8\u673a\u96c6\u9526"},"content":{"rendered":"

\u963f\u72f8\u7684\u6253\u5b57\u673a<\/a> AC\u81ea\u52a8\u673a+fail\u6811+DFS\u5e8f+\u6811\u72b6\u6570\u7ec4<\/h3>\n

n\u4e2a\u5b57\u7b26\u4e32\uff0cm\u6b21\u8be2\u95ee\uff0c\u6bcf\u6b21\u8be2\u95ee(x, y)\uff0c\u8f93\u51fa\u5b57\u7b26\u4e32x\u5728\u5b57\u7b26\u4e32y\u4e2d\u51fa\u73b0\u7684\u6b21\u6570\u3002\u5bf9\u4e8e\u5b57\u7b26\u4e32x\u548cy\uff1a<\/p>\n

\n

\u82e5x\u5728y\u4e2d\u51fa\u73b0\u8fc7\uff0c\u5219y\u5728Trie\u6811\u4e0a\u7684\u6240\u6709\u7ed3\u70b9\u4e2d\uff0c\u4e00\u5b9a\u5b58\u57281\u4e2a\u4ee5\u4e0a\u7684\u7ed3\u70b9\uff0c\u6ee1\u8db3\uff1a\u6cbf\u7740\u8be5\u7ed3\u70b9\u7684fail\u8fb9\u8d70\uff0c\u4f1a\u8d70\u5230x\u5bf9\u5e94\u7684\u7ec8\u7ed3\u70b9\u3002x\u5728y\u4e2d\u51fa\u73b0\u7684\u6b21\u6570\uff0c\u5373\u4e3a\u6ee1\u8db3\u8fd9\u4e2a\u6761\u4ef6\u7684\u7ed3\u70b9\u7684\u4e2a\u6570\u3002
\nx\u5728y\u4e2d\u51fa\u73b0\u7684\u6b21\u6570\u4e5f\u7b49\u4e8e\uff1a\u628afail\u8fb9\u53cd\u5411\uff0c\u6784\u6210\u7684\u4ee50\u4e3a\u6839\u7684\u6811\uff0c\u4ee5x\u7684\u7ec8\u7ed3\u70b9\u4e3a\u6839\u7684\u5b50\u6811\u4e2d\uff0c\u6709\u591a\u5c11\u4e2a\u70b9\u5c5e\u4e8e\u5b57\u7b26\u4e32y\uff0cx\u5728y\u4e2d\u5c31\u51fa\u73b0\u4e86\u591a\u5c11\u6b21\u3002(\u4ee5x\u4e3a\u6839\u7684\u5b50\u6811\u4e2d\u7684\u6240\u6709\u5b69\u5b50\u7ed3\u70b9\uff0c\u6240\u5404\u81ea\u5bf9\u5e94\u7684\u5b57\u7b26\u4e32\u4e2d\uff0cx\u90fd\u4f5c\u4e3a\u4e00\u4e2a\u540e\u7f00\u51fa\u73b0)\u3002<\/p>\n<\/blockquote>\n

\u6709\u4e86\u5982\u4e0a\u524d\u63d0\uff0c\u6211\u4eec\u53ef\u4ee5\u8fd9\u6837\u505a\uff1a
\n\u6784\u9020AC\u81ea\u52a8\u673a\uff0c\u8fde\u63a5fail\u8fb9\u3002\u5199\u51fafail\u6811\u7684DFS\u5e8f\uff0cx\u7684\u7ec8\u7ed3\u70b9\u4e3a\u6839\u7684\u5b50\u6811\u7684\u6240\u6709\u5b69\u5b50\u7ed3\u70b9\uff0c\u90fd\u5728x\u540e\u9762\u7684\u67d0\u4e2a\u957f\u5ea6\u7684\u533a\u95f4\u5185\uff0c\u6211\u4eec\u53ea\u9700\u7edf\u8ba1\u8be5\u533a\u95f4\u5185\u6709\u591a\u5c11\u4e2a\u7ed3\u70b9\u5c5e\u4e8ey\u5373\u53ef\u3002\u5982\u4f55\u7edf\u8ba1\uff1f\u904d\u5386Trie\u6811\uff0c\u6bcf\u5411\u4e0b\u8bbf\u95ee\u4e00\u4e2a\u7ed3\u70b9\uff0c\u8fd9\u4e2a\u7ed3\u70b9\u5728DFS\u5e8f\u4e2d\u5bf9\u5e94\u7684\u4f4d\u7f6e\u7684\u6743\u503c\u5c31+1\uff0c\u7ed3\u675f\u8bbf\u95ee\u65f6\u5c31-1\uff0c\u8fd9\u6837\u7684\u8bdd\uff0c\u5f53\u8bbf\u95ee\u5230y\u7684\u7ec8\u7ed3\u70b9\u65f6\uff0cDFS\u5e8f\u4e2d\u6743\u503c\u4e3a1\u7684\u70b9\u5bf9\u5e94\u7684\u5b57\u7b26\u4e32\u5c31\u90fd\u662fy\u7684\u5b50\u4e32\u4e86\uff0c\u90a3\u4e48\u6211\u4eec\u6c42\u4e00\u4e0b\u54ea\u4e9b\u70b9\u5728x\u5b50\u6811\u7684DFS\u533a\u95f4\u5185\u5373\u53ef\uff0c\u8fd9\u4e2a\u8fc7\u7a0b\u53ef\u4ee5\u7528\u6811\u72b6\u6570\u7ec4\u6216\u7ebf\u6bb5\u6811\u6765\u5b8c\u6210\u3002<\/p>\n

#include <cstdio>\n#include <cstring>\n#include <queue>\n#include <algorithm>\n#include <vector>\nconst int maxn = 1e5+5;\nusing namespace std;\n\nchar s[maxn];\nint m;\nint ans[maxn];\ninline int lowbit(int i){\n    return i & (-i);\n}\nstruct query{\n    int x, y;\n    int idx;\n}query[maxn];\nstruct AC_Auto{\n    int Trie[maxn][27], fail[maxn], cnt, root;\n    int num, cur;\n    vector<int> G[maxn];                     \/\/\u5b58fail\u56fe   fail\u6811\u6839\u8282\u70b9\u4e3a0\n    int Sons[maxn];                          \/\/fail\u6811\u4e0a\u6bcf\u4e2a\u7ed3\u70b9\u7684\u5b69\u5b50\u7ed3\u70b9\u4e2a\u6570  \u6ce8\u610f\u662f\u7ed3\u70b9\n    int fa[maxn], mp1[maxn], mp2[maxn];      \/\/mp1[i]\u8868\u793a\u7b2ci\u4e2a\u5b57\u7b26\u4e32\u7684\u7ec8\u7ed3\u70b9\u4f4d\u7f6e\u3002   mp2[i]\u8868\u793a\u7ed3\u70b9i\u5728DFS\u5e8f\u4e2d\u5bf9\u5e94\u7684\u4e0b\u6807\n    int DFS[maxn];\n    int c[maxn];                \/\/\u6811\u72b6\u6570\u7ec4\n\n    AC_Auto(){\n        root = 0;\n        num = 0;    cur = 0;\n    }\n    void insert(char *s, int len){\n        root = num = cnt = 0;\n        for (int i=1; i<=len; i++){\n            if (s[i]=='P'){\n                mp1[++num] = root;                  \/\/;\n            }else if (s[i]=='B'){\n                root = fa[root];\n            }else{\n                if (!Trie[root][s[i]-'a'+1]){\n                    Trie[root][s[i]-'a'+1] = ++cnt;\n                    fa[cnt] = root;\n                }\n                root = Trie[root][s[i]-'a'+1];\n            }\n        }\n        return;\n    }\n    void build(){\n        queue<int> q;\n        for (int i=1; i<27; i++)    if (Trie[0][i])\n            q.push(Trie[0][i]);\n        while (!q.empty()){\n            int tmp = q.front();    q.pop();\n            for (int i=1; i<27; i++){\n                if (Trie[tmp][i]){\n                    fail[Trie[tmp][i]] = Trie[fail[tmp]][i];\n                    q.push(Trie[tmp][i]);\n                }else{\n                    Trie[tmp][i] = Trie[fail[tmp]][i];\n                }\n            }\n        }\n        for (int i=1; i<=cnt; i++)  G[fail[i]].push_back(i);\n        cur = -1;\n        getSons(0);\n        return;\n    }\n\n    int getSons(int rot){\n        Sons[rot] = 0;\n        DFS[++cur] = rot;\n        mp2[rot] = cur;\n        for (int i=0; i<G[rot].size(); i++)\n            Sons[rot] += getSons(G[rot][i]);\n        return Sons[rot]+1;\n    }\n\n    void update(int i, int k){\n        while (i<=cnt){\n            c[i] += k;\n            i += lowbit(i);\n        }\n        return;\n    }\n    int getSum(int l, int r){\n        int ans = 0;\n        while (r){\n            ans += c[r];\n            r -= lowbit(r);\n        }\n        l--;\n        while (l){\n            ans -= c[l];\n            l -= lowbit(l);\n        }\n        return ans;\n    }\n    void solve(char *s, int len){\n        root = 0;\n        cur = 1;\n        for (int i=1; i<=len; i++){\n            if (s[i]=='B'){\n                update(mp2[root], -1);\n                root = fa[root];\n            }else if (s[i]=='P'){\n                for (; root==mp1[query[cur].y] && cur<=m; cur++){\n                    ans[query[cur].idx] = getSum(mp2[mp1[query[cur].x]], mp2[mp1[query[cur].x]] + Sons[mp1[query[cur].x]]);\n                }\n            }else{\n                root = Trie[root][s[i]-'a'+1];\n                update(mp2[root], 1);\n            }\n        }\n        return;\n    }\n}AC;\ninline bool cmp1(struct query a, struct query b){\n    return a.y < b.y;\n}\nint main(){\n    scanf ("%s", s+1);\n    int len = strlen(s+1);\n    AC.insert(s, len);\n    AC.build();\n    scanf ("%d", &m);\n    for (int i=1; i<=m; i++){\n        scanf ("%d %d", &query[i].x, &query[i].y);\n        query[i].idx = i;\n    }\n    sort (query+1, query+m+1, cmp1);\n    AC.solve(s, len);\n    for (int i=1; i<=m; i++)\n        printf ("%d\\n", ans[i]);\n    return 0;\n}<\/code><\/pre>\n
Mike and Friends<\/a><\/h3>\n
\u9898\u610f\uff1an\u4e2a\u5b57\u7b26\u4e32\uff0cm\u6b21\u8be2\u95ee\uff0c\u6bcf\u6b21\u8be2\u95eel, r, k\u3002\u8f93\u51fa\u5b57\u7b26\u4e32k\u5728\u5b57\u7b26\u4e32[l, r]\u4e2d\u51fa\u73b0\u7684\u6b21\u6570\u3002<\/p>\n
\u95ee\u51fa\u73b0\u6b21\u6570\uff0c\u90a3\u80af\u5b9aAC\u81ea\u52a8\u673a\u6ca1\u8dd1\u4e86\u3002\u4ecd\u7136\u5229\u7528\u6027\u8d28\uff1a\u628afail\u8fb9\u53cd\u5411\u5efa\u7acb\u7684\u6811\u79cd\uff0c\u5b57\u7b26\u4e32k\u7684\u7ec8\u7ed3\u70b9\u4e3a\u6839\u7684\u5b50\u6811\u7684\u7ed3\u70b9\u90fd\u662f\u5305\u542bk\u7684\u5b57\u7b26\u4e32\u3002
\n\u5efa\u7acbAC\u81ea\u52a8\u673a\uff0cfail\u8fb9\u53cd\u5411\uff0c\u5199\u51fafail\u6811\u7684DFS\u5e8f\u3002\u5728DFS\u5e8f\u4e0a\u5efa\u7acb\u4e3b\u5e2d\u6811\u3002\u6309\u5b57\u7b26\u4e32\u63d2\u5165\u987a\u5e8f\u8dd1\u4e00\u904d\u81ea\u52a8\u673a\uff0c\u6bcf\u8dd1\u5230\u4e00\u4e2a\u7ed3\u70b9\u5c31\u5728\u524d\u4e00\u68f5\u7ebf\u6bb5\u6811\u7684\u57fa\u7840\u4e0a\u4ee5\u8be5\u7ed3\u70b9\u5728DFS\u5e8f\u7684\u4f4d\u7f6e\u4e3a\u6743\u503c\u65b0\u5efa\u4e00\u4e2a\u7ebf\u6bb5\u6811\u3002\u7ebf\u6bb5\u6811\u6bcf\u4e2a\u7ed3\u70b9\u8868\u793aDFS\u5e8f\u91cc\u533a\u95f4[l, r]\u5185\u7684\u6743\u503c\uff0c\u8981\u6c42k\u7684\u51fa\u73b0\u6b21\u6570\u53ea\u7528\u6c42\u7ebf\u6bb5\u6811\u91cc\u76f8\u5e94\u533a\u95f4\u7684\u6743\u503c\u5373\u53ef\u3002\u8981\u6c42\u5728[l,r]\u5185\u7684\u51fa\u73b0\u6b21\u6570\u53ea\u9700\u4e24\u9897\u7ebf\u6bb5\u6811\u76f8\u51cf\u5f97\u5230\u7684\u6743\u503c\u5373\u53ef\u3002<\/p>\n
#include <iostream>\n#include <string>\n#include <queue>\n#include <vector>\nusing namespace std;\nconst int maxn = 2e5+5;\ntypedef struct Presistial_SegmentTree{\n    int left, right, val;\n}PST;\nint n, m;\nint len[maxn];\nstring s[maxn];\n\nstruct AC_auto{\n    int Trie[maxn][27], fail[maxn], cnt;\n    int mp1[maxn], mp2[maxn], mp3[maxn];\n    vector<int> G[maxn];\n    int Sons[maxn], DFS[maxn], cur;\n\n    PST tree[maxn*30];\n    int top, root[maxn], cnt2;\n\n    AC_auto(){\n        top = cnt = cnt2 = 0;\n        cur = -1;\n    }\n    void insert(string s, int len, int idx){\n        int root = 0;\n        for (int i=0; i<len; i++){\n            if (!Trie[root][s[i]-'a'+1])    Trie[root][s[i]-'a'+1] = ++cnt;\n            root = Trie[root][s[i]-'a'+1];\n        }\n        mp1[idx] = root;\n        return;\n    }\n    void build(){\n        queue<int>  q;\n        for (int i=1; i<27; i++)    if (Trie[0][i])\n            q.push(Trie[0][i]);\n        while (!q.empty()){\n            int tmp = q.front();    q.pop();\n            for (int i=1; i<27; i++){\n                if (Trie[tmp][i]){\n                    fail[Trie[tmp][i]] = Trie[fail[tmp]][i];\n                    q.push(Trie[tmp][i]);\n                }else   Trie[tmp][i] = Trie[fail[tmp]][i];\n            }\n        }\n        for (int i=1; i<=cnt; i++)\n            G[fail[i]].push_back(i);\n        cur = -1;\n        Sons[0] = GetSons(0) - 1;\n        return;\n    }\n    int GetSons(int i){\n        DFS[++cur] = i;\n        mp2[i] = cur;\n        for (int j=0; j<G[i].size(); j++)\n            Sons[i] += GetSons(G[i][j]);\n        return Sons[i] + 1;\n    }\n    int build(int l, int r){\n        int tmp = ++top;\n        if (l==r){\n            tree[tmp].val = 0;\n            return tmp;\n        }\n        int mid = (l+r)>>1;\n        tree[tmp].left = build(l, mid);\n        tree[tmp].right = build(mid+1, r);\n        tree[tmp].val = 0;\n        return tmp;\n    }\n    int add(int src, int l, int r, int target_idx){\n        int tmp = ++top;\n        if (l==r){\n            tree[tmp].val = tree[src].val + 1;\n            return tmp;\n        }\n        int mid = (l+r)>>1;\n        if (mid >= target_idx){\n            tree[tmp].left = add(tree[src].left, l, mid, target_idx);\n            tree[tmp].right = tree[src].right;\n        }else{\n            tree[tmp].right = add(tree[src].right, mid+1, r, target_idx);\n            tree[tmp].left = tree[src].left;\n        }\n        tree[tmp].val = tree[tree[tmp].left].val + tree[tree[tmp].right].val;\n        return tmp;\n    }\n    void solve(){\n        root[0] = build(1, cnt);\n        for (int i=1; i<=n; i++){\n            int tmp = 0;\n            for (int j=0; j<len[i]; j++){\n                tmp = Trie[tmp][s[i][j]-'a'+1];\n                cnt2++;\n                root[cnt2] = add(root[cnt2-1], 1, cnt, mp2[tmp]);\n            }\n            mp3[i] = cnt2;\n        }\n        return;\n    }\n\n    int search(int rt1, int rt2, int l, int r, int target_l, int target_r){\n        if (l>=target_l && r<=target_r)     return tree[rt2].val - tree[rt1].val;\n        int ans = 0;\n        int mid = (l+r)>>1;\n        if (mid>=target_l)  ans += search(tree[rt1].left, tree[rt2].left, l, mid, target_l, target_r);\n        if (mid+1<=target_r)    ans += search(tree[rt1].right, tree[rt2].right, mid+1, r, target_l, target_r);\n        return ans;\n    }\n    int getans(int l, int r, int k){\n        return search(root[mp3[l-1]], root[mp3[r]], 1, cnt, mp2[mp1[k]], mp2[mp1[k]]+Sons[mp1[k]]);\n    }\n\n}ACP;\n\ninline int read(){\n    int x = 0;  char ch = getchar();\n    while (ch<'0' || ch>'9')    ch = getchar();\n    while (ch>='0' && ch<='9'){\n        x = x*10 + ch-'0';\n        ch = getchar();\n    }\n    return x;\n}\nint main(){\n    int l, r, k;\n    n = read(), m = read();\n    for (int i=1; i<=n; i++){\n        cin >> s[i];\n        len[i] = s[i].length();\n        ACP.insert(s[i], len[i], i);\n    }\n    ACP.build();\n    ACP.solve();\n    for (int i=1; i<=m; i++){\n        l = read(), r = read(), k = read();\n        printf ("%d\\n", ACP.getans(l, r, k));\n    }\n    return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u963f\u72f8\u7684\u6253\u5b57\u673a AC\u81ea\u52a8\u673a+fail\u6811+DFS\u5e8f+\u6811\u72b6\u6570\u7ec4 n\u4e2a\u5b57\u7b26\u4e32\uff0cm\u6b21\u8be2\u95ee\uff0c\u6bcf\u6b21\u8be2\u95ee(x, y) […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[11],"tags":[],"_links":{"self":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/705"}],"collection":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/comments?post=705"}],"version-history":[{"count":7,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/705\/revisions"}],"predecessor-version":[{"id":819,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/705\/revisions\/819"}],"wp:attachment":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/media?parent=705"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/categories?post=705"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/tags?post=705"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}