poj3630 Phone List

spy on一下，发现是trie裸题，结果一交就T...

然后把cin改成scanf就A了...

trie的空间一定要开足，要不然RE

 #include <cstdio>
 #include <string>
 #include <iostream>
 #include <cstring>
 using namespace std;;
 const int N = ;
 char s[];
 // poj 3630 Phone List
 struct Trie {
     int tr[N][];
     int top;
     bool ed[N];
     Trie() {
         top = ;
     }
     inline bool insert() {
         int p = ;

         //cout << s << endl;

         for(int i = ; i < strlen(s) - ; i++) {
             int f = s[i] - '';
             if(ed[tr[p][f]]) {
                 return ;
             }
             if(!tr[p][f]) {
                 tr[p][f] = ++top;
             }
             p = tr[p][f];
         }
         int f = s[strlen(s) - ] - '';
         if(tr[p][f]) return ;
         tr[p][f] = ++top;
         p = tr[p][f];
         ed[p] = ;
         return ;
     }
     void DFS(int p) {
         for(int i = ; i <= ; i++) {
             if(tr[p][i]) {
                 DFS(tr[p][i]);
                 tr[p][i] = ;
             }
         }
         if(ed[p]) {
             ed[p] = ;
         }
         return;
     }
     inline void clear() {
         DFS();
         return;
     }
 }trie;

 int main() {
     int T;
     scanf("%d", &T);
     while(T--) {
         trie.clear();
         int n;
         bool f = ;
         scanf("%d", &n);
         for(int i = ; i <= n; i++) {
             scanf("%s", s);
             if(f) {
                 f = trie.insert();
             }
         }
         if(f) {
             printf("YES\n");
         }
         else {
             printf("NO\n");
         }
     }

     return ;
 }

AC代码