poj 2945 Find the Clones

Find the Clones

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 7145		Accepted: 2659

Description

Doubleville, a small town in Texas, was attacked by the aliens. They have abducted some of the residents and taken them to the a spaceship orbiting around earth. After some (quite unpleasant) human experiments, the aliens cloned the victims, and released multiple copies of them back in Doubleville. So now it might happen that there are 6 identical person named Hugh F. Bumblebee: the original person and its 5 copies. The Federal Bureau of Unauthorized Cloning (FBUC) charged you with the task of determining how many copies were made from each person. To help you in your task, FBUC have collected a DNA sample from each person. All copies of the same person have the same DNA sequence, and different people have different sequences (we know that there are no identical twins in the town, this is not an issue).

Input

The input contains several blocks of test cases. Each case begins with a line containing two integers: the number 1 ≤ n ≤ 20000 people, and the length 1 ≤ m ≤ 20 of the DNA sequences. The next n lines contain the DNA sequences: each line contains a sequence of m characters, where each character is either `A', `C', `G' or `T'. 

The input is terminated by a block with n = m = 0 .

Output

For each test case, you have to output n lines, each line containing a single integer. The first line contains the number of different people that were not copied. The second line contains the number of people that were copied only once (i.e., there are two identical copies for each such person.) The third line contains the number of people that are present in three identical copies, and so on: the i -th line contains the number of persons that are present in i identical copies. For example, if there are 11 samples, one of them is from John Smith, and all the others are from copies of Joe Foobar, then you have to print `1' in the first andthe tenth lines, and `0' in all the other lines.

Sample Input

9 6
AAAAAA
ACACAC
GTTTTG
ACACAC
GTTTTG
ACACAC
ACACAC
TCCCCC
TCCCCC
0 0

Sample Output

1
2
0
1
0
0
0
0
0

Hint

Huge input file, 'scanf' recommended to avoid TLE. 

题目链接：http://poj.org/problem?id=2945

题目大意：给出n行由m个大写字母'A','G','T','C'组成的“基因片段”，输出n行，第i行输出基因片段重复出现i次的基因片段的个数。

解题思路：字典树+哈希。每个基因片段插入完成后在最后一个节点的cnt加1，表示该基因片段重复的次数，hash[cnt]++,表示重复出现cnt次的基因片段的个数。因为cnt的值是在更新的，所以当hash[cnt]值大于0时，要更新cnt值就要把原来hash[cnt]的值减去一个。

代码如下：

#include <cstdio>
#include <cstring>
char s[22];
int hash[20002];
struct node
{
    node *next[26];
    int cnt;
    node()
    {
        memset(next,0,sizeof(next));
        cnt=0;
    }
};
void Inseart(node *p,char *s)
{
    for(int i=0;s[i]!='\0';i++)
    {
        int a=s[i]-'A';
        if(p->next[a]==NULL)
            p->next[a]=new node();
        p=p->next[a];
    }
    if(hash[p->cnt])   //需要更新cnt值时hash值也要更新
        hash[p->cnt]--;
    p->cnt++;
    hash[p->cnt]++;
}
void clear(node *p)  //这题要释放空间，否则会超出内存
{
	for(int i=0;i<26;i++)
		if(p->next[i])
			clear(p->next[i]);
	delete p;
}

int main()
{
    int n,i,m;
    while(scanf("%d%d",&n,&m)&&(n||m))
    {
		node *root=new node();
        memset(hash,0,sizeof(hash));
        for(i=0;i<n;i++)
        {
            scanf("%s",s);
            Inseart(root,s);
        }
        for(i=1;i<=n;i++) //第i行输出重复出现次数为i的基因片段的个数。
        printf("%d\n", hash[i]);
		clear(root);
    }
	return 0;
}