poj3945 Find the Clones

Find the Clones

题目背景：

poj2945

分析：还是trie树的裸题，直接先全部读入，然后在每一个串尾结点计数，最后全部扫一遍统计cnt即可。

Source：

 

#include
      
      
       
       
#include
       
       
        
        
#include
        
        
         
         
#include
         
         
          
          
#include
          
          
            #include 
           
             using namespace std; int t, n, tot, m; int cnt[1000000]; string s; struct TRIE { int son[26]; int num; } trie[500000]; void build_trie(string &s) { int len = s.size(); int position = 0; for (int i = 0; i < len; ++i) { if(!trie[position].son[s[i] - 'A']) trie[position].son[s[i] - 'A'] = ++tot; position = trie[position].son[s[i] - 'A']; } trie[position].num++; } void work() { for (int i = 1; i <= n; ++i) cin >> s, build_trie(s); for (int i = 0; i <= tot; ++i) if(trie[i].num) cnt[trie[i].num]++; for (int i = 1; i <= n; ++i) cout << cnt[i] << '\n'; } int main() { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); while(cin >> n >> m) { if(n == 0 && m == 0) break; memset(trie, 0, sizeof(trie)); memset(cnt, 0, sizeof(cnt)); tot = 0; work(); } return 0; }