codevs4189 字典（trie树）

思路：太简单了，莫得思路。 

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define Max 400010
#define mod 123456789
using namespace std;
int trie[Max][26], tot, sum[Max], n;
string s;
void ins(string s) {
    int root = 0;
    for(int i = 0; i < s.size(); i++) {
        int r = s[i] - 'a';
        if(!trie[root][r])
            trie[root][r] = ++tot;
        root = trie[root][r];
    }
}
int sea(string s) {
    int root = 0;
    for(int i = 0; i < s.size(); i++) {
        int r = s[i] - 'a';
        if(!trie[root][r])
            return 0;
        root = trie[root][r];
    }
    return 1;
}
int main() {
    cin >> n;
    for(int i = 0; i < n; i++) {
        cin >> s;
        ins(s);
    }
    cin >> n;
    for(int i = 0; i < n; i++) {
        cin >> s;
        if(sea(s))
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}