Find the Clones Trie Tree
2024-08-31 02:54:25
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 8306 | Accepted: 3130 |
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.
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<queue>
#include<deque>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<fstream>
#include<memory>
#include<list>
#include<string>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MAXN 20003
#define L 20
#define INF 1000000009
#define eps 0.00000001
/*
给出多个DNA序列 要求有i份copy的DNA序列数
先插入结点 计算个数
最后搜一下
*/
int n, m;
int cnt[MAXN];
char s[L];
typedef struct Treenode
{
int cnt;
struct Treenode* Next[];
}*Tree;
Tree Newnode()
{
Tree T = (Tree)malloc(sizeof(Treenode));
memset(T->Next, NULL, sizeof(T->Next));
T->cnt = -;
return T;
}
void Insert(char s[], Tree T)
{
if (!T)
T = Newnode();
int p = ,k;
while (s[p])
{
if (s[p] == 'A') k = ;
else if (s[p] == 'C') k = ;
else if (s[p] == 'G') k = ;
else k = ;
if (!T->Next[k])
{
T->Next[k] = Newnode();
}
T = T->Next[k];
p++;
}
if (T->cnt == -)
T->cnt = ;
else
T->cnt++;
}
void dfs(Tree T)
{
if (!T) return;
if (T->cnt != -)
{
cnt[T->cnt]++;
return;
}
for (int i = ; i < ; i++)
dfs(T->Next[i]);
}
int main()
{
while (scanf("%d%d", &n, &m), n + m)
{
Tree T = Newnode();
memset(cnt, , sizeof(cnt));
for (int i = ; i < n; i++)
{
scanf("%s", s);
Insert(s, T);
}
dfs(T);
for (int i = ; i < n; i++)
{
printf("%d\n", cnt[i + ]);
}
}
return ;
}
最新文章
- js比较版本号
- 第十一篇:SOUI系统资源管理
- [C++] 如何查看DLL有哪些函数
- Java 并发同步器之CountDownLatch、CyclicBarrier
- Android NDK OpenCV C++
- stuts1:(Struts)Action类及其相关类
- MYSQL 转换字符集的 2 种方法
- KVM客户机使用主机USB设备
- 2019年3月8日_CCF-A类文章分享
- IOS应用内嵌cocos2dx游戏项目
- SpringBoot2.0之整合Apollo
- UI Recorder 安装教程(二)
- 【转】vi 写完文件保存时才发现是 readonly
- MyBatis---使用MyBatis Generator生成Dto、Dao、Mapping
- Asp.net2.0之自定义控件ImageButton
- python中时间差中seconds和total_seconds
- webservice的 发布
- 20172319 《Java程序设计教程》 第9周学习总结
- windows彻底删除Oralce
- java反射机制_读取properties
热门文章
- [RK3288][Android6.0] U-boot 启动流程小结【转】
- 2017 Multi-University Training Contest - Team 2 &;&;hdu 6053 TrickGCD
- bzoj 1191 [ HNOI 2006 ] 超级英雄Hero —— 二分图匹配
- 520D
- selenium3 + Python - 处理浏览器弹窗(转载)
- NPM 国内镜像使用方法
- layui框架 各种小结
- MySQL 的单表查询
- 【sqli-labs】 less14 POST - Double Injection - Single quotes- String -twist (POST型单引号变形双注入)
- 预备篇 I :范畴与函子