hdu 2846 Repository

最新推荐文章于 2022-03-29 22:20:29 发布

GadyPu

最新推荐文章于 2022-03-29 22:20:29 发布

阅读量305

点赞数

分类专栏：搜索 Trie

本文链接：https://blog.csdn.net/u012077152/article/details/48296857

版权

搜索同时被 2 个专栏收录

50 篇文章 0 订阅

订阅专栏

Trie

9 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=2846
字典树，g++ mle c++ ac。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<set>
using std::set;
using std::min;
using std::find;
using std::pair;
using std::vector;
using std::multiset;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cls(arr, val) memset(arr, val, sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define tr(c, i) for(iter(c) i = (c).begin(); i != (c).end(); ++i)
const int N = 100010;
const int INF = 0x3f3f3f3f;
struct Node {
    Node *ch[26];
    int cnt;
    int f;
    Node() {
        rep(i, 26) ch[i] = NULL;
        cnt = 0;
        f = -1;
    }
}*root;
void insert(Node *x, char *str, int f) {
    int d = 0;
    char *p = str;
    while (*p != '\0') {
        d = *p - 'a';
        if (!x->ch[d]) x->ch[d] = new Node();
        x = x->ch[d];
        if (x->f != f) {
            x->f = f;
            x->cnt++;
        }
        p++;
    }
}
int query(Node *x, char *str) {
    char *p = str;
    while (*p != '\0') {
        if (!x || !x->ch[*p - 'a']) return 0;
        x = x->ch[*p - 'a'];
        p++;
    }
    return x->cnt;
}
void built(int t) {
    int n;
    char buf[100];
    rep(i, t) {
        scanf("%s", buf);
        n = strlen(buf);
        rep(j, n) {
            insert(root, buf + j, i);
        }
    }
}
void solve(int n) {
    int m;
    char buf[100];
    root = new Node();
    built(n);
    scanf("%d", &m);
    while (m--) {
        scanf("%s", buf);
        printf("%d\n", query(root, buf));
    }
}
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int n;
    while (~scanf("%d", &n)) {
        solve(n);
    }
    return 0;
}