hdu5687 字典树

hdu5687

 #include <bits/stdc++.h>
 using namespace std;
 const int maxn = 1e5+, n = ;
 struct node {
     int next[];
     int cnt;
     void init() {
         cnt = ;
         memset(next,-,sizeof(next));
     }
 };
 node trie[maxn*n];
 int tot = ;
 void insert(char *s) {
     int cur = , len = strlen(s);
     for (int i = ; i < len; i++) {
         int temp = s[i]-'a';
         int next = trie[cur].next[temp];
         if (next == -) {
             next = ++tot;
             trie[next].init();
             trie[cur].next[temp] = next;
         }
         cur = next;
         trie[cur].cnt++;
     }
 }
 bool find(char *s) {
     int cur = , len = strlen(s);
     for (int i = ; i < len; i++) {
         int temp = s[i]-'a';
         int next = trie[cur].next[temp];
         if (next == -) return false;
         cur = next;
     }
     return trie[cur].cnt > ;
 }
 void del(char * s) {
     int cur = , late, len = strlen(s);
     for (int i = ; i < len; i++) {
         int temp = s[i]-'a';
         int next = trie[cur].next[temp];
         if (next == -) return;
         late = cur;
         cur = next;
     }
     cur = ;
     for (int i = ; i < len; i++) {
         int temp = s[i]-'a';
         int next = trie[cur].next[temp];
         late = cur;
         cur = next;
         trie[cur].cnt--;
     }
     trie[cur].init();
     int temp = s[len-]-'a';
     trie[late].next[temp] = -;
 }
 int main() {
     int n; scanf("%d",&n);
     char cmd[], word[];
     for (int i = ; i <= n; i++) {
         scanf("%s%s",cmd,word);
         if (cmd[] == 'i') insert(word);
         else if (cmd[] == 's') {
             if (find(word)) puts("Yes");
             else puts("No");
         }
         else del(word);
     }
     return ;
 }